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

Ulrike Maria Ritzinger (Speaker), Jakob Puchinger, Richard F. Hartl

Research output: Chapter in Book or Conference ProceedingsConference Proceedings with Oral Presentationpeer-review

Abstract

In this paper, a restricted dynamic programming algorithm for the static multiple vehicle dial-aride 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.
Original languageEnglish
Title of host publicationMIC 2011 conference proceedings
Number of pages3
Publication statusPublished - 2011
Event9th Metaheuristic International Conference (MIC 2011) -
Duration: 25 Jul 201128 Jul 2011

Conference

Conference9th Metaheuristic International Conference (MIC 2011)
Period25/07/1128/07/11

Research Field

  • Former Research Field - Mobility Systems

Fingerprint

Dive into the research topics of 'A restricted dynamic programming algorithm for the dial-a-ride problem'. Together they form a unique fingerprint.

Cite this