A template-based adaptive large neighborhood search for the consistent vehicle routing problem

Networks

Volumn 63, Issue 1, 2014, Pages 60-81

  Kovacs, Attila A ^a   Parragh, Sophie N ^a,b   Hartl, Richard F ^a  

^a UNIVERSITY OF VIENNA   (Austria)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

large neighborhood search; metaheuristics; periodic distribution problems; vehicle routing

Indexed keywords

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; COMPETITIVE ADVANTAGE; CONSISTENCY REQUIREMENTS; FAST SOLUTION METHOD; LARGE NEIGHBORHOOD SEARCH; META HEURISTICS; PERIODIC DISTRIBUTION; VEHICLE ROUTING PROBLEMS;

ABSTRACTING; BENCHMARKING; COMPETITION; INDUSTRY; NETWORK ROUTING; ROUTING ALGORITHMS; SALES; VEHICLE ROUTING;

CUSTOMER SATISFACTION;

EID: 84890128730     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21522     Document Type: Article

References (23)

1. A. Campbell, B. Thomas, Probabilistic traveling salesman problem with deadlines, Transport Sci 42 (2008), 1-21.
2. N. Christofides, S. Eilon, An algorithm for the vehicle-dispatching problem, OR 20 (1969), 309-318.
3. L. C. Coelho, J.-F. Cordeau, G. Laporte, Consistency in multi-vehicle inventory-routing, Transport Res C Emerg Technol 24 (2012), 270-287.
4. J. Cordeau, G. Laporte, F. Pasin, S. Ropke, Scheduling technicians and tasks in a telecommunications company, J Sched 13 (2010), 393-409
5. D. Feillet, T. Garaix, F. Lehuédé, O. Péton, D. Quadri, A new consistent vehicle routing problem for the transportation of handicapped persons Technical Report emse-00529945-version 1, Ecole Nationale Supérieure des Mines de Saint-Etienne, France, 2010.
6. H. Gehring, J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, K. Miettinen, M. Mäkelä, J. Toivanen, Proceedings of EUROGEN99: Short Course on Evolutionary Algorithms in Engineering and Computer Science University of Jyväskylä, 1999, 57-64.
7. C. Groër, B. Golden, E. Wasil, The consistent vehicle routing problem, Manuf Serv Oper Manag 11 (2009) 630-643.
8. S. Kirkpatrick, C. D. Gelatt Jr, M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983), 671-680.
9. A. A. Kovacs, S. N. Parragh, K. F. Doerner, R. F Hartl, Adaptive large neighborhood search for service technician routing and scheduling problems, J Sched 15 (2012), 579-600.
10. J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc Am Math Soc 7 (1956), 48-50.
11. F. Li, B. Golden, E. Wasil, Very large-scale vehicle routing: new test problems, algorithms, and results, Comput Oper Res 32 (2005), 1165-1179.
12. S. Lin, Computer solutions of the traveling salesman problem, Bell Syst Techn J (1965), 44 2245-2269.
13. D. Pisinger, S. Ropke, A general heuristic for vehicle routing problems, Comput Oper Res 34 (2007) 2403-2435.
14. D. Pisinger, S. Ropke, Large neighborhood search, M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 146, Springer, New York, 2010, pp. 399-419.
15. J. Potvin, J. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, Eur J Oper Res 66 (1993), 331-340.
16. S. Ropke, D. Pisinger, A unified heuristic for a large class of vehicle routing problems with backhauls, Eur J Oper Res 171 (2006a), 750-775.
17. S. Ropke, D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transport Sci 40 (2006b), 455-472.
18. G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, G. Dueck, Record breaking optimization results using the ruin and recreate principle, J Comput Phys 159 (2000), 139-171.
19. P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, M. Maher, J.-F Puget,. Principles and Practice of Constraint Programming-CP98 1520 417-431 Springer, Berlin Heidelberg, 1998.
20. K. Smilowitz, M. Nowak, T. Jiang, Workforce management in periodic delivery operations Transport Sci 47 (2012), 214-230.
21. I. Sungur, Y. Ren, F. Ordòñez, M. Dessouky, H. Zhong, A model and algorithm for the courier delivery problem with uncertainty Transport Sci 44 (2010), 193-205.
22. C. Tarantilis, F. Stavropoulou, P. Repoussis, A template-based tabu search algorithm for the consistent vehicle routing problem Expert Syst Appl 39 (2012), 4233-4239.
23. R. Wong, Vehicle routing for small package delivery and pickup services, B. Golden, S. Raghavan, E. Wasil,. The Vehicle Routing Problem: Latest Advances and New Challenges Springer, New York, 2008, 475-485.