Skip to main content

Abstract

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 runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools and is deployed to aid federal organizations in the US.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albareda-Sambola, M., Diaz, J.A., Fernandez, E.: A compact model and tight bounds for a combined location-routing problem. Computer & Operations Research 32, 407–428 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Balcik, B., Beamon, B., Smilowitz, K.: Last mile distribution in humanitarian relief. Journal of Intelligent Transportation Systems 12(2), 51–63 (2008)

    Article  Google Scholar 

  3. Barbarosoglu, G., Özdamar, L., Çevik, A.: An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations. European Journal of Operational Research 140(1), 118–133 (2002)

    Article  Google Scholar 

  4. Beamon, B.: Humanitarian relief chains: Issues and challenges. In: 34th International Conference on Computers & Industrial Engineering, pp. 77–82 (2008)

    Google Scholar 

  5. Bianchi, L., Dorigo, M., Gambardella, L., Gutjahr, W.: A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing 8(2) (2009)

    Google Scholar 

  6. Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transportation Science 42(2), 127–145 (2008)

    Article  Google Scholar 

  7. Burke, L.I., Tuzun, D.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116, 87–99 (1999)

    Article  MATH  Google Scholar 

  8. Duran, S., Gutierrez, M., Keskinocak, P.: Pre-positioning of emergency items worldwide for care international. Interfaces (2008) (submitted)

    Google Scholar 

  9. Fritz institute (2008), http://www.fritzinstitute.org

  10. United States Government. The federal response to hurricane katrina: Lessons learned (2006)

    Google Scholar 

  11. Griffin, P., Scherrer, C., Swann, J.: Optimization of community health center locations and service offerings with statistical need estimation. IIE Transactions (2008)

    Google Scholar 

  12. Gunnec, D., Salman, F.: A two-stage multi-criteria stochastic programming model for location of emergency response and distribution centers. In: INOC (2007)

    Google Scholar 

  13. Kall, P., Wallace, S.W.: Stochastic Programming. Wiley Interscience Series in Systems and Optimization. John Wiley & Sons, Chichester (1995)

    MATH  Google Scholar 

  14. Comet 2.1 User Manual. Dynadec website, http://dynadec.com/

  15. Nagy, G., Salhi, S.: Nested heuristic methods for the location-routing problem. Journal of Operational Research Society 47, 1166–1174 (1996)

    MATH  Google Scholar 

  16. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, Pennsylvania (2001)

    Google Scholar 

  18. Van Wassenhove, L.: Humanitarian aid logistics: supply chain management in high gear. Journal of the Operational Research Society 57(1), 475–489 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Hentenryck, P., Bent, R., Coffrin, C. (2010). Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13520-0_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13519-4

  • Online ISBN: 978-3-642-13520-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics