Abstract
We develop a solution strategy for the dynamic assignment problem, an important class of routing and scheduling problems with many applications in transportation and logistics. A label setting rolling horizon algorithm (LASER) was developed for the solution of the dynamic assignment problem. An extensive numerical analysis on a variety of randomly generated and real world problems was conducted in order to evaluate the algorithm. The breadth-first LASER algorithm was compared with a depth-first tour construction algorithm and an LP-optimal Dantzig-Wolfe column generation procedure. The LASER algorithm proved to be effective when compared to the other solution procedures from a solution quality and computational efficiency standpoin t for most problems.
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.
References
John J. Bartholdi III and Loren K. Platzman. “Heuristics based on spacefilling curves for combinatorial problems in euclidean space”. Management Science. 34:291–305. 1988.
Martin Desrochers and François Soumis, “A generalized permanent labelling algorithm for the shortest path problem with time windows”. INFOR. 26: 191–212. 1988.
J. Desrosiers, Y. Dumas. and F. Soumis. “The multiple vehicles many, 1 to many routing problem with time windows”Publication no. 362 Centre de Recherche sur les transports; Universite de Montreal, 1984.
J. Desrosiers. M. Solomon, and F. Soumis. “Time constrained routing and scheduling”. Technical report, Groupe d’étlldes et de rechercheen analyse e1es décisions, 1992.
Fred Glover, Darwin D. Klingman, Nancy V. Phillips, and Robert F. Schneider, “New polynomial shortest path algorithms and their computational attributes”Management Science 31:1106–1128, 1985.
l.J. Lustig, “The influence of computer language on computational comparisons: An example from network optimizationî. ORSA Journal on Compllting, pages 152–161. 1990.
1.J. Lustig. Simpnet, “A package for the network simplex method in c.”Technical report, Department ’of Civil Engineering and “ Operations Research, Princeton University, 1990.
Warren B. Powell and Zhi long Chen“A new algorithm for the shortest path problem wth lime windows”. Tecitnical report, Department of Civil Engineering anel Operations Research, Princeton University, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Powell, W.B., Gittoes, D.H. (1996). An Approximate Labelling Algorithm for the Dynamic Assignment Problem. In: Bianco, L., Toth, P. (eds) Advanced Methods in Transportation Analysis. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85256-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-85256-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85258-9
Online ISBN: 978-3-642-85256-5
eBook Packages: Springer Book Archive