Abstract
Consider a set of trips where each trip is specified a priori by a place of origin, a destination, a duration, a cost and a time interval within which the trip must begin. The problem is to minimize fleet size and total travel costs. This is a generalization of the m-travelling salesman problem. We compare results for three algorithms. The first one is an adaptation of the Carpaneto-Toth algorithm for the asymmetric travelling salesman problem: solution of nework problems by relaxing scheduling constraints, and branch-and-bound on flow variables. The second one consists in solution of network problems by relaxing scheduling constraints and branch-and-bound based on dividing the time windows. In the third algorithm, we use column generation on a set partitioning problem solved by simplex and branch-and-bound; columns are generated by a shortest path algorithm with time windows on the nodes.
Chapter PDF
References
L. Bodin, B. Golden, A. Assad and M. Ball, “Routing and scheduling of vehicles and crews: The state of the art,” Computers and Operations Research 10(2) (1983) 69–211.
G. Carpaneto and P. Toth, “Some new branching and bounding criteria for the asymmetric travelling salesman problem”, Management Science 26 (1980) 736–743.
J. Desrosiers, P. Pelletier and F. Soumis, “Plus court chemin avec contraintes d’horaires”, RAIRO Recherche Opérationnelle 17 (1983) 357–377.
J. Desrosiers, F. Soumis and M. Desrochers, “Routing with time windows by column generation”, Networks 14 (1984) 545–565.
J. Desrosiers, F. Soumis, M. Desrochers and M. Sauvé, “Routing and scheduling with time windows solved by network relaxation and branch-and-bound on time variables”, in: J.-M. Rousseau, ed., Computer scheduling of public transport, 2 (North-Holland, Amsterdam, 1985) 451–471.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Desrosiers, J., Soumis, F., Desrochers, M., Sauvé, M. (1986). Vehicle routing and scheduling with time windows. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121107
Download citation
DOI: https://doi.org/10.1007/BFb0121107
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00922-8
Online ISBN: 978-3-642-00923-5
eBook Packages: Springer Book Archive