Abstract
This article examines a constrained shortest path problem which occurs when a vehicle route must be designed to cover transportation requests, each requiring pick-up and delivery. The additional constraints relate to the capacity of the vehicle and time intervals within which pick-up and delivery must occur. We propose a dynamic programming algorithms for this problem. This problem arises for the generation of feasible routes during the solution by column generation of the problem in which routes for many vehicles must be constructed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Desrochers and F. Soumis, “A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows”, Publication #394A, Centre de recherche sur les transports, Université de Montréal, 28 pages, 1985.
M. Desrochers and F. Soumis, “A Reoptimization Algorithm for the Shortest Path Problem with Time Windows”, Publication #397A, Centre de recherche sur les transports, Université de Montréal, 24 pages, 1985.
J. Desrosiers, Y. Dumas and F. Soumis, “A Dynamic Programming Method for the Large Scale Single Vehicle Dial-a-Ride Problem with Time Windows”, Publication #361, to appear in American Journal of Mathematical and Management Science.
J. Desrosiers, P. Pelletier and F. Soumis, “Plus court chemin avec contraintes d’horaires”, R.A.I.R.O. Recherche opérationnelle, 17, 357–377, 1983.
J. Desrosiers, F. Soumis and M. Desrochers, “Routing with Time Windows by Column Generation”, Networks, 14, 545–565, 1984.
Y. Dumas, “Confection d’itinéraires de véhicules en vue du transport de plusieurs origines à plusieurs destinations”, Publication #434, Université de Montréal, 96 pages, 1985.
A. Guinet, “Le système T.I.R.: un système d’établissement de tournées industrielles routières, thèse de doctorat en informatique et automatique appliquée”, Université Claude Bernard à Lyon, 1984.
A. Kolen, A. Rinnooy Kan and H. Triene Kens, “Vehicle Routing with Time Windows”, Working Paper, Erasmus University, Rotterdam, 14 pages, 1985.
H. Psaraftis, “A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem”, Transportation Science, 14, 130–154, 1980.
T. Sexton and L. Bodin, “Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling”, Transportation Science, 19, 378–410, 1985.
T. Sexton and L. Bodin, “Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing”, Transportation Science, 19, 411–435, 1985.
M. Solomon, “Vehicle Routing and Scheduling with Time Window Constraints: Models and Algorithms”, Ph. D. Thesis, Dept. of Decision Sciences”, University of Pennsylvania, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desrosiers, J., Dumas, Y. (1988). The Shortest Path Problem for the Construction of Vehicle Routes with Pick-Up, Delivery and Time Constraints. In: Eiselt, H.A., Pederzoli, G. (eds) Advances in Optimization and Control. Lecture Notes in Economics and Mathematical Systems, vol 302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46629-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-46629-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18962-6
Online ISBN: 978-3-642-46629-8
eBook Packages: Springer Book Archive