A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems

International Journal of Geographical Information Science

Volumn 27, Issue 4, 2013, Pages 741-764

  Fang, Zhixiang ^a   Tu, Wei ^a   Li, Qingquan ^a,b   Shaw, Shih Lung ^a,c   Chen, Shunqing ^d   Chen, Bi Yu ^b  

^a WUHAN UNIVERSITY   (China)

^b BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^c UNIVERSITY OF TENNESSEE   (United States)

^d Guangzhou Augur IT Company   (China)

Author keywords

graph theory; heuristics; large scale optimization; simulated annealing; vehicle routing problem

Indexed keywords

ALGORITHM; BENCHMARKING; CONCEPTUAL FRAMEWORK; GIS; HEURISTICS; NUMERICAL MODEL; OPTIMIZATION; SIMULATED ANNEALING;

EID: 84876331990     PISSN: 13658816     EISSN: 13623087     Source Type: Journal    
DOI: 10.1080/13658816.2012.707319     Document Type: Article

References (86)

1. Ahuja, R. 2002. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123 (1-3): 75-102.
2. Aurenhammer, F. 1991. Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Computing Surveys, 23 (3): 345-405.
3. Baker, B.M. and Ayechew, M.A. 2003. A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30 (5): 787-800.
4. Bakolas, E. and Tsiotras, P. 2010. The Zermelo-Voronoi diagram: a dynamic partition problem. Automatica, 46 (12): 2059-2067.
5. Balseiro, S.R., Loiseau, I. and Ramonet, J. 2011. An Ant Colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Computers & Operations Research, 38 (6): 954-966.
6. Bentley, J.L. 1992. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4 (4): 387-411.
7. Blum, C. 2005. Ant colony optimization: introduction and recent trends. Physics of Life Reviews, 2 (4): 353-373.
8. Bolduc, M.-C. 2010. A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. European Journal of Operational Research, 202 (1): 122-130.
9. Branchini, R.M., Armentano, V.A. and Løkketangen, A. 2009. Adaptive granular local search heuristic for a dynamic vehicle routing problem. Computers & Operations Research, 36 (11): 2955-2968.
10. Brandão, J. 2011. A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers & Operations Research, 38 (1): 140-151.
11. Cao, E. and Lai, M. 2009. A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. Journal of Computational and Applied Mathematics, 231 (1): 302-310.
12. Chen, B. 2012a. Reliable shortest path finding in stochastic networks with spatial correlated link travel times. International Journal of Geographical Information Science, 26 (2): 365-386.
13. Chen, B. 2012b. Finding reliable shortest paths in road networks under uncertainty. Networks & Spatial Economics., doi: 10.1007/s11067-012-9175-1
14. Choi, Y. 2009. Multi-criteria evaluation and least-cost path analysis for optimal haulage routing of dump trucks in large-scale open-pit mines. International Journal of Geographical Information Science, 23 (12): 1541-1567.
15. Coy, S. 1998. See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem. IEEE Transactions on Systems, Man and Cybernetics, 28 (4): 454-464.
16. Devarenne, I., Mabed, H. and Caminada, A. 2008. " Adaptive tabu tenure computation in local search ". In EvoCOP 2008, LNCS 4972, Edited by: van Hemert, J. and Cotta, C. 1-12. Berlin: Springer-Verlag.
17. Dongarra, J., 2011. Performance of various computers using standard linear equations software [online]. http://www.netlib.org/benchmark/performance.ps (http://www.netlib.org/benchmark/performance.ps) (Accessed: 31 December 2011).
18. Dorigo, M. and Stützle, T. 2010. " Ant colony optimization: overview and recent advances ". In Handbook of metaheurisitcs, 2nd, Edited by: Gendreau, M. and Potvin, J.-V. 227-263. New York: Springer.
19. Duczmal, L.H. 2011. Voronoi distance based prospective space-time scans for point data sets: a dengue fever cluster analysis in a southeast Brazilian town. International Journal of Health Geographics, 10: 29 doi: 10.1186/1476-072X-10-29
20. Dueck, G. and Scheuer, T. 1990. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90 (1): 161-175.
21. Ergun, O., Orlin, J.B. and Steele-Feldman, A. 2006. Creating very large scale neighbourhoods out of smaller ones by compounding moves. Journal of Heuristics, 12 (1-2): 115-140.
22. Fleszar, K., Osman, I.H. and Hindi, K.S. 2009. A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195 (3): 803-809.
23. Fortune, S. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2 (1-4): 153-174.
24. Gendreau, M., Hertz, A. and Laporte, G. 1992. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40: 1086-1094.
25. Glover, F. 1977. Heuristics for integer programming using surrogate constraints. Decision Sciences, 8 (1): 156-166.
26. Glover, F. and Laguna, M. 1997. Tabu search, Boston, MA: Kluwer Academic Publishers.
27. Golden, B. 1998. " The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results ". In Fleet management and logistics, Edited by: Crainic, T. and Laporte, G. 33-56. Boston, MA: Kluwer.
28. Groër, C.S. 2008. Parallel and serial algorithms for vehicle routing problems, University of Maryland. Doctoral dissertation
29. Groër, C., Golden, B. and Wasil, E. 2010. A library of local search heuristics for the vehicle routing problem. Mathematical Programming Computation, 2 (2): 79-101.
30. Hansen, P. and Mladenović, N. 2001. Variable neighborhood search: principles and applications. European Journal of Operational Research, 130 (3): 449-467.
31. Hemmelmayr, V.C., Doerner, K.F. and Hartl, R.F. 2009. A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research, 195 (3): 791-802.
32. Hiquebran, D.T. 1993. A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem. Engineering Optimization, 22 (2): 77-107.
33. Hjertenes, Ø.M. 2002. A multilevel scheme for the travelling salesman problem, Norway: Department of Informatics, University of Bergen. Master thesis
34. Holland, J.H. 1975. Adaptation in natural and artificial systems, Ann Arbor, MI: The University of Michigan Press.
35. Hu, F., Xu, W. and Li, X. 2012. A modified particle swarm optimization algorithm for optimal allocation of earthquake emergency shelters. International Journal of Geographical Information Science., doi: 10.1080/13658816.2011.643802
36. Imran, A., Salhi, S. and Wassan, N.A. 2009. A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197 (2): 509-518.
37. Jozefowiez, N., Semet, F. and Talbi, E. 2008. Multi-objective vehicle routing problems. European Journal of Operational Research, 189 (2): 293-309.
38. Kaku, I., Xiao, Y. and Xia, G. 2003. The deterministic annealing algorithms for vehicle routing problems. International Journal of Smart Engineering System Design, 5 (4): 327-339.
39. Keenan, P. 2008. Modelling vehicle routing in GIS. Operational Research, 8 (3): 201-218.
40. Kirkpatrick, S., Gelatt, C.D. Jr and Vecchi, M.P. 1983. Optimization by simulated annealing. Science, 220 (4598): 671-680.
41. Kytöjoki, J. 2007. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, 34 (9): 2743-2757.
42. Laporte, G. 2007. What you should know about the vehicle routing problem. Naval Research Logistics, 54 (8): 811-819.
43. Laporte, G. 2009. Fifty years of vehicle routing. Transportation Science, 43 (4): 408-416.
44. Lee, Y.H. 2008. A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Journal of the Operational ResearchSociety, 59 (6): 833-841.
45. Lei, T. and Church, R. 2010. Mapping transit-based access: integrating GIS, routes and schedules. International Journal of Geographical Information Science, 24 (2): 283-304.
46. Li, F., Golden, B. and Wasil, E. 2005. Very large-scale vehicle routing: new test problems, algorithms, and results. Computers & Operations Research, 32 (5): 1165-1179.
47. Li, X., He, J. and Liu, X. 2009. Ant intelligence for solving optimal path-covering problems with multi-objectives. International Journal of Geographical Information Science, 23 (7): 839-857.
48. Li, X. and Yeh, A. 2005. Integration of genetic algorithms and GIS for optimal location search. International Journal of Geographical Information Science, 19 (5): 581-601.
49. Liu, X. 2008. A bottom-up approach to discover transition rules of cellular automata using ant intelligence. International Journal of Geographical Information Science, 22 (11-12): 1247-1269.
50. Liu, X. 2012a. A multi-type ant colony optimization (MACO) method for optimal land use allocation in large areas. International Journal of Geographical Information Science., doi: 10.1080/13658816.2011.635594
51. Liu, X., Lao, C. and Li, X. 2012b. An integrated approach of remote sensing, GIS and swarm intelligence for zoning protected ecological areas. Landscape Ecology, 27 (3): 447-463.
52. LourenÇo, H.R., Martin, O.C. and Stützle, T. 2010. " Iterated local search: framework and applications ". In Handbook of metaheurisitcs, 2nd, Edited by: Gendreau, M. and Potvin, J.-V. 363-397. New York: Springer.
53. Marinakis, Y. and Marinaki, M. 2010. A hybrid genetic-particle swarm optimization algorithm for the vehicle routing problem. Expert Systems with Applications, 37 (2): 1446-1455.
54. Martin, O. and Otto, S.W. 1996. Combining simulated annealing with local search heuristics. Annals of Operations Research, 63 (1): 57-75.
55. Mendoza, J., Medaglia, A. and Velasco, N. 2009. An evolutionary-based decision support system for vehicle routing: the case of a public utility. Decision Support Systems, 46 (3): 730-742.
56. Mester, D. and Bräysy, O. 2007. Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers & Operations Research, 34 (10): 2964-2975.
57. Milthers, N.P.M. 2009. Solving VRP using Voronoi diagrams and adaptive large neighborhood search, Department of Computer Science, University of Copenhagen. Master thesis
58. Mladenović, N. and Hansen, P. 1997. Variable neighborhood search. Computers and Operations Research, 24 (11): 1097-1100.
59. Mole, R.H., Johnson, D.G. and Wells, K. 1983. Combinatorial analysis for route first-cluster second vehicle routing. Omega, 11 (5): 507-512.
60. Mooney, P. and Winstanley, A. 2006. An evolutionary algorithm for multicriteria path optimization problems. International Journal of Geographical Information Science, 20 (4): 401-423.
61. Morin, R.C.,2002. Managed C# versus Unmanaged C++ [online]. http://www.kbcafe.com/articles/CSharp.Performance.pdf (http://www.kbcafe.com/articles/CSharp.Performance.pdf) (Accessed: 22 June 2012).
62. Nagata, Y. and Bräysy, O. 2008. " Efficient local search limitation strategies for vehicle routing problems. In: C. Cotta and J. van Hemert ". In EvoCOP2008, Lecture Notes in Computer Science, vol. 4972, 48-60. Berlin: Springer-Verlag.
63. Nagata, Y. and Bräysy, O. 2009. Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Network, 54 (4): 205-215.
64. Okabe, A. 2000. Spatial tessellationsconcepts and applications of Voronoi diagrams, 2nd, Chichester, UK: John Wiley and Sons.
65. Oppen, J. and Løkketangen, A., 2004. Node aggregation in vehicle routing [online]. Norwegian Informatics Conference, Stavanger, Norway, 2004. www.nik.no/2004/bidrag/Oppen.pdf (http://www.nik.no/2004/bidrag/Oppen.pdf) (Accessed: 19 December 2011).
66. Oppen, J. and Løkketangen, A. 2006. Arc routing in a node routing environment. Computers & Operations Research, 33 (4): 1033-1055.
67. Osman, I.H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41 (4): 421-451.
68. Paulik, A. 1990. Worst-case analysis of a generalized heapsort algorithm. Information Processing Letters, 36 (3): 159-165.
69. Pisinger, D. and Ropke, S. 2010. " Large neighborhood search ". In Handbook of metaheuristics, 2nd, Edited by: Gendreau, M. and Potvin, J.-Y. 399-420. New York: Springer.
70. Prins, C. 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31 (12): 1985-2002.
71. Prins, C. 2007. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation science, 41 (4): 470-483.
72. Prins, C. 2009. " A GRASP × Evolutionary local search hybrid for the vehicle routing problem ". In Bio-inspired algorithms for the vehicle routing problem, Edited by: Pereira, F. and Tavares, J. Vol. 161, 35-53. Berlin: Springer.
73. Prutsakul, A. 1998. Integrated inventory problem and vehicle routing problem in one warehouse and multi-retailer distribution system. Master of science. Texas Tech University
74. Resende, M.G.C. and Ribeiro, C.C. 2010. " Greedy randomized adaptive search procedures: advances, hybridizations, and applications ". In Handbook of metaheurisitcs, 2nd, Edited by: Gendreau, M. and Potvin, J.-V. 283-320. New York: Springer.
75. Ropke, S. and Pisinger, D. 2006a. A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171 (3): 750-775.
76. Ropke, S. and Pisinger, D. 2006b. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40 (4): 455-472.
77. Santos, L., Coutinho-Rodrigues, J. and Antunes, C. 2011. A web spatial decision support system for vehicle routing using Google Maps. Decision Support Systems, 51 (1): 1-9.
78. Santos, L., Coutinho-Rodrigues, J. and Current, J.R. 2010. An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transportation Research Part B: Methodological, 44 (2): 246-266.
79. Tarantilis, C., Diakoulaki, D. and Kiranoudis, C. 2004. Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research, 152 (2): 437-453.
80. Toth, P. and Vigo, D. 2003. The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing, 15 (4): 333-346.
81. Ursani, Z. 2011. Localized genetic algorithm for vehicle routing problem with time windows. Applied Soft Computing, 11 (8): 5375-5390.
82. Van Breedam, A. 1994. An Analysis of the behaviour of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related and time-related constraints, Dissertation (PhD). University of Antwerp.
83. Wassan, N., Wassan, A. and Nagy, G. 2008. A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization, 15 (4): 368-386.
84. Yu, B. and Yang, Z.Z. 2011. An ant colony optimization model: the period vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 47 (2): 166-181.
85. Yücenur, G.N. and Demirel, N.Ç. 2011. A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, 38 (9): 11859-11865.
86. Zachariadis, E.E. and Kiranoudis, C.T. 2010. A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Computers & Operations Research, 37 (12): 2089-2105.