An Exact Algorithm For The Single Vehicle Many-To-Many Dial-A-Ride Problem With Time Windows

Research output: Contribution to journalJournal articleResearchpeer-review

588 Downloads (Pure)

Abstract

This paper modifies the exact dynamic programming algorithm developed by the author for the single vehicle many-to-many immediate request Dial-A-Ride problem. Each customer has specified upper and lower bounds for his pickup and delivery times and the objective is to minimize the time needed to service all customers. The major difference between the two algorithms is the substitution of backward recursion with forward recursion. The new algorithm requires the same computational effort as the old one (0(N23N) for N customers) and is able to recognize infeasible problem instances.
Original languageEnglish
JournalTransportation Science
Volume17
Issue number3
Pages (from-to)351-357
Number of pages7
ISSN0041-1655
DOIs
Publication statusPublished - 1983
Externally publishedYes

Fingerprint Dive into the research topics of 'An Exact Algorithm For The Single Vehicle Many-To-Many Dial-A-Ride Problem With Time Windows'. Together they form a unique fingerprint.

Cite this