Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 42, Issue 2, 2012, Pages 254-267

  Gong, Yue Jiao ^a   Zhang, Jun ^a   Liu, Ou ^b   Huang, Rui Zhang ^b   Chung, Henry Shu Hung ^c   Shi, Yu Hui ^d  

^a SUN YAT SEN UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^d XI AN JIAOTONG LIVERPOOL UNIVERSITY   (China)

Author keywords

Combinatorial optimization problems (COPs); set based particle swarm optimization (S PSO); vehicle routing problem with time windows (VRPTW)

Indexed keywords

CANDIDATE SOLUTION; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLETE GRAPHS; CONTINUOUS OPTIMIZATION PROBLEMS; DISCRETE PARTICLE SWARM OPTIMIZATION; GENERAL METHOD; LOGISTICS SYSTEM; NEAREST NEIGHBORS; NORMALIZATION METHODS; NP-HARD; OPTIMAL SUBSETS; PARTICLE SWARM; PARTICLE SWARM OPTIMIZATION ALGORITHM; PSO ALGORITHMS; SEARCH SPACES; SUBGRAPHS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; PARTICLE SWARM OPTIMIZATION (PSO);

ALGORITHMS;

EID: 84857503749     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2011.2148712     Document Type: Article

References (73)

1. P. Toth and D. Vigo, The Vehicle Routing Problem. Philadelphia, PA: SIAM, 2001.
2. M.M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time window constraints," Oper. Res., vol. 35, no. 2, pp. 254-265, 1987.
3. J. Desrosiers, F. Soumis, and M. Desrochers, "Routing with time windows by column generation," Networks, vol. 14, no. 4, pp. 545-565, 1984.
4. A. W. J. Kolen, A. H. G. R. Kan, and H. W. J. M. Trienekens, "Vehicle routing with time windows," Oper. Res., vol. 35, no. 2, pp. 266-273, 1987.
5. O. Madsen, "Lagrangian relaxation and vehicle routing," Working Paper, IMSOR, Tech. Univ., Denmark, 1990.
6. N. Kohl, J. Desrosiers, O. B. G. Madsen, M. M. Solomon, and F. Soumis, "2-path cuts for the vehicle routing problem with time windows," Transp. Sci., vol. 33, no. 1, pp. 101-116, 1999.
7. Y. Rochat and E. D. Taillard, "Probabilistic diversification and intensification in local search for vehicle routing," J. Heuristics, vol. 1, no. 1, pp. 147-167, 1995.
8. É. Taillard, P. Badeau, M. Gendreau, F Guertin, and J. Y. Potvin, "A tabu search heuristic for the vehicle routing problem with soft time windows," Transp. Sci., vol. 31, no. 2, pp. 170-186, 1997.
9. W. P. Nanry and J. W. Barnes, "Solving the pickup and delivery problem with time windows using reactive tabu search," Transp. Res. B, Method., vol. 34, no. 2, pp. 107-121, 2000.
10. J. F. Cordeau, G. Laporte, and A.Mercier, "A unified tabu search heuristic for vehicle routing problems with time windows," J. Oper. Res. Soc., vol. 52, no. 8, pp. 928-936, 2001.
11. O. Bräysy andM.Gendreau, "Tabu search heuristics for the vehicle routing problem with time windows," TOP: Official J. Spanish Soc. Stat. Oper. Res., vol. 10, no. 2, pp. 211-237, 2002.
12. S. C. Ho and D. Haugland, "A tabu search heuristic for the vehicle routing problem with time windows and split deliveries," Comput. Oper. Res., vol. 31, no. 12, pp. 1947-1964, 2004.
13. M.-Y. Qi, L.-X. Miao, L. Zhang, and H.-Y. Xu, "A new tabu search heuristic algorithm for the vehicle routing problem with time windows," 15th Int. Proc. Conf. Manage. Sci. Eng., pp. 1648-1653, 2008.
14. P. Shaw, "A new local search algorithm providing high quality solutions to vehicle routing problems," Working Paper, Dept. of Comput. Sci., Univ. Strathclyde, Glasgow, Scotland, 1997.
15. H. Li, A. Lim, and J. Huang, "Local search with annealing-like restarts to solve the VRPTW," Working Paper, Dept. Comput. Sci., Nat. Univ., Singapore, 2001.
16. T. Ibaraki, M. Kubo, T. Masuda, T. Uno, and M. Yagiura, "Effective local search algorithms for the vehicle routing problem with general time windows," Working Paper, Dept. Appl. Math. Phys., Kyoto Univ., Japan, 2001.
17. L. H. Lee, K. C. Tan, K. Ou, and Y. H. Chew, "Vehicle capacity planning system: A case study on vehicle routing problem with time windows," IEEE Trans. Syst., Man Cybern. A, Syst., Humans, vol. 33, no. 2, pp. 169-178, Mar. 2003.
18. R. Bent and P. V. Hentenryck, "A two-stage hybrid local search for the vehicle routing problem with time windows," Transp. Sci, vol. 38, no. 4, pp. 515-530, 2004.
19. E. Danna and C. Le Pape, "Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows," ILOG, Cédex, Tech. Rep. 03-006, 2003.
20. W. C. Chiang and R. A. Russell, "Simulated annealing metaheuristics for the vehicle routing problem with time windows," Ann. Oper. Res., vol. 63, no. 1, pp. 3-27, 1996.
21. Z. J. Czech and P. Czarnas, "A parallel simulated annealing for the vehicle routing problem with time windows," 10th EuromicroWorkshop Parallel, Distrib. Network-Based Process., 2002, pp. 376-383.
22. A. Debudaj-Grabysz and Z. Czech, "Theoretical and practical issues of parallel simulated annealing," Parallel Process. Appl. Math., vol. 4967, pp. 189-198, 2008.
23. S. R. Thangiah, "Vehicle routing with time windows using genetic algorithms," in Application Handbook of Genetic Algorithms: New Frontiers, vol. 2. CRC Press, Boca Raton, FL, 1995, pp. 253-277.
24. K. Zhu, "A new genetic algorithm for VRPTW (2000)," in Proc. Int. Conf. Artif. Intell., 2000.
25. K. C. Tan, L. H. Lee, Q. L. Zhu, and K. Ou, "Heuristic methods for vehicle routing problem with time windows," Artif. Intell. Eng., vol. 15, no. 3, pp. 281-295, 2001.
26. K. C. Tan, L. H. Lee, and K. Ou, "Artificial intelligence heuristics in solving vehicle routing problems with time window constraints," Eng. Appl. Artif. Intell., vol. 14, no. 6, pp. 825-837, 2001.
27. G. B. Alvarenga, G. R. Mateus, and G. D. Tomi, "A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows," Comput. Oper. Res., vol. 34, no. 6, pp. 1561-1584, 2007.
28. K. Ghoseiri and S. F. Ghannadpour, "Hybrid genetic algorithm for vehicle routing and scheduling problem," J. Appl. Sci., vol. 9, no. 1, pp. 79-87, 2009.
29. H. Nazif and L. S. Lee, "Optimized crossover genetic algorithm for vehicle routing problem with time windows," Amer. J. Appl. Sci., vol. 7, no. 1, pp. 95-101, 2010.
30. W.-J. Wang, "Improved genetic algorithm for vehicle routing problem with time windows," in Proc. Int. Conf. Intell. Comput. Cognitive Inf., 2010, pp. 203-206.
31. L. M. Gambardella, É. Taillard, and G. Agazzi, "MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows," in New Ideas in Optimization, New York: McGraw-Hill, pp. 63-76, 1999.
32. X. Tan, X. Zhuo, and J. Zhang, "Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)," Lect. Notes Comput. Sci., vol. 4115, pp. 33-38, 2006.
33. C.-H. Chen and C.-J. Ting, "A hybrid ant colony system for vehicle routing problem with time windows," J. Eastern Asia Soc. Transp. Stud., vol. 6, pp. 2822-2836, 2005.
34. B. Yu, Z. Z. Yang, and B. Z. Yao, "A hybrid algorithm for vehicle routing problem with time windows," Expert Syst. Appl., vol. 38, no. 1, pp. 435-441, 2010.
35. P. P. Repoussis, C. D. Tarantilis, and G. Ioannou, "Arc-guided evolutionary algorithm for the vehicle routing problem with time windows," IEEE Trans. Evol. Comput., vol. 13, no. 3, pp. 624-647, Jun. 2009.
36. J. Berger and M. Barkaoui, "A memetic algorithm for the vehicle routing problem with time windows," in Proc. 7th Int. Command Control Res. Technol. Symp., 2002.
37. J. Berger and M. Barkaoui, "A parallel hybrid genetic algorithm for the vehicle routing problem with timewindows," Comput.Oper. Res., vol. 31, no. 12, pp. 2037-2053, 2004.
38. A. L. Bouthillier and T. G. Crainic, "A cooperative parallel meta-heuristic for the vehicle routing problem with time windows," Comput. Oper. Res., vol. 32, no. 7, pp. 1685-1708, 2005.
39. K. C. Tan, Y. H. Chew, and L. H. Lee, "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," Eur. J. Oper. Res., vol. 172, no. 3, pp. 855-885, 2006.
40. B. Ombuki, B. J. Ross, and F. Hanshar, "Multi-objective genetic algorithms for vehicle routing problem with time windows," Appl. Intell., vol. 24, no. 1, pp. 17-30, 2006.
41. J.Kennedy and R. Eberhart, "Particle swarm optimization," in Proc. IEEE Int. Conf. Neural Netw., 1995, vol. 4, pp. 1942-1948.
42. R. Poli, J. Kennedy, and T. Blackwell, "Particle swarm optimization: An overview," Swarm Intell., vol. 1, no. 1, pp. 33-57, 2007.
43. J. Kennedy and R. Mendes, "Neighborhood topologies in fully informed and best-of-neighborhood particle swarms," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 36, no. 4, pp. 515-519, Jul. 2006.
44. Z.-H. Zhan, J. Zhang,Y. Li, and H. S.-H. Chung, "Adaptive particle swarm optimization," IEEE Trans. Syst., Man, and Cybern. B, Cybern., vol. 39, no. 6, pp. 1362-1381, Dec. 2009.
45. J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions," IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 281-295, Jun. 2006.
46. Z. H. Zhan, J. Zhang, Y. Li, and Y. H. Shi, "Orthogonal learning particle swarm optimization," IEEE Trans. Evol. Comput., to be published.
47. K. Veeramachaneni, L. A. Osadciw, and P. K. Varshney, "An adaptive multimodal biometric management algorithm," IEEE Trans. Syst., Man, and Cybern.C, Appl. Rev., vol. 35, no. 3, pp. 344-356, Aug. 2005.
48. C.-J. Lin, C.-H. Chen, and C.-T. Lin, "A hybrid of cooperative particle swarm optimization and cultural algorithm for neural fuzzy networks and its prediction applications," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 39, no. 1, pp. 55-68, Jan. 2009.
49. R. V. Kulkarni and G. K. Venayagamoorthy, "Bio-inspired algorithms for autonomous deployment and localization of sensor nodes," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 40, no. 6, pp. 663-675, Nov. 2010.
50. P. Kanakasabapathy and K. S. Swarup, "Evolutionary tristate PSO for strategic bidding of pumped-storage hydroelectric plant," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 40, no. 4, pp. 460-471, Jul. 2010.
51. R. V. Kulkarni and G. K. Venayagamoorthy, "Particle swarm optimization in wireless-sensor networks: A brief survey," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 41, no. 2, pp. 262-267, 2011.
52. F. Wang and Q.-Z. Wu, "Particle swarm optimization for vehicle routing problem with time windows," in Proc. Int. Conf. Risk Rel. Manage., 2008, pp. 962-966.
53. Q. Zhu, L. M. Qian, Y. C. Li, and S. J. Zhu, "An improved particle swarm optimization algorithm for vehicle routing problem with time windows," in IEEE Congr. Evol. Comput., 2006, pp. 1386-1390.
54. T. Zhen, H. Ge, Y. Che, and Y Jiang, "Research on particle swarm optimization for grain logistics vehicle routing problem," in Proc. IITA Int. Conf. Serv. Sci., Manage. Eng., 2009, pp. 274-277.
55. T. J. Ai and V. Kachitvichyanukul, "A particle swarm optimization for vehicle routing problem with time windows," Int. J. Oper. Res., vol. 6, no. 4, pp. 519-537, 2009.
56. X. X. Liu,W. G. Jiang, and J.W. Xie, "Vehicle routing problem with time windows: a hybrid particle swarm optimization approach," in Proc. 5th Int. Conf. Natural Comput., vol. 4, 2009, pp. 502-506.
57. W. G. Jiang, Y. B. Zhang, and J. W. Xie, "A particle swarm optimization algorithm with crossover for vehicle routing problem with time windows," in Proc. IEEE Symp. Comput. Intell. Scheduling. 2009, pp. 103-106.
58. S. Amini, H. Javanshir, and R. Tavakkoli-Moghaddam, "A PSO approach for solving VRPTW with real case study," Int. J. Res. Rev. Appl. Sci., vol. 4, no. 3, pp. 118-126, 2010.
59. J. P. Castro, D. Landa-Silva, and J. A. M. Pérez, "Exploring feasible and infeasible regions in the vehicle routing problem with time windows using a multi-objective particle swarm optimization approach," Nat. Inspired Cooperative Strategies Optim., vol. 236, pp. 103-114, 2009.
60. C. T. Lin, "Using predicting particle swarm optimization to solve the vehicle routing problem with time windows," in Proc. IEEE Int. Conf. Ind. Eng. Eng. Manage., 2008, pp. 810-814.
61. W. N. Chen, J. Zhang, H. Chung, W. L. Zhong, and Y. H. Shi, "A novel set-based particle swarm optimization method for discrete optimization problems," IEEE Trans. Evol. Comput., vol. 14, no. 2, pp. 278-300, Apr. 2010.
62. M. Savelsbergh, private communication, 1984.
63. P. Shaw, "Using constraint programming and local search methods to solve vehicle routing problems," in Proc. Principles Pract. Constraint Program., LNCS 1520, 1998, pp. 417-431.
64. W. Cook and J. L. Rich, "A parallel cutting plane algorithm for the vehicle routing problem with time windows," Working paper, Dept. Comput. Appl. Math., Rice Univ., Houston, TX, 1999.
65. J. Larsen, "Parallelization of the vehicle routing problem with time windows," Ph.D. dissertation, IMM-PHD-1999-62, Dept. Math. Modelling, Tech. Univ. Denmark, Lyngby, Denmark, 1999.
66. J. Homberger and H. Gehring, "Two evolutionary metaheuristics for the vehicle routing problem with time windows," Inf. Syst. Oper. Res., vol. 37, pp. 297-318, 1999.
67. G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck, "Record breaking optimization results using the ruin and recreate principle," J. Comput. Phys., vol. 159, no. 2, pp. 139-171, 2000.
68. J. Homberger, Verteilt-parallele Metaheuristiken zur Tourenplanung. Wiesbaden, Germany: Gaber, 2000.
69. B. Kallehauge, J. Larsen, O. B. G. Madsen, "Lagrangian duality and nondifferentiable optimization applied on routing with time windows: Experimental results," Dept. Math. Modelling, Tech. Univ. Denmark, Lyngby, Denmark, Internal Report IMM-REP-2000-8, 2000.
70. L. M. Rousseau, M. Gendreau, and G. Pesant, "Using constraint-based operators to solve the vehicle routing problem with time windows," J. Heuristics, vol. 8, no. 1, pp. 43-58, 2002.
71. D. Mester, "An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions," Working Paper, Inst. Evol., Univ. Haifa, Israel, 2002.
72. S. Irnich and D. Villeneuve, "The shortest path problem with k-cycle elimination (k≥3): Improving a branch-and-price algorithm for theVRPTW," INFORMS J. Comput., vol. 18, no. 3, pp. 391-496, 2006.
73. A. Chabrier, "Vehicle routing problem with elementary shortest path based column generation," Comput. Oper. Res., vol. 33, no. 10, pp. 2972-2990, 2006.