Professional Documents
Culture Documents
Actp Iori Route 2011 (Slides)
Actp Iori Route 2011 (Slides)
Transportation Problem
2 Solution Algorithm
Outline of the Algorithm
Loading the Vehicles
Routing the Auto-Carriers
3 Computational Results
4 Conclusions
A real-world motivation
This work is devoted to the study of a real-world case derived from the
everyday activity of a logistic company, whose core business is to deliver
vehicles to dealers by means of a fleet of auto-carriers
Main activities:
receive the vehicles
from the manufacturers
usually by train
stock them in storage
areas
deliver them to the
dealers when ordered
The A-CTP calls for the determination of a set of routes such that:
the demands of the dealers are completely fulfilled
at most Kt auto-carrier are used for each type t
the routing cost is minimum
each route hR, S, ti is load-feasible
NP-hard
Iterated Local Search
NP-hard NP-hard
Iterated Local Search Enumeration tree
P
X
xkp = 1 k S (1)
p=1
X
(`kp xkp + kv (p) xkv (p) ) Lp + ap p = 1, . . . , P (2)
kS
xkp + xlq 1 p, q = 1, . . . , P : p q
k, l S : r (k) > r (l) (3)
ap + ah(p) A
e ph(p) p = 1, . . . , P (4)
0 ap Ap, p = 1, . . . , P (5)
xkp {0, 1} p = 1, . . . , P ; k S (6)
Local Search
We use eight Local Search algorithms:
1 dealer-relocation
intra-route optimization
check-load must be invoked because of LIFO
Local Search
We use eight Local Search algorithms:
1 dealer-relocation
2 1-0 dealer-move
3 1-1 dealer-swap
4 2-1 dealer-swap
inter-route optimizations
many calls to check-load hence need of a tailored implementation
Local Search
We use eight Local Search algorithms:
1 dealer-relocation
2 1-0 dealer-move
3 1-1 dealer-swap
4 2-1 dealer-swap
5 1-1 model-swap
6 2-1 model-swap
inter-route optimizations
attempt smaller variations w.r.t. moves 24
only subsets of identical vehicles are swapped
useful when demands are large
Local Search
We use eight Local Search algorithms:
1 dealer-relocation
2 1-0 dealer-move
3 1-1 dealer-swap
4 2-1 dealer-swap
5 1-1 model-swap
6 2-1 model-swap
7 auto-carrier interchange
exploits the heterogeneous fleet
move vehicles into more suitable auto-carriers
may decrease split deliveries but does not increase number of routes
Local Search
We use eight Local Search algorithms:
1 dealer-relocation
2 1-0 dealer-move
3 1-1 dealer-swap
4 2-1 dealer-swap
5 1-1 model-swap
6 2-1 model-swap
7 auto-carrier interchange
8 route addition
attempt to decrease split deliveries by using one more route
Perturbation Method
CPLEX 12 TE
obj. value (km) 44,180 43,667
# of best values (out of 23) 0 23
# of ILS iterations 58 3057
% CPU time spent for loading 98% 35%
Logistic Company
ILS - Load feasible if ft 1.1
ILS
Jul-01
Jul-02
Jul-03
Jul-06
Jul-07
Jul-08
Jul-09
Jul-10
Jul-13
Jul-14
Jul-15
Jul-16
Jul-17
Jul-20
Jul-21
Jul-22
Jul-23
Jul-24
Jul-27
Jul-28
Jul-29
Jul-30
Jul-31
Improvement by ILS at 1.1 = 6%
Improvement by ILS = 12%, consistent on all instances
DellAmico, Falavigna, Iori (DISMI) Auto-Carrier Transportation ROUTE 2011 21 / 26
Computational Results Results
ILS Multi-Start
obj. value (km) 43,667 44,067
# of best values 23 0
# of iterations 3057 2013
# of auto-carriers (nac ) 82.6 83.2
# of visits (nvis ) 240.0 239.5
%gap
1.60%
1.40%
1.20%
1.00%
0.80%
0.60%
0.40%
0.20%
0.00%
nac nvis km
All loading constraints 82.6 240.0 43,667
No weight +0.1 +0.0 +0.03%
No LIFO 0.9 +2.3 0.73%
Relaxed loading 2.1 +1.1 1.71%
1.08
1.06 nvis
nac
1.04 km
1.02
1.00
0.98
0.96
0 10 20 30 40 50 60 70 80 90 100
(penalty parameter )
Conclusions
Conclusions
Conclusions