Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems.
In: INFORMS Journal on Computing, Jg. 18 (2006), Heft 1, S. 31-42
academicJournal
Zugriff:
In this paper, we consider a stochastic and time-dependent version of the min-cost integer multicommodity-flow problem that arises in the dynamic resource allocation context. In this problem class, tasks arriving over time have to be covered by a set of indivisible and reusable resources of different types. The assignment of a resource to a task removes the task from the system, modifies the resource, and generates a profit. When serving a task, resources of different types can serve as substitutes of each other, possibly yielding different revenues. We propose an iterative, adaptive dynamic-programming-based methodology that makes use of linear or nonlinear approximations of the value function. Our numerical work shows that the proposed method provides highquality solutions and is computationally attractive for large problems. [ABSTRACT FROM AUTHOR]
Titel: |
Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems.
|
---|---|
Autor/in / Beteiligte Person: | Topaloglu, Huseyin ; Powell, Warren B. |
Zeitschrift: | INFORMS Journal on Computing, Jg. 18 (2006), Heft 1, S. 31-42 |
Veröffentlichung: | 2006 |
Medientyp: | academicJournal |
ISSN: | 1091-9856 (print) |
DOI: | 10.1287/ijoc.1040.0079 |
Schlagwort: |
|
Sonstiges: |
|