An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

作者: Jari Kytöjoki , Teemu Nuortio , Olli Bräysy , Michel Gendreau

DOI: 10.1016/J.COR.2005.10.010

关键词: Heuristic (computer science)HeuristicsLocal search (optimization)Mathematical optimizationRouting (electronic design automation)Guided Local SearchMetaheuristicVehicle routing problemVariable neighborhood searchComputer scienceHeuristic

摘要: … According to the figure, the differences appear small in terms of both solution quality and … routing problems. In Table 4, we report the results for the 12 problems created with the problem …

参考文章(62)
D. Simchi-Levi, J. Bramel, Set-covering-based algorithms for the capacitated VRP The vehicle routing problem. pp. 85- 108 ,(2001)
C.D. Tarantilis, C.T. Kiranoudis, BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management Annals of Operations Research. ,vol. 115, pp. 227- 241 ,(2002) , 10.1023/A:1021157406318
Stefan Voß, Silvano Martello, Ibrahim H Osman, Catherine Roucairol, None, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization ,(2012)
G. Laporte, F. Semet, Classical heuristics for the capacitated VRP The vehicle routing problem. pp. 109- 128 ,(2001)
Jean Berger, Mohamed Barkaoui, A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem Genetic and Evolutionary Computation — GECCO 2003. pp. 646- 656 ,(2003) , 10.1007/3-540-45105-6_80
Ozlem Ergun, James B. Orlin, Abran Steele-Feldman, Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem Social Science Research Network. ,(2002) , 10.2139/SSRN.349701
D. Vigo, P. Toth, Branch-and-bound algorithms for the capacitated VRP The vehicle routing problem. pp. 29- 51 ,(2001)
M. Gendreau, G. Laporte, J.-Y. Potvin, Metaheuristics for the capacitated VRP The vehicle routing problem. pp. 129- 154 ,(2001)