Share Email Print
cover

Proceedings Paper

Modeling and simulation-based solutions for complex resource allocation problems
Author(s): Christos G. Cassandras; Kagan Gokbayrak
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Resource allocation problems arise in application domains such as logistics, networking, manufacturing, and C4I systems. The discrete nature of resources to be allocated makes such problems combinatorially complex. In addition, uncertainties in the times when resources are requested and relinquished introduce additional complexities often necessitating the use of simulation for modeling and analysis purposes. In this paper, we present two approaches for solving such problems, the first based on ordinal optimization and the second on the idea of replacing the original discrete allocation problem by a `surrogate model' involving a continuous allocation problem. The latter is simpler to solve through gradient-based techniques and can be shown to recover the solutions of the original problem. Concurrent simulation is used to estimate the gradients required in this approach, leading to extremely fast solutions for many problems in practice.

Paper Details

Date Published: 22 June 1999
PDF: 11 pages
Proc. SPIE 3696, Enabling Technology for Simulation Science III, (22 June 1999); doi: 10.1117/12.351173
Show Author Affiliations
Christos G. Cassandras, Boston Univ. (United States)
Kagan Gokbayrak, Boston Univ. (United States)


Published in SPIE Proceedings Vol. 3696:
Enabling Technology for Simulation Science III
Alex F. Sisti, Editor(s)

© SPIE. Terms of Use
Back to Top