Abstract
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect).
We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Brimberg and H. Juel, A bicriteria model for locating a semi-desirable facility in the plane, European Journal of Operational Research 106 (1998) 144-151.
E. Carrizosa, E. Conde and D. Romero-Morales, Location of a semiobnoxious facility. A biobjective approach, in: Advances in Multiple Objective and Goal Programming, ed. Torremolinos (Springer, Berlin, 1997) pp. 338-346.
R.L. Church and R.S. Garfinkel, Locating an obnoxious facility on a network, Transportation Science 12 (1978) 107-118.
M.S. Daskin, Network and Discrete Location (Wiley, New York, 1995).
H.W. Hamacher, M. Labbe and S. Nickel, Multicriteria network location problems with sum objectives, Networks 33 (1999) 79-92.
H.W. Hamacher and S. Nickel, Multicriteria planar location problems, European Journal of Operational Research 94 (1996) 66-86.
P. Hansen, M. Labbè and J.F. Thisse, From the median to the generalized center, RAIRO Rech. Opér. 25 (1991) 73-86.
J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Info Process Lett. 33 (1989) 169-174.
N. Megiddo, Linear-time algorithms for linear programming in R 3 and related problems, SIAM J. Comput. 12 (1983) 759-776.
A.J.V. Skriver and K.A. Andersen, A bicriterion semi-obnoxious facility location model solved by an ɛ-approximation, Technical Report 2000-1, Department of Operations Research, University of Aarhus, Denmark (2000).
A.J.V. Skriver and K.A. Andersen, A label correcting approach for solving bicriterion shortest path problems, Computers and Operations Research 27 (2000) 507-524.
R.E. Steuer, Multiple Criteria Optimization: Theory, Computation, and Application (Wiley, New York, 1986).
K. Thulasiraman and M.N.S. Swamy, Graphs: Theory and Algorithms (Wiley, New York, 1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hamacher, H.W., Labbé, M., Nickel, S. et al. Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. Annals of Operations Research 110, 33–53 (2002). https://doi.org/10.1023/A:1020707315345
Issue Date:
DOI: https://doi.org/10.1023/A:1020707315345