Stochastic Facility Construction Problem with Preference of Candidate Sites

  • Hiroaki Ishii
  • Yung Lung Lee
  • Kuang-Yih Yeh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5861)


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.


Facility construction Random construction cost Urban area Preference of possible site Barriers Budget constraint satisfaction of critical distance Non-dominated solution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bealsley, J.E.: An Algorithm for Set Covering Problem. European Journal of Operational Research 31, 85–93 (1987)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Bealsley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problem. European Journal of Operational Research 58, 293–300 (1992)CrossRefGoogle Scholar
  3. 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. 4.
    Fisher, M.L., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36, 674–688 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 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. 6.
    Ishii, H.S., Shiode, T., Nishida, T., Namasuya, Y.: Stochastic Spanning Tree Problem. Discrete Applied Mathematics 3, 263–273 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Lawler, E.L.: Combinatorial Optimization: Networks and Matroid. Rinehart and Winston, New York (1976)zbMATHGoogle Scholar
  9. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Umetani, S., Yagiura, M.: Relaxation heuristics for the Set Covering Problem. Journal of the Operational Research Society of Japan 50, 350–375 (2007)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Weber, A.: Über Den Stand Der Industrien, 1. Teil: Reine Theorie Des Standortes (1909)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hiroaki Ishii
    • 1
  • Yung Lung Lee
    • 2
  • Kuang-Yih Yeh
    • 3
  1. 1.Graduate Shool of Information Science and TechnologyOsaka UNiversity, SuitaOsakaJapan
  2. 2.Department of Land Management and DevelopmentChang Jung Christian UniversityTainanTaiwan
  3. 3.Department of Urban PlanningCheng Kung UniversityTainanTaiwan

Personalised recommendations