Modified harmony search algorithm for the capacitated vehicle routing problem

Lecture Notes in Engineering and Computer Science

Volumn 2203, Issue , 2013, Pages 1094-1099

  Pichpibul, Tantikorn ^a   Kawtummachai, Ruengsak ^a  

^a Faculty of Business Administration   (Thailand)

Author keywords

Clarke wright savings algorithm; Harmony search algorithm; Optimization; Vehicle routing problem

Indexed keywords

COMPUTER SCIENCE; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS;

BENCH-MARK PROBLEMS; CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL RESULTS; HARMONY SEARCH ALGORITHMS; MODIFIED HARMONY SEARCH ALGORITHMS; ROULETTE WHEEL SELECTION; SAVINGS ALGORITHMS; VEHICLE ROUTING PROBLEMS;

LEARNING ALGORITHMS;

EID: 84880074860     PISSN: 20780958     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. G. B. Dantzig and J. H. Ramser, "The truck dispatching problem. Management Science, vol. 6. pp. 80-91. 1959.
2. P. Toth and D. Vigo. "The vehicle routing problem ", in SLAM monographs on discrete mathematics and applications. Philadelphia: SIAM Publishing, 2002.
3. N. Christofides, A. Mingozzi and P. Toth. "Exact algoritlim for the vehicle routing problem, based on spanning tree and shortest path relaxations" MathematicalProgramming, vol. 20. pp. 255-282, 1981.
4. M. L. Fisher, "Optimal solution of vehicle routing problems using minimum K-trees." Operations Research, vol. 42. pp. 626-642, 1994.
5. R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragao, M. Reis, E. Uchoa and R. F. Werneck, "Robust branch-and-cut-and-price for the capacitated vehicle routing problem. " Mathematical Programming Series A, vol. 106. pp. 491-511, 2006.
6. G. Clarke and J. W. Wright, "Scheduling of vehicles from a central depot to a number of delivery pomts, " Operations Research, vol. 12, pp. 568-581. 1964.
7. A. Wren and A. Holliday, "Computer scheduling of vehicles from one or more depots to a number of delivery points, " Operational Research Quarterly, vol. 23, pp. 333-344. 1972.
8. S. Kirkpatnck, J. Gelatt and M. Vecchi, "Optimization by simulated annealing, " Science, vol. 220. pp. 671-680. 1983.
9. F. Glover. "Heuristic for Integer Programmmg Using Surrogate Constraints." Decision Sciences, vol. 8. pp. 156-166. 1977.
10. J. H. Holland. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press. 1975.
11. M. Dorigo, V. Mamezzo and A. Colorni. "Ant system: optimization by a colony of cooperating agents, " IEEE Transactions on Systems, Mans, and Cybernetics, vol. 1, pp. 29-41, 1996.
12. J. Kennedy and R. Eberhart. "Particle swarm optimization.'" in Proc. IEEE Inteinational Conference on Neural Networks. Perth. 1995, pp. 1942-1948.
13. K. S. Lee and Z. W. Geem "A New Meta-Heuristic Algorithm for Continuous Engineermg Optimization: Harmony Search Theory and Practice.'" Computer Methods in Applied Mechanics and Engineering, vol. 194. pp. 3902-3933, 2005.
14. Z. W. Geem, M. Fesanghary, J. Choi, M. P. Saka, J. C. Williams, M. T. Ayvaz, L. Li, S. Ryu and A. Vasebi, "Recent Advances in Harmony Search." in Advances in Evolutionary Algorithms, W. Kosmski, Ed. Vienna: I-Tech Education and Publishing, 2008. pp. 468.
15. Z. W. Geem, J. H. Kim and G. V. Loganathan, "A New Heuristic Optimization Algorithm: Harmony Search. " Simulation, vol. 76. pp. 60-68.2001.
16. T. Pichpibul and R. Kawtummachai, "An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem."' ScienceAsia. vol. 38. pp. 307-318, 2012.
17. J. Holland. Adaptation in Natural and Artificial Systems, Ann Arbor: University of Michigan Press, 1975.
18. P. Augerat, J. Belenguer, E. Benavent, A. Corbern, D. Naddef and G. Rinaldi. Computational results with a branch and cut code for the capacitated vehicle routing problem, Grenoble, France: Universite Joseph Fourier, 1995.
19. N. Christofides and S. Eilon, ' An algorithm for the vehicle dispatching problem." Operational Research Quarterly, vol. 20, pp. 309-318, 1969.
20. M. L. Fisher, "Optimal solution of vehicle routing problems using minimum K-trees." Operations Research, vol. 42. pp. 626-642, 1994.
21. K. Ganesh and T. T. Narendran. "CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pickup." European Journal of Operational Research, vol. 178, pp. 699- 717, 2007.
22. A. A. Juan, J. Faulin, R. Ruiz, B. Barrios and S. Caballe, "The SR- GCWS hybrid algorithm for solving the capacitated vehicle routing problem."' Applied Soft Computing, vol. 10. pp. 215-224, 2010.
23. C. Groer, B. Golden and E. Wasil, "A library of local search heuristics for the vehicle routing problem" Mathematical Programming Computation, vol. 2. pp. 79-101, 2010.
24. T. J. Ai and V. Kachitvichyanukul, "Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem'" Computers & Industrial Engineering, vol. 56. pp. 380-387, 2009.
25. B. I. Kim and S. J. Son. "A probability matrix based particle swarm optimization for the capacitated vehicle routmg problem." Journal of Intelligent Manufacturing, vol. 23, pp. 1119-1126. 2010.
26. B. F. Moghaddam R. Ruiz and S. J. Sadjadi. "Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm." Computers & Industrial Engineering, vol. 62, pp. 306- 317, 2012.