A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows

1986237 citationsJournal Article

Authors

François Soumis · Polytechnique Montréal

Abstract

SYNOPTIC ABSTRACTThe single-vehicle dial-a-ride problem with time window constraints for both pick-up and delivery locations, and precedence and capacity constraints, is solved using a forward dynamic programming algorithm. The total distance is minimized. The development of criteria for the elimination of infeasible states results in solution times which increase linearly with problem size.Key Words and Phrases: dial-a-ridedynamic programmingroutingscheduling

Topics & Keywords

Transportation and Mobility Innovations Vehicle Routing Optimization Methods Transportation Planning and Optimization

Publication Details

Published in: American Journal of Mathematical and Management Sciences

Volume 6, Issue 3-4, pp. 301-325

DOI: 10.1080/01966324.1986.10737198

Field-Weighted Citation Impact: 6.45

Command Palette

A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows

Authors

Abstract

Topics & Keywords

Publication Details