Skip to main content

Dynamic Facility Location with Stochastic Demands

  • Conference paper
Stochastic Algorithms: Foundations and Applications (SAGA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3777))

Included in the following conference series:

Abstract

In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming is given. It is only usable for small instances. In the second part a Monte Carlo based method for solving larger instances is applied, which is derived from the Sample Average Approximation (SAA) method.

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. Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont (1995)

    MATH  Google Scholar 

  2. Hammer, P.L.: Annals of Operations Research: Recent Developments in the Theory and Applications of Location Models 1/2. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  3. Homem-de-Mello, T.: Variable-Sample Methods for Stochastic Optimimization. ACM Trans. on Modeling and Computer Simulation (2003)

    Google Scholar 

  4. Jaillet, P.: Probabilistic Travelling Salesman Problems. Ph.D. thesis, MIT (1985)

    Google Scholar 

  5. Kleywegt, A., Shapiro, A., Hohem-de-Mello, T.: The Sample Average Method for Stochastic Discrete Optimization. SIAM J. Optim. 12 (2001/02)

    Google Scholar 

  6. Laporte, G., Louveaux, F., Van Hamme, L.: Exact Solution to a Location Problem with Stochatic Demands. Transportation Science 28 (1994)

    Google Scholar 

  7. Makhorin, A.: GNU Linear Programming Kit - Reference Manual - Version 4.1, Department for Applied Informatics, Moscow Aviation Institute, Moscow, Russia (2003)

    Google Scholar 

  8. Melo, M.T., Nickel, S., Saldanha da Gama, F.: Large-Scale Models for Dynamic Multi-Commodity Capacitated Facility Location, Berichtsreihe des Fraunhofer Inststituts für Techno- und Wirtschaftsmathematik (ITWM), Kaiserslautern (2003) ISSN 1434-997

    Google Scholar 

  9. Hesse Owen, S., Daskin, M.S.: Strategic Facility Location: A Review. European Journal of Operational Research 111 (1998)

    Google Scholar 

  10. Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, J.: A Stochastic Programming Approach for Supply Chain Network Design under Uncertainty, The Stochastic Programming E-Print Series, (SPEPS) (2003)

    Google Scholar 

  11. Schneeweiß, C.: Dynamisches Programmieren. Physica-Verlag, Heidelberg (1974)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Romauch, M., Hartl, R.F. (2005). Dynamic Facility Location with Stochastic Demands. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2005. Lecture Notes in Computer Science, vol 3777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11571155_15

Download citation

  • DOI: https://doi.org/10.1007/11571155_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29498-6

  • Online ISBN: 978-3-540-32245-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics