Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh

M. Firat, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

32 Citations (Scopus)

Abstract

Hunsaker and Savelsbergh [Operations Research Letters 30, 2002] discussed feasibility testing for a dial-a-ride problem under maximum wait time and maximum ride time constraints. We show that this feasibility test can be expressed as a shortest path problem in vertex-weighted interval graphs, which leads to a simple linear time algorithm.
Original languageEnglish
Pages (from-to)32-35
JournalOperations Research Letters
Volume39
Issue number1
DOIs
Publication statusPublished - 2011

Fingerprint

Dive into the research topics of 'Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh'. Together they form a unique fingerprint.

Cite this