Restricted dynamic programming: A flexible framework for solving realistic VRPs

Computers and Operations Research

Volumn 39, Issue 5, 2012, Pages 902-909

  Gromicho, J ^a,b   Van Hoorn, J J ^a,b   Kok, A L ^b   Schutten, J M J ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b ORTEC The Netherlands   (Netherlands)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Giant tour representation; Real life restrictions; Restricted DP; VRP

Indexed keywords

COMPUTATIONAL EXPERIMENT; DRIVING HOURS; FLEXIBLE FRAMEWORK; GIANT-TOUR REPRESENTATION; LARGE VEHICLES; LOCAL SEARCH; LOCAL SEARCH METHOD; OBJECTIVE FUNCTIONS; OPTIMAL ALGORITHM; REAL-LIFE RESTRICTIONS; RESTRICTED DP; SOLUTION METHODS; STATE OF THE ART; TIME-DEPENDENT; TRAVEL TIME; VEHICLE ROUTING PROBLEMS; VRP;

ALGORITHMS; OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 80052272783     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.07.002     Document Type: Article

References (27)

1. M. Gendreau, G. Laporte, and J.-Y. Potvin Metaheuristics for the capacitated VRP The vehicle routing problem. SIAM monographs on discrete mathematics and applications 2002 SIAM Publishing Philadelphia, PA 129 154
2. S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part I: transportation between customers and depot Journal für Betriebswirtschaft 58 1 2008 21 51
3. S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations Journal für Betriebswirtschaft 58 2 2008 81 117
4. D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers & Operations Research 34 8 2007 2403 2435 0305-0548 (Pubitemid 46073431)
5. C. Malandraki, and R.B. Dial A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem European Journal of Operational Research 90 1 1996 45 55 (Pubitemid 126392350)
6. P. Toth, and D. Vigo The granular tabu search and its application to the vehicle-routing problem INFORMS Journal on Computing 15 December 2003 333 346 (Pubitemid 39042713)
7. Lowerre BT. The harpy speech recognition system. PhD thesis. Carnegie Mellon University; 1976.
8. Toth P, Vigo D. The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia; 2002.
9. B. Funke, T. Grünert, and S. Irnich Local search for vehicle routing and scheduling problems: Review and conceptual integration Journal of heuristics 11 4 2005 267 306 (Pubitemid 41261193)
10. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
11. J.E. Beasley Route first-cluster second methods for vehicle routing Omega 11 4 1983 403 408
12. M. Held, and R.M. Karp A dynamic programming approach to sequencing problems Journal of the Society for Industrial and Applied Mathematics 10 1 1962 196
13. R. Bellman Dynamic programming treatment of the travelling salesman problem Journal of the Association for Computing Machinery 9 1 1962 61
14. G.J. Woeginger Exact algorithms for NP-hard problems: a survey Combinatorial optimization - Eureka! You shrink!. Lecture notes in computer science vol. 2570 2003 Springer Berlin 185 207 (Pubitemid 137631161)
15. R. Bisiani Beam search S. Shapiro, Encyclopedia of artificial intelligence 1987 Wiley & Sons 56 58
16. C. Rego, and F. Glover Local search and metaheuristics G. Gutin, A. Punnen, Traveling salesman problem and its variations 2002 Kluwer Academic Publishers Dordrecht 309 367
17. Kok AL. Congestion avoidance and break scheduling within vehicle routing. PhD thesis. University of Twente, School of Management and Governance; 2010.
18. Y. Dumas, J. Desrochiers, E. Gelinas, and M.M. Solomon An optimal algorithm for the traveling salesman problem with time windows Operations Research 43 2 1995 367 371 0030-364X
19. ORTEC Algorithmic Research and Development Team. Flexible vehicle routing and scheduling. ORTEC white paper series; 2011.
20. Kok AL, Hans EW, Schutten JMJ. Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Computers & Operations Research, in press. doi: 10.1016/j.cor.2011.05.027.
21. A.L. Kok, E.W. Hans, J.M.J. Schutten, and W.H.M. Zijm A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks Flexible Services and Manufacturing Journal 22 2010 83 108
22. A.L. Kok, C.M. Meyer, H. Kopfer, and J.M.J. Schutten A dynamic programming heuristic for the vehicle routing problem with time windows and European Community social legislation Transportation Science 44 4 2010 442 454
23. J. Oppen, and A. Løkketangen A tabu search approach for the livestock collection problem Computers & Operations Research 35 2008 3213 3229 (Pubitemid 351335143)
24. A. Goel Vehicle scheduling and routing with drivers working hours Transportation Science 43 1 2009 17 26
25. Li H, Lim A. A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of the 13th international conference on tools with artificial intelligence, 2001. p. 167
26. Hours-Of-Service Regulations. Federal motor carrier safety administration; 2005 〈 http://www.fmcsa.dot.gov/rules-regulations/topics/ hos/hos-2005.htm 〉.
27. E. Prescott-Gagnon, G. Desaulniers, M. Drexl, and L.-M. Rousseau European driver rules in vehicle routing with time windows Transportation Science 44 4 2010 455 473