Fuzzy facility location problem with preference of candidate sites. (English) Zbl 1137.90583

Summary: Models so far considered as facility location problems treat either min-max or max-min criterion, that is, the facility is either desirable or undesirable. We propose the following model considering the satisfaction degree with respect to the distance from the facility for each customer (residents) and preference of the site in an urban area. The objective is to find the site of the facility which maximizes the minimal satisfaction degree among all demand points and maximizes the preference of the site. Since generally speaking, there exists no site that maximizes both criteria, we seek non-dominated sites after defining non-domination.


90B80 Discrete location and assignment
90C70 Fuzzy and other nonstochastic uncertainty mathematical programming
Full Text: DOI


[1] Elzinga, J.; Hearn, D. W., Geometric solutions for some minimax location problems, Transportation Sci., 6, 379-394 (1972)
[2] Ishii, H.; Shiode, S.; Nishida, T.; Iguchi, K., An algorithm for a partially chance-constrained E-model, J. Oper. Res. Soc. Japan, 22, 233-256 (1979) · Zbl 0425.90071
[3] Matutomi, T.; Ishii, H., Minimax location problem with \(A\)-distance, J. Oper. Res. Soc. Japan, 41, 181-185 (1998)
[4] Megiddo, N., Linear time algorithms for linear programming in \(R^3\) and related problems, SIAM J. Comput., 12, 759-776 (1983) · Zbl 0521.68034
[5] Ohsawa, Y., Bicriteria Euclidean location associated with maximin and minimax criteria, Naval Res. Logist., 47, 581-592 (2000) · Zbl 0991.90082
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.