EXACT ALGORITHM FOR THE SINGLE VEHICLE MANY-TO-MANY DIAL-A-RIDE PROBLEM WITH TIME WINDOWS

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 and is able to recognize infeasible problem instances.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Corporate Authors:

  Operations Research Society of America

  428 East Preston Street
  Baltimore, MD  United States  21202
• Authors:
  • Psaraftis, H N
• Publication Date: 1983-8

Media Info

• Features: References;
• Pagination: p. 351-357
• Serial:
  • Transportation Science
  • Volume: 17
  • Issue Number: 3
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Algorithms; Dynamic programming; Optimization; Paratransit services; Routes; Routing; Savings; Time; Transportation
• Old TRIS Terms: Mathematical programming, dynamic; Route analysis
• Subject Areas: Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00381994
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Apr 30 1984 12:00AM