An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem

ScienceAsia

Volumn 38, Issue 3, 2012, Pages 307-318

  Pichpibul, Tantikorn ^a   Kawtummachai, Ruengsak ^b  

^a THAMMASAT UNIVERSITY   (Thailand)

^b Faculty of Business Administration   (Thailand)

Author keywords

Heuristics; Optimization; Roulette wheel selection; Tournament selection

Indexed keywords

EID: 84870849367     PISSN: 15131874     EISSN: None     Source Type: Journal    
DOI: 10.2306/scienceasia1513-1874.2012.38.307     Document Type: Article

References (66)

1. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6, 80-91.
2. Miller RE, Thatcher JW (1972) Complexity of Computer Computations, Plenum Press, New York.
3. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York.
4. Lenstra JK, Rinnooy KA (1981) Complexity of vehicle routing and scheduling problems. Networks 11, 221-7.
5. Toth P, Vigo D (2002) The Vehicle Routing Problem, SIAM monographs on discrete mathematics and applications, SIAM Publishing, Philadelphia, PA.
6. Christofides N, Mingozzi A, Toth P (1981) Exact algorithm for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Program 20, 255-82.
7. Fisher ML (1994) Optimal solution of vehicle routing problems using minimum K-trees. Oper Res 42, 626-42.
8. Augerat P, Belenguer J, Benavent E, Corbern A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France.
9. Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100, 423-45.
10. Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF (2006) Robust branchand- cut-and-price for the capacitated vehicle routing problem. Math Program 106, 491-511.
11. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12, 568-81.
12. Wren A, Holliday A (1972) Computer scheduling of vehicles form one or more depots to a number of delivery points. J Oper Res Soc 23, 333-44.
13. Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper Res 22, 340-9.
14. Mole RH, Jameson SR (1976) A sequential routebuilding algorithm employing a generalized savings criterion. J Oper Res Soc 27, 503-11.
15. Foster BA, Ryan DM (1976) An integer programming approach to the vehicle scheduling problem. J Oper Res Soc 27, 367-84.
16. Ryan DM, Hjorring C, Glover F (1993) Extensions of the petal method for vehicle routing. J Oper Res Soc 44, 289-96.
17. Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial Optimization, Wiley, New York, pp 315-38.
18. Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11, 109-24.
19. Renaud J, Boctor FF, Laporte G (1996) An improved petal heuristic for the vehicle routing problem. J Oper Res Soc 47, 329-36.
20. Lin S (1965) Computer solutions of the travelling salesman problem. Bell Syst Tech J 44, 2245-69.
21. Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, Department of Industrial Engineering and Management Science, North-western Univ, Evanston, IL.
22. Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41, 421-51.
23. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40, 1276-90.
24. Rochat Y, Taillard ÉD (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1, 147-67.
25. Bean JC (1994) Genetic algorithms and random keys for the sequencing and optimization. Informs J Comput 6, 154-60.
26. Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30, 787-800.
27. Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5, 137-72.
28. Bin Y, Zhong-Zhen Y, Baozhen Y (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196, 171-6.
29. Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31, 1985-2002.
30. Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochen-berger GA (eds) Handbook of Metaheuristics. Kluwer Academic, Boston, pp 105-44.
31. Mester D, Bräysy O (2007) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper Res 34, 2964-75.
32. Marinakis Y, Marinaki M, Dounias G (2008) Honey bees mating optimization algorithm for the vehicle routing problem. Nat Comput 129, 5-27.
33. Ai TJ, Kachitvichyanukul V (2009) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 56, 380-7.
34. Marinakis Y, Marinaki M (2010) A hybrid genetic - particle swarm optimization algorithm for the vehicle routing problem. Expert Syst Appl 37, 1446-55.
35. Tillman FA (1969) The multiple terminal delivery problem with probabilistic demands. Transport Sci 3, 192-204.
36. Raff S (1983) Routing and scheduling of vehicles and crews: The state of the art. Comput Oper Res 10, 63-211.
37. Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42, 39-51.
38. Deif I, Bodin LD (1984) Extension of the Clarke-Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder AE (ed) Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Management, Babson Park, MA, pp 75-96.
39. Vigo D (1996) A heuristic algorithm for the asymmetric capacitated vehicle routing problem. Eur J Oper Res 89, 108-26.
40. Gaskell TJ (1967) Bases for vehicle fleet scheduling. J Oper Res Soc 18, 281-95.
41. Yellow P (1970) A computational modification to the savings method of vehicle scheduling. J Oper Res Soc 21, 281-3.
42. Paessens H (1988) The savings algorithm for the vehicle routing problem. Eur J Oper Res 34, 336-44.
43. Alti{dotless}nel İK, Öncan T (2005) A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J Oper Res Soc 56, 954-61.
44. Battarra M, Golden B, Vigo D (2008) Tuning a parametric Clarke-Wright heuristic via a genetic algorithm. J Oper Res Soc 59, 1568-72.
45. Corominas A, García-Villoria A, Pastor R (2010) Finetuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics). J Oper Res Soc 61, 1309-14.
46. Juan AA, Faulin J, Ruiz R, Barrios B, Caballé S (2010) The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Appl Soft Comput 10, 215-24.
47. Laporte G, Gendreau M, Potvin J, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7, 285-300.
48. Chen P, Huang H, Dong X (2010) Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Syst Appl 37, 1620-7.
49. Groër C, Golden B, Wasil E (2010) A library of local search heuristics for the vehicle routing problem. Math Prog Comp 2, 79-101.
50. Pichpibul T, Kawtummachai R (2008) Delivery routing optimization for an inbound-outbound logistic case. In: Proceedings of the 9th International Conference on Industrial Management, pp 286-92.
51. Pichpibul T, Kawtummachai R (2009) An implementation of a two-phase metaheuristic approach for the multi-depot vehicle routing optimization with simultaneous delivery and pickup. In: Proceedings of the International Symposium on Scheduling, pp 30-5.
52. Goldberg D, Korb B, Deb K (1989) Messy genetic algorithms: motivation, analysis, and first results. Comp Systs 3, 493-530.
53. Holland J (1975) Adaptation in Natural and Artificial Systems, Univ of Michigan Press, Ann Arbor.
54. Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problem. J Oper Res Soc 20, 309-18.
55. Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program 115, 351-85.
56. Reinelt G (1991) TSPLIB: A travelling salesman problem library. ORSA J Comput 3, 376-84.
57. Noon CE, Mittenthal J, Pillai R (1994) A TSSP+1 decomposition approach for the capacity-constrained vehicle routing problem. Eur J Oper Res 79, 524-36.
58. Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transport Sci 30, 379-93.
59. Mazzeo S, Loiseau I (2004) An ant colony algorithm for the capacitated vehicle routing. Electron Notes Discrete Math 18, 181-6.
60. Chen A, Yang G, Wu Z (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7, 607-14.
61. Ganesh K, Narendran TT (2007) CLOVES: A clusterand- search heuristic to solve the vehicle routing problem with delivery and pick-up. Eur J Oper Res 178, 699-717.
62. Bouhafs L, Hajjam A, Koukam A (2010) A hybrid heuristic approach to solve the capacitated vehicle routing problem. J Artif Intell Theor Appl 1, 31-4.
63. Geetha S, Poonthalir G, Vanathi PT (2010) A hybrid particle swarm optimization with genetic operators for vehicle routing problem. J Adv Inform Tech 1, 181-8.
64. Hinton TG (2010) The vehicle routing problem including a range of novel techniques for its solution. PhD thesis, Department of Computer Science, Faculty of Engineering, Univ of Bristol, Bristol, UK.
65. Kim BI, Son SJ (2010) A probability matrix based particle swarm optimization for the capacitated vehicle routing problem. J Intell Manuf 23, 1119-26.
66. Na B, Jun Y, Kim BI (2011) Some extensions to the sweep algorithm. Int J Adv Manuf Tech 56, 1057-67.