IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v87y2019icp105-116.html
   My bibliography  Save this article

The planar multiple obnoxious facilities location problem: A Voronoi based heuristic

Author

Listed:
  • Drezner, Zvi
  • Kalczynski, Pawel
  • Salhi, Said

Abstract

Consider a situation where a given number of facilities must be located in a convex polygon with the objective of maximizing the minimum distance between facilities and a given set of communities subject to the facilities being farther than a certain distance from one another. This continuous multiple obnoxious facility location problem is very difficult to solve by commercial nonlinear optimizers. We propose a mathematical formulation of two variants of the problem and a heuristic approach based on Voronoi diagrams and a binary linear program. We compare our heuristic with popular state of the art solvers which utilize the multi-start approach: interior point, sparse nonlinear optimizer (SNOPT), GA, IPOPT, and NOMAD running in Matlab. Each problem instance is solved using 100 randomly generated starting solutions, and the best solution is selected. We found that our results are much better and were obtained in a fraction of the time required by other methods. The multiple obnoxious location problem is a perfect example where all-purpose nonlinear non-convex solvers perform poorly and are significantly outperformed by custom designed heuristics.

Suggested Citation

  • Drezner, Zvi & Kalczynski, Pawel & Salhi, Said, 2019. "The planar multiple obnoxious facilities location problem: A Voronoi based heuristic," Omega, Elsevier, vol. 87(C), pages 105-116.
    • Handle: RePEc:eee:jomega:v:87:y:2019:i:c:p:105-116
    DOI: 10.1016/j.omega.2018.08.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048318301051
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2018.08.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    2. Welch, S. B. & Salhi, S., 1997. "The obnoxious p facility network location problem with facility interaction," European Journal of Operational Research, Elsevier, vol. 102(2), pages 302-319, October.
    3. Erkut, Erhan & Neuman, Susan, 1989. "Analytical models for locating undesirable facilities," European Journal of Operational Research, Elsevier, vol. 40(3), pages 275-291, June.
    4. Richard L. Church & Robert S. Garfinkel, 1978. "Locating an Obnoxious Facility on a Network," Transportation Science, INFORMS, vol. 12(2), pages 107-118, May.
    5. Zvi Drezner & George O. Wesolowsky, 1983. "Minimax and maximin facility location problems on a sphere," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(2), pages 305-312, June.
    6. Rajan Batta & Samuel S. Chiu, 1988. "Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials," Operations Research, INFORMS, vol. 36(1), pages 84-92, February.
    7. Zvi Drezner & George O. Wesolowsky, 1985. "Location of Multiple Obnoxious Facilities," Transportation Science, INFORMS, vol. 19(3), pages 193-202, August.
    8. Zvi Drezner & Atsuo Suzuki, 2004. "The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems," Operations Research, INFORMS, vol. 52(1), pages 128-135, February.
    9. Erkut, Erhan, 1990. "The discrete p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 46(1), pages 48-60, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2023. "Obnoxious facility location in multiple dimensional space," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 331-354, July.
    2. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2020. "Gradual cover competitive facility location," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 333-354, June.
    3. Kayhan Alamatsaz & S. M. T. Fatemi Ghomi & Mehdi Iranpoor, 2021. "Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 351-373, June.
    4. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    5. Eliş, Haluk & Tansel, Barbaros & Oğuz, Osman & Güney, Mesut & Kian, Ramez, 2021. "On guarding real terrains: The terrain guarding and the blocking path problems," Omega, Elsevier, vol. 102(C).
    6. Pelegrín, Mercedes & Xu, Liding, 2023. "Continuous covering on networks: Improved mixed integer programming formulations," Omega, Elsevier, vol. 117(C).
    7. Kalczynski, Pawel & Drezner, Zvi, 2022. "The Obnoxious Facilities Planar p-Median Problem with Variable Sizes," Omega, Elsevier, vol. 111(C).
    8. Blanco, Víctor & Gázquez, Ricardo & Saldanha-da-Gama, Francisco, 2023. "Multi-type maximal covering location problems: Hybridizing discrete and continuous problems," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1040-1054.
    9. Richard L. Church & Zvi Drezner & Pawel Kalczynski, 2023. "Extensions to the planar p-median problem," Annals of Operations Research, Springer, vol. 326(1), pages 115-135, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pawel Kalczynski & Zvi Drezner, 2021. "The obnoxious facilities planar p-median problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 577-593, June.
    2. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    3. Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2023. "Obnoxious facility location in multiple dimensional space," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 331-354, July.
    4. Berman, Oded & Drezner, Zvi, 2000. "A note on the location of an obnoxious facility on a network," European Journal of Operational Research, Elsevier, vol. 120(1), pages 215-217, January.
    5. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    6. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2016. "The maxisum and maximin-maxisum HAZMAT routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 316-333.
    7. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    8. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    9. Aringhieri, Roberto & Cordone, Roberto & Grosso, Andrea, 2015. "Construction and improvement algorithms for dispersion problems," European Journal of Operational Research, Elsevier, vol. 242(1), pages 21-33.
    10. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
    11. O Berman & Q Wang, 2007. "Locating semi-obnoxious facilities with expropriation: minisum criterion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 378-390, March.
    12. Drezner, Tammy & Drezner, Zvi & Hulliger, Beat, 2014. "The Quintile Share Ratio in location analysis," European Journal of Operational Research, Elsevier, vol. 238(1), pages 166-174.
    13. Bloemhof-Ruwaard, Jacqueline M. & van Beek, Paul & Hordijk, Leen & Van Wassenhove, Luk N., 1995. "Interactions between operational research and environmental management," European Journal of Operational Research, Elsevier, vol. 85(2), pages 229-243, September.
    14. Eiselt, H.A. & Marianov, Vladimir, 2014. "A bi-objective model for the location of landfills for municipal solid waste," European Journal of Operational Research, Elsevier, vol. 235(1), pages 187-194.
    15. Amirgaliyeva, Zhazira & Mladenović, Nenad & Todosijević, Raca & Urošević, Dragan, 2017. "Solving the maximum min-sum dispersion by alternating formulations of two different problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 444-459.
    16. A. Jourani & C. Michelot & M. Ndiaye, 2009. "Efficiency for continuous facility location problems with attraction and repulsion," Annals of Operations Research, Springer, vol. 167(1), pages 43-60, March.
    17. Misagh Rahbari & Alireza Arshadi Khamseh & Yaser Sadati-Keneti & Mohammad Javad Jafari, 2022. "A risk-based green location-inventory-routing problem for hazardous materials: NSGA II, MOSA, and multi-objective black widow optimization," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 24(2), pages 2804-2840, February.
    18. Spiers, Sandy & Bui, Hoa T. & Loxton, Ryan, 2023. "An exact cutting plane method for the Euclidean max-sum diversity problem," European Journal of Operational Research, Elsevier, vol. 311(2), pages 444-454.
    19. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
    20. Welch, S. B. & Salhi, S., 1997. "The obnoxious p facility network location problem with facility interaction," European Journal of Operational Research, Elsevier, vol. 102(2), pages 302-319, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:87:y:2019:i:c:p:105-116. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.