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

Abstract : The organization of a specialized transportation system to perform transports for elderly and handicapped people is usually modeled as dial-a-ride problem. Users place transportation requests with specified pickup and delivery locations and times. The requests have to be completed under user inconvenience considerations by a specified fleet of vehicles. In the dial-a-ride problem, the aim is to minimize the total travel times respecting the given time windows, the maximum user ride times, and the vehicle restrictions. This paper introduces a dynamic programming algorithm for the dial-a-ride problem and demonstrates its effective application in (hybrid) metaheuristic approaches. Compared to most of the works presented in literature, this approach does not make use of any (commercial) solver. We present an exact dynamic programming algorithm and a dynamic programming based metaheuristic, which restricts the considered solution space. Then, we propose a hybrid metaheuristic algorithm which integrates the dynamic programming based algorithms into a large neighborhood framework. The algorithms are tested on a given set of benchmark instances from the literature and compared to a state-of-the-art hybrid large neighborhood search approach.
Type de document :
Article dans une revue
Annals of Operations Research, Springer Verlag, 2016, 236 (2), 〈10.1007/s10479-014-1605-7〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

Contributeur : Jakob Puchinger <>
Soumis le : vendredi 6 novembre 2015 - 09:44:15
Dernière modification le : jeudi 20 décembre 2018 - 13:36:01
Document(s) archivé(s) le : dimanche 7 février 2016 - 10:13:39


Fichiers produits par l'(les) auteur(s)


Distributed under a Creative Commons Paternité - Pas d'utilisation commerciale - Pas de modification 4.0 International License




Ulrike Ritzinger, Jakob Puchinger, Richard F. Hartl. Dynamic programming based metaheuristics for the dial-a-ride problem. Annals of Operations Research, Springer Verlag, 2016, 236 (2), 〈10.1007/s10479-014-1605-7〉. 〈hal-01224565〉



Consultations de la notice


Téléchargements de fichiers