A restricted dynamic programming algorithm for the dial-a-ride problem

Ulrike Ritzinger (1) , Jakob Puchinger (1) , Richard F. Hartl (2)

1 AIT - Austrian Institute of Technology [Vienna]
2 Universität Wien = University of Vienna

In this paper, a restricted dynamic programming algorithm for the static multiple vehicle dial-a-ride problem is presented. Passengers have to be transported between pickup and delivery locations, while minimizing travel distances, respecting time window, user ride time and route duration constraints. We report preliminary results for benchmark instances which provide promising results. Algorithmic extensions and a hybrid metaheuristic are considered as pathways for future work.

Domaines: Recherche opérationnelle [math.OC]

Ulrike Ritzinger, Jakob Puchinger, Richard F. Hartl. A restricted dynamic programming algorithm for the dial-a-ride problem. 9th Metaheuristic International Conference (MIC 2011), Jul 2011, Udine, Italy. ⟨hal-01317142⟩