Abstract
In this paper we look at two interesting extensions to the classical 2-Facility Weber Problem in ℝd: At first problems are investigated where we do not allow the optimal locations to be in a specific region. Efficient algorithms for this Global Optimization problem are presented as well as new structural results. Secondly we consider 2-Facility Weber Problems with two decision makers where each decision maker can choose his own preferences for the location problem. We give an efficient algorithm for determining all pareto locations for this multicriteria problem as well as a polynomial description of the set of all pareto locations (in ℝ2d). All the results presented in this paper are based on a discretization of the original continuous problem using geometrical and combinatorial arguments. The time complexity of all the presented algorithms isO(dM logM), whereM is the number of existing facilities.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aneja YP, Parlar M (1994) Algorithms for weber facility location in the presence of forbidden regions and/or barriers to travel.Transportation Science 28:70–76
Blum M, Floyd W, Ptratt VR, Rivest RL, Tarjan Re (1972) Time bounds for selection. J. Comput. System Sci. 7:448–461
Batta R, Ghose A, Palekar US (1989) Locating facilities on the manhattan metric with arbitrarily shaped barriers and convex forbidden regions. Transportation Science 23:26–36
Chalmet LG, Francis RL, Kolen A (1981) Finding efficient solutions for rectilinear distance location problems efficiently. European Journal of Operational Research 6:117–124
Current J, Min H, Schilling D (1990) Multiobjective analysis of facility location decisions. European Journal of Operational Research 49:295–307
Durier R, Michelot C (1986) Set of efficient points in a normed space. Journal of Mathematical Analysis and Applications 117:506–528
Francis RL, McGinnis LFJr, White JA (1992) Facility layout and location: An analytical approach, 2nd Edition. Prentice-Hall, New York
Geoffrion AM (1967) Solving bicriterion mathematical programs. Operations Research 15:38–54
Hamacher HW (1995) Mathematische Lösungsverfahren für planare Standort-probleme. Vieweg
Hamacher HW, Nickel S (1996) Multicriteria planar location problems. European Journal of Operational Research 94:66–86
Hamacher HW, Nickel S (1994) Combinatorial algorithms for some 1-facility median problems in the plane. European Journal of Operational Research 79:340–351
Hamacher HW, Nickel S (1995) Restricted planar location problems and applications. Naval Research Logistics 42:967–992
Isermann H (1974) Proper efficiency and the linear vector maximization problem. Operations Research 22:189–191
Larson RC, Sadiq G (1983) Facility locations with the manhattan metric in the presence of barriers to travel. Operations Research 31:652–669
Nickel SC (1991) Restriktive Standortprobleme. Fachbereich Mathematik, University of Kaiserslautern, Diploma Thesis
Nickel S (1995) Discretization of Planar Location Problems. Shaker, Aachen
Pelegrin B, Fernandez FR (1988) Determination of efficient solutions for point objective locational decision problems. Naval Research Logistics 35:697–705
Puerto J, Fernandez FR (1994) Multicriteria decisions in location. Technical report, Facultad de Matematicas, Universidad de Sevilla
White DJ (1982) Dominance and optimal location. European Journal of Operational Research 9:309
Wendell RE, Hurter AP, Lowe TJ (1977) Efficient points in location problems. AIIE Transactions 9:238–246
Author information
Authors and Affiliations
Additional information
Partially supported by a grant of the Deutsche Forschungsgemeinschaft and grant ERBCHRXCT930087 of the European HC& M Programme.
Rights and permissions
About this article
Cite this article
Nickel, S. Bicriteria and restricted 2-Facility Weber Problems. Mathematical Methods of Operations Research 45, 167–195 (1997). https://doi.org/10.1007/BF01193859
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01193859