Dynamic programming based metaheuristics for the dial-a-ride problem

Annals of Operations Research

Volumn 236, Issue 2, 2016, Pages 341-358

  Ritzinger, Ulrike ^a   Puchinger, Jakob ^a   Hartl, Richard F ^b  

^a AIT AUSTRIAN INSTITUTE OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

Dial a ride problem; Dynamic programming; Large neighborhood search

Indexed keywords

EID: 84955192579     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-014-1605-7     Document Type: Article

References (28)

1. Bellman, R. (1962). Dynamic programming treatment of the travelling salesman problem. JACM, 9, 61–63.
2. Bent, R., & Hentenryck, P. V. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4), 875–893.
3. Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11(6), 4135–4151.
4. Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39(1), 119–139.
5. Cordeau, J. F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579–594.
6. Cordeau, J. F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153, 29–46.
7. Dumas, Y., Desrosiers, J., Gelinas, E., & Solomon, M. M. (1995). An optimal algorithm for the traveling salesman problem with time windows. Operations Research, 43(2), 367–371.
8. Funke, B., Grünert, T., & Irnich, S. (2005). Local search for vehicle routing and scheduling problems: Review and conceptual integration. Journal of Heuristics, 11, 267–306.
9. Gendreau, M., Potvin, J. Y., Brumlaysy, O., Hasle, G., & Løkketangen, A. (2008). Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges, operations research/computer science interfaces series (Vol. 43, pp. 143–169). New York: Springer.
10. Gromicho, J. A. S., van Hoorn, J. J., Kok, A. L., & Schutten, J. M. J. (2012). Restricted dynamic programming: A flexible framework for solving realistic VRPs. Computers & OR, 39(5), 902–909.
11. Gschwind, T., & Irnich, S. (2012). Effective handling of dynamic time windows and synchronization with precedences for exact vehicle routing. Mainz: Chair of Logistics Management, Johannes Gutenberg University Mainz. (Technical Report LM-2012-05).
12. Held, M., & Karp, R. M. (1961). A dynamic programming approach to sequencing problems. In: Proceedings of the 1961 16th ACM national meeting, ACM ’61 (pp. 71.201–71.204). New York: ACM.
13. Malandraki, C., & Dial, R. B. (1996). A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research, 90(1), 45–55.
14. Maniezzo, V., Stützle, T., & Voß, S. (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming (1st ed.). Heidelberg: Springer.
15. Norvig, P. (1992). Paradigms of artificial intelligence programming: Case studies in common lisp (1st ed.). San Francisco: Morgan Kaufmann Publishers Inc.
16. Parragh, S. N., & Schmid, V. (2013). Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research, 40(1), 490–497.
17. Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Part II. Journal für Betriebswirtschaft, 58, 81–117.
18. Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2010a). Demand responsive transportation. In J. J. Cochran, L. A. Cox, P. Keskinocak, J. P. Kharoufeh, & J. C. Smith (Eds.), Wiley encyclopaedia of operations research and management science. Hoboken, NJ: Wiley.
19. Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2010b). Variable neighborhood search for the dial-a-ride problem. Computers and Operations Research, 37, 1129–1138.
20. Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics. International series in operations research & management science (Vol. 146, pp. 399–419). New York: Springer.
21. Psaraftis, H. N. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2), 130–154.
22. Ritzinger, U., & Puchinger, J. (2013). Hybrid metaheuristics for dynamic and stochastic vehicle routing. In E. G. Talbi (Ed.), Hybrid metaheuristics. Studies in computational intelligence (Vol. 434, pp. 77–95). Berlin: Springer.
23. Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455–472.
24. Ropke, S., Cordeau, J. F., & Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258–272.
25. Schilde, M., Doerner, K. F., & Hartl, R. F. (2011). Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research, 38(12), 1719–1730.
26. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J. F. Puget (Eds.), Principles and practice of constraint programming CP98. Lecture notes in computer science (Vol. 1520, pp. 417–431). Berlin: Springer.
27. Talbi, E. G. (2013). Hybrid metaheuristics. Studies in computational intelligence (Vol. 434). Berlin: Springer.
28. Toth, P., & Vigo, D. (2001). The vehicle routing problem. Philadelphia, PA: Society for Industrial and Applied Mathematics.