Spacial and objective decompositions for very large SCAPs
- Los Alamos National Laboratory
- BROWN UNIV.
This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight run-time constraints to be practical in real-world disaster situations. This paper revisits the SCAP algorithm proposed in and proposes new storage allocation models that are necessary to enable the algorithm to scale to problem sizes of three orders of magnitude greater (250, 500, 1000 storage locations). The new algorithms are validated on large-scale hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools.
- Research Organization:
- Los Alamos National Laboratory (LANL)
- Sponsoring Organization:
- DOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 1028798
- Report Number(s):
- LA-UR-10-05696; LA-UR-10-5696
- Country of Publication:
- United States
- Language:
- English
Similar Records
Strategic planning for power system restorations
Vehicle routing for the last mile of power system restoration