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

Research output: Book/ReportReportAcademic

133 Downloads (Pure)

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
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages8
Publication statusPublished - 2010

Publication series

NameBETA publicatie : working papers
Volume338
ISSN (Print)1386-9213

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