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

Ulrike Maria Ritzinger; Jakob Puchinger; Richard F. Hartl

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

Ulrike Maria Ritzinger (Vortragende:r), Jakob Puchinger, Richard F. Hartl

Integrated Energy Systems

Publikation: Beitrag in Buch oder Tagungsband › Vortrag mit Beitrag in Tagungsband › Begutachtung

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.

Originalsprache	Englisch
Titel	MIC 2011 conference proceedings
Seitenumfang	3
Publikationsstatus	Veröffentlicht - 2011
Veranstaltung	9th Metaheuristic International Conference (MIC 2011) - Dauer: 25 Juli 2011 → 28 Juli 2011

Konferenz

Konferenz	9th Metaheuristic International Conference (MIC 2011)
Zeitraum	25/07/11 → 28/07/11

Research Field

Ehemaliges Research Field - Mobility Systems

Diese Publikation zitieren

@inproceedings{7eefd375502b4ab9acf98af52b8333da,

title = "A restricted dynamic programming algorithm for the dial-a-ride problem",

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.",

author = "Ritzinger, {Ulrike Maria} and Jakob Puchinger and Hartl, {Richard F.}",

year = "2011",

language = "English",

isbn = "978-88-900984-3-7",

booktitle = "MIC 2011 conference proceedings",

note = "9th Metaheuristic International Conference (MIC 2011) ; Conference date: 25-07-2011 Through 28-07-2011",

}

TY - GEN

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

AU - Puchinger, Jakob

AU - Hartl, Richard F.

A2 - Ritzinger, Ulrike Maria

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

M3 - Conference Proceedings with Oral Presentation

SN - 978-88-900984-3-7

BT - MIC 2011 conference proceedings

T2 - 9th Metaheuristic International Conference (MIC 2011)

Y2 - 25 July 2011 through 28 July 2011

ER -

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

Abstract

Konferenz

Research Field

Fingerprint

Diese Publikation zitieren