Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 38, No. 4, November 2004, pp. 399-419
DOI: 10.1287/trsc.1030.0073
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Spivey, M. Z.
Right arrow Articles by Powell, W. B.
Right arrow Search for Related Content

The Dynamic Assignment Problem

Michael Z. Spivey, Warren B. Powell

Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544
Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544

mzspivey{at}alumni.princeton.edu
powell{at}princeton.edu

There has been considerable recent interest in the dynamic vehicle routing problem, but the complexities of this problem class have generally restricted research to myopic models. In this paper, we address the simpler dynamic assignment problem, where a resource (container, vehicle, or driver) can serve only one task at a time. We propose a very general class of dynamic assignment models, and propose an adaptive, nonmyopic algorithm that involves iteratively solving sequences of assignment problems no larger than what would be required of a myopic model. We consider problems where the attribute space of future resources and tasks is small enough to be enumerated, and propose a hierarchical aggregation strategy for problems where the attribute spaces are too large to be enumerated. Finally, we use the formulation to also test the value of advance information, which offers a more realistic estimate over studies that use purely myopic models.

Key Words: dynamic vehicle routing; dynamic assignment; approximate dynamic programming
History: Received: June 2001; revised: June 2002; revised: March 2003; accepted: May 2003.




This article has been cited by other articles:


Home page
Transportation ScienceHome page
H. P. Simao, J. Day, A. P. George, T. Gifford, J. Nienow, and W. B. Powell
An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application
Transportation Science, May 1, 2009; 43(2): 178 - 197.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
C. E. Cortes, D. Saez, A. Nunez, and D. Munoz-Carpintero
Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem
Transportation Science, February 1, 2009; 43(1): 27 - 42.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
S. Ichoua, M. Gendreau, and J.-Y. Potvin
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching
Transportation Science, May 1, 2006; 40(2): 211 - 225.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2004 by INFORMS.