An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows

Harilaos N. Psaraftis
Additional contact information
Harilaos N. Psaraftis: Massachusetts Institute of Technology, Cambridge, Massachusetts

Transportation Science, 1983, vol. 17, issue 3, 351-357

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 to solve the problem where each customer has specified upper and lower bounds for his pickup and delivery times and where 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( N 2 3 N ) for N customers) and is able to recognize infeasible problem instances.

Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (46)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.17.3.351 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:17:y:1983:i:3:p:351-357

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().