Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 2, March-April 2005, pp. 281-297
DOI: 10.1287/opre.1040.0166
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 Topaloglu, H.
Right arrow Articles by Powell, W. B.
Right arrow Search for Related Content

A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations

Huseyin Topaloglu, Warren B. Powell

School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853
Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08544

topaloglu{at}orie.cornell.edu
powell{at}princeton.edu

This paper proposes a distributed solution approach to a certain class of dynamic resource allocation problems and develops a dynamic programming-based multiagent decision-making, learning, and communication mechanism. In the class of dynamic resource allocation problems we consider, a set of reusable resources of different types has to be assigned to tasks that arrive randomly over time. The assignment of a resource to a task removes the task from the system, modifies the state of the resource, and generates a contribution. We build a decision-making scheme where the decisions regarding the resources in different sets of states are made by different agents. We explain how to coordinate the actions of different agents using nonlinear functional approximations, and show that in a distributed setting, nonlinear approximations produce sequences of min-cost network flow problems that naturally yield integer solutions. We also experimentally compare the performances of the centralized and distributed solution strategies.

Subject classifications: dynamic programming: approximate dynamic programming; computers: artificial intelligence; technology transportation: dynamic fleet management.
History: Received March 2001; revision received October 2003; accepted December 2003.




This article has been cited by other articles:


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 HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.