Professional Documents
Culture Documents
I.
INTRODUCTION
x ijk d y ik
PROBLEM STATEMENT
II.
(5)
i J,k Ki, j Jk
ijk
ik
i J k
x ijk d y ik
(7)
k K ,i Jk
j J k
'
ijk
'
i J k j J k
C m ax
m ax
kK
C m ax
Note that any solution with a zero ARPI value is optimal. The
VRPLB model has an exponential number of possible
solutions and is a very difficult problem to solve. This
motivated us to develop a genetic algorithm to determine good
solutions in a reasonable amount of time.
100
III.
y ik p ik
i J
x ijk s ijk
kK
(2)
i J k j J k
and
x ijk
where
y ik
ik
m ax k K C k .
relative im balance k =
i J
kKi
288
Genetic Algorithm
STEP 0: Generate an initial population
STEP 1: Evaluate the fitness value of the
chromosomes
STEP 2: Perform selection operation and give those
individual that have better fitness values a
more chance to survive in the next generation.
STEP 3: Perform crossover and mutation operations.
Apply Feasibility Check for each new
offspring.
STEP 4: Perform local search (optional)
STEP 5: Repeat steps 1, 2, 3 and 4 until the GA is
run for the predetermined number of
generation
STEP 5: Select the best chromosome.
Vehicle 1
Customers
Vehicle 2
1
10
Vehicle 3
7
IV.
(11)
f (AR PI: )
ARPI e
m in 0 , Q k d i y ik m in 0 , C k Tk
kK
i J
COMPUTATIONAL EXPERIMENTATION
289
V.
CONCLUSION
ACKNOWLEDGMENT
This paper was partially supported by the Istanbul University.
Research Foundation Project (BAP) No: 10625.
290
TABLE I.
FIRM
GACO
Unconstrained
Vehicle 1
87.00
52.00
Vehicle 2
55.00
102
108
114
120
102
108
114
120
476.70
101.62
107.97
113.94
119.88
101.94
107.03
114.00
119.88
86.00
476.58
101.84
107.84
113.94
119.88
102.06
107.99
114.00
119.88
118.00
73.00
476.70
101.89
107.28
113.64
119.88
101.88
107.95
114.00
119.76
121.00
141.00
476.70
116.29
118.54
118.14
119.88
113.82
117.12
116.64
119.88
ARPI
16.01
41.25
0.01
9.36
6.86
2.71
0.00
7.81
6.06
1.71
0.03
Total Delivery
Duration
381.00
342.00
1906.68
421.64
441.63
459.66
479.52
419.70
440.08
458.64
479.40
Vehicle 3
Vehicle 4
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
GA* (minutes)
[9]
[10]
[11]
[12]
[13]
[14]
[15]
291
T.R. Lee and J.H. Ueng, A study of vehicle routing problem with load
balancing, International Journal of Physical Distribution and Logistics
Management, 29, 1998, pp. 646648.
N. Jozefowiez, Modelisation et resolution approchees de proble`mes
de tournees multi-objectif. Ph.D. thesis, Laboratoire dInformatique
Fondamentale de Lille, Universite des SciencesetTechnologiesde
Lille,VilleneuvedAscq, France, December 2004.
N. Jozefowiez, F. Semet, E-G. Talbi, Parallel and hybrid models for
multi-objective optimization: Application to the vehicle routing problem,
in: J.J. Merelo Guervos et al. (Eds.), Parallel Problem Solving from
Nature VII, Lecture Notes in Computer Science, vol. 2439, SpringerVerlag, 2002, pp. 271280.
D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine
Learning, Addison Wesley Publishing Company, USA, 1989.
C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems,
Mcgraw-Hill Book Company Inc., Europe, 1995.
Ip, W.H., Li, Y., Man, K.F., Tang, K.S., Multi-product planning and
scheduling using genetic algorithm approach Computers & Industrial
Engineering, Vol. 38(2), 2000, pp. 283-296.
Google Inc. (2009). Google Maps. (Online): http://maps.google.com/
(10/11/09).
Keskinturk, T., Soyler H., Global Ant Colony Optimization Journal of
The Faculty of Engineering and Architecture of Gazi University,Vol.
21(4), 2006, pp. 689-698, 2006. (In Turkish)