Abstract
The obnoxious p-median (OpM) problem is the repulsive counterpart of the ore known attractive p-median problem. Given a set I of cities and a set J of possible locations for obnoxious plants, a p-cardinality subset Q of J is sought, such that the sum of the distances between each city of I and the nearest obnoxious site in Q is maximised. We formulate (OpM) as a {0,1} linear programming problem and propose three families of valid inequalities whose separation problem is polynomial. We describe a branch-and-cut approach based on these inequalities and apply it to a set of instances found in the location literature. The computational results presented show the effectiveness of these inequalities for (OpM).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alp O, Drezner Z, Erkut E (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122(1–4):21–42
Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069–1072
Belotti P, Labbé M, Maffioli F (2000) A Tabu Search approach to the Obnoxious p-Median problem. Internal report 2000.49, DEI, Politecnico di Milano
Burkard RE, Çela E, Dollani H (2000) 2-Medians in Networks with Pos/Neg Weights. Discrete Appl Math 105:51–71
Cappanera P, Gallo G, Maffioli F (1999) Discrete Facility Location and Routing of Obnoxious Activities. Discrete Appl Math 133:3–28
Carrizosa E, Conde E (2002) A fractional model for locating semi-desirable facilities on networks. Eur J Oper Res 136:67–80
Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 12:107–118
Dell’Amico M, Lodi A, Maffioli F (1999) Solution of the cumulative assignment problem with a well-structured Tabu search method. J Heuristics 5(2):123–143
Drezner Z, Hamacher H (eds) (2002) Facility location: applications and theory. Springer, Berlin Heidelberg New York
Eiselt HA, Laporte G (1995) Objectives in location problems. In: Drezner Z (ed) Facility locations: a survey of applications and methods. Springer Series in OR, New York, pp 151–180
Erkut E (1990) The discrete p-dispersion problem. Eur J Oper Res 46:48–60
Erkut E, Baptie T, Von Hohenbalken B (1990) The discrete p-maxian location problem. Comput Oper Res 17(1):51–61
Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275–291
Erkut E, Neuman S (1990) Comparison of four models for dispersing facilities. INFOR 29:68–85
Galvão RD, ReVelle C (1996) Lagrangean heuristic for the maximal covering location problem. Eur J Oper Res 88:114–123
Hansen P, Moon ID (1988) Dispersing facilities on a Network. TIMS/ORSA Joint National Meeting, Washington DC
Klein CM, Kincaid RK (1994) The discrete anti-p-center problem. Transp Sci 28:77–79
Koerkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39:157–173
Kuby MJ (1987) Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems. Geogr Anal 9:315–329
Minieka E (1983) Anticenters and antimedians of a network. Networks 13:359–364
Moon ID, Chaudhry SS (1983) An analysis of network location problems with distance constraints. Manage Sci 30:290–307
Naddef D, Rinaldi G (2000) Branch-and-cut algorithms. In: Toth P, Vigo D (eds) Vehicle routing, SIAM
Shier DR (1977) A min–max theorem for p-center problems on a tree. Transp Sci 11(3):243–252
Tamir A (1991) Obnoxious facility location on graphs. SIAM J Discrete Math 4:550–567
Ting SS (1988) Obnoxious facility location problems on networks, PhD thesis, The Johns Hopkins University
Welch SB, Salhi S (1997) The obnoxious p-facility network location problem with facility interaction. Eur J Oper Res 102:302–319
Zhang FG, Melachrinoudis E (2001) The maximin-maxisum network location problem. Comput Optim Appl 19:209–234
Author information
Authors and Affiliations
Corresponding author
Additional information
The work of the first author has been partially supported by the Coordinated Project C.A.M.P.O. and that of the third author by a short mobility grant, both of the Italian National Research Council.
Rights and permissions
About this article
Cite this article
Belotti, P., Labbé, M., Maffioli, F. et al. A branch-and-cut method for the obnoxious p-median problem. 4OR 5, 299–314 (2007). https://doi.org/10.1007/s10288-006-0023-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-006-0023-3