Skip to main content

Stochastic Facility Construction Problem with Preference of Candidate Sites

  • Conference paper
Modeling Decisions for Artificial Intelligence (MDAI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5861))

  • 837 Accesses

Abstract

This paper considers a facility construction problem in a rectangular urban area with some barriers and rectilinear distance. There exist some demand points and possible construction sites with preference. A random construction cost according to a normal distribution. The probability that the cost becomes below the budget should not be below the fixed level. One objective is that the budget should be minimized under the condition demand points are covered by at least one of facilities constructed within a certain critical distance. Another is that the minimal preference among constructed sites should be maximized. The other is to maximize minimal satisfaction degree with respect to critical distances among all demand points. We formulate our problem as a three criteria problem with a chance constraint. Since usually there exists no solution optimizing three objectives at a time, we seek some non-dominated solutions after the definition of non-domination.

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. Bealsley, J.E.: An Algorithm for Set Covering Problem. European Journal of Operational Research 31, 85–93 (1987)

    Article  MathSciNet  Google Scholar 

  2. Bealsley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problem. European Journal of Operational Research 58, 293–300 (1992)

    Article  Google Scholar 

  3. Daskin, M.S., Dean, L.K.: Location of Health Care Facilities. In: Brandeau, M.L., Sainfort, F., Perskalla, W.P. (eds.) Operations Research and Health care, pp. 43–76. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  4. Fisher, M.L., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36, 674–688 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Garey, M.R., Johnson, D.R.: Computer and Intractability-A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)

    Google Scholar 

  6. Ishii, H.S., Shiode, T., Nishida, T., Namasuya, Y.: Stochastic Spanning Tree Problem. Discrete Applied Mathematics 3, 263–273 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ishii, H., Lee, Y.L., Yeh, K.Y.: Facility location problem with preference of candidate sites. Fuzzy Sets and Systems 158, 1922–1930 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lawler, E.L.: Combinatorial Optimization: Networks and Matroid. Rinehart and Winston, New York (1976)

    MATH  Google Scholar 

  9. Melo, M.T., Nickel, S., Saldanha-da-Gama, F.: Facility location and supply chain Management-A review. European Jornal of Operational research 196, 401–412 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Umetani, S., Yagiura, M.: Relaxation heuristics for the Set Covering Problem. Journal of the Operational Research Society of Japan 50, 350–375 (2007)

    MATH  MathSciNet  Google Scholar 

  11. Weber, A.: Ãœber Den Stand Der Industrien, 1. Teil: Reine Theorie Des Standortes (1909)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishii, H., Lee, Y.L., Yeh, KY. (2009). Stochastic Facility Construction Problem with Preference of Candidate Sites. In: Torra, V., Narukawa, Y., Inuiguchi, M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2009. Lecture Notes in Computer Science(), vol 5861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04820-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04820-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04819-7

  • Online ISBN: 978-3-642-04820-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics