A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window

Entropy

Volumn 15, Issue 4, 2013, Pages 1247-1270

  Hu, Wenbin ^a   Liang, Huanle ^a   Peng, Chao ^a   Du, Bo ^a   Hu, Qi ^a  

^a WUHAN UNIVERSITY   (China)

Author keywords

Chaos algorithm; Gaussian mutation; Insertion heuristic algorithm; PSO; VRPTW

Indexed keywords

EID: 84893623114     PISSN: None     EISSN: 10994300     Source Type: Journal    
DOI: 10.3390/e15041247     Document Type: Article

References (39)

1. Bookbinder, J.H.; Reece, K.E. Vechicle routing considerations in dsitribtion system design. Eur. J. Oper. Res. 1988, 37, 204-213.
2. Mete, H.O.; Zabinsky, Z.B. Stochastic optimization of medical supply location and distribution in disaster management. Int. J. Prod. Econ. 2010, 126, 76-84.
3. Lau, H.Y.K.; Woo, S.O. An agent-based dynamic routing strategy for automated material handling systems. Int. J. Comput. Integrated Manuf. 2008, 21, 269-288.
4. Custódio, A.L.; Oliveria, R.C. Redesigning distribution operations: A case study on integrating inventory management and vehicle routes design. Int. J. Logist. Res. Appl. 2006, 9, 169-187.
5. Ji, P.; Chen, K. The vehicle routing problem: The case of the hong kong postal service. Transp. Plan. Technol. 2007, 30, 167-182.
6. Braca, J.; Bramel, J.; Posner, B.; Simchi-Levi, D. A computerized approach to the New York Cityschool bus routing problem. IIE Trans. 1997, 29, 693-702.
7. Shaw, P. Using constraint programming and local search methods to vehicle routing problem. Princ. Pract. Constraint Program. (CP'98) 1998, 417-431.
8. Fisher, M.L. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. 1994, 42, 626-642.
9. Golden, B.L.; Laporte, G.; Taillard, É.D. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 1999, 24, 445-452.
10. Chiang, W.C.; Russell, R.A. Simulated annealing meta-heuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 1996, 93, 13-27.
11. Bräysy, O.; Gendreau, M. Tabu search heuristics for the vehicle routing problem with time windows. TOP. 2002, 10, 211-237.
12. Gendreau, M.; Laporte, G.; Musaragrnyi, C.; Taillard, É.D. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 1999, 26, 1153-1173.
13. Park, Y. B. A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. Int J Prod Econ 2001, 73, 175-188.
14. Gambardella, L.M.; Taillard, É.; Agazzi, G. Macs-Vrptw: A Multiple Colony System for Vehicle Routing Problems with Time Windows. In New Ideals in Optimization; McGraw-Hill Ltd.: Maidenhead, UK, 1999; pp. 63-76.
15. Repoussis, P.P.; Paraskevopoulos, D.C.; Tarantilis, C.D.; Ioannou, G. A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. Hybrid Metaheuristics Lect. Notes Comput. Sci. 2006, 4030, 124-138.
16. Paraskevopoulos, D.C.; Repoussis, P.P.; Tarantilis, C.D.; Ioannou, G.; Prastacos, G.P. A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. J. Heuristics 2008, 14, 425-455.
17. Ceschia, S.; Di Gaspero, L.; Schaerf, A. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Sched. 2011, 14, 601-615.
18. Crispim, J.; Brandao, J. Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J. Oper. Res. Soc. 2005, 56, 1296-1302.
19. Bianchessi, N.; Righini, G. Heuristic algorithms for the vehicle routing problem with simulaneous pick-up and delivery. Comput. Oper. Res. 2007, 34, 578-594.
20. Gendreau, M.; Guertin, F.; Potvin, J.Y.; Séquin, R. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp. Res. Part C. 2006, 14, 157-174.
21. Zachariadis, E.E.; Kiranoudos, C.T. A local search metaheuristic algorithm for the vehicle routing problem with simulanteous pick-ups and deliveries. Exp. Syst. Appl. 2011, 38, 2717-2726.
22. Hong, L.X. An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput. Oper. Res. 2012, 39, 151-163.
23. Tavakkoli-Moghaddam, R.; Safaei, N.; Gholipour, Y. A hybird simulated annealing for capacitated vehicle routing problems with the independent route length. Appl. Math. Comput. 2006, 176, 445-454.
24. Tavakkoli-Moghaddam, R.; Gazanfari, M.; Alinaghian, M.; Salamatbakhsh, A.; Norouzi, N. A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. J. Manuf. Syst. 2011, 30, 83-92.
25. Balseiro, S.R.; Loiseau, I.; Ramonet, J. An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput. Oper. Res. 2011, 38, 954-966.
26. Catay, B. A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Exp. Syst. Appl. 2010, 37, 6809-6817.
27. Gajpal, Y.; Abad, P. An ant colony system (ACS) for vehicle routing problem with simulataneous delivery and pickup. Comput. Oper. Res. 2009, 36, 3215-3223.
28. Ghoseiri, K.; Ghannadpour, S.F. Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 2010, 10, 1096-1107.
29. Jeon, G.;Leep, H. R.; Shim, J. Y. A vehicle routing problem solved by using a hybrid genetic algorithm. Computers & Industrial Engineering. 2007, 53, 680-692.
30. Chen, A.L.; Yang, G.K.; Wu, Z.M. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ. Sci. A 2006, 7, 607-614.
31. Kachitvichyanukul, V. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput. Ind. Eng. 2009, 56, 380-387.
32. Zhao, Y. W.; Wu, B.; Wang, W. L.; Ma, Y. L.; Wang, W. A.; Sun, H. Particle swarm optimization for vehicle routing problem with time windows. Materials Science Forum. 2004, 471, 801-805.
33. Zhang, L.Y.; Pang, X.H.; Xia, W.J.; Wu, Z.M.;LIANG, S. A hybrid particle swarm optimization algorithm for vehicle routing problem with time windows. J. Shanghai Jiaotong Univ. 2006, 40, 1890-1900.
34. Wu, Y.H.; Zhang, N.Z. Modified Particle Swarm Optimization algorithm for vehicle routing problem with time windows. Comput. Eng. Appl. 2010, 46, 230-234.
35. Gong, Y.J.; Zhang, j.; Liu, O.; Huang, R.Z.; Chung, H.H.; Shi, Y.H. Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach. Syst. Man Cybern. Part C Appl. Rev. IEEE Trans. 2012, 42, 254-267.
36. Lozi, R. Un attracteur étrange (?) du type attracteur de Hénon. J. Phys. Colloq. 1978, 39, 5-9.
37. Ikeda, K.; Daido, H.; Akimoto, O. Optical turbulence: Chaotic behavior of transmitted light from a ring cavity. Phys. Rev. Lett. 1980, 45, 709-712.
38. Jürgens, H.; Peitgen, H.O.; Saupe, D. Chaos and Fractals: New Frontiers of Science; Springer-Verlag: New York, NY, USA, 1992.
39. Solomon Benchmark Problems-VRPTW. Available online: http://www.idsia.ch/ luca/macs-vrptw/problmes/welcome.htm (accessed on 17 June 2012)