Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png American Journal of Mathematical & Management Sciences Taylor & Francis

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

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

American Journal of Mathematical & Management Sciences , Volume 6 (3-4): 25 – Feb 1, 1986

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.

Loading next page...
 
/lp/taylor-francis/a-dynamic-programming-solution-of-the-large-scale-single-vehicle-dial-zph0aTmbuF

References (8)

Publisher
Taylor & Francis
Copyright
Copyright Taylor & Francis
ISSN
2325-8454
eISSN
0196-6324
DOI
10.1080/01966324.1986.10737198
Publisher site
See Article on Publisher Site

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.

Journal

American Journal of Mathematical & Management SciencesTaylor & Francis

Published: Feb 1, 1986

Keywords: dial-a-ride; dynamic programming; routing; scheduling

There are no references for this article.