IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v58y2021i2d10.1007_s12597-020-00487-0.html
   My bibliography  Save this article

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

Author

Listed:
  • Kayhan Alamatsaz

    (Amirkabir University of Technology)

  • S. M. T. Fatemi Ghomi

    (Amirkabir University of Technology)

  • Mehdi Iranpoor

    (Isfahan University of Technology)

Abstract

This paper addresses the problem of locating obnoxious facilities aiming to mitigate the adverse effects of such facilities by minimizing the total covered demand and reducing the harmful effects of multiple-coverage by placing the facilities far from each other. Unlike the classical approaches, it is assumed that the facilities can be located not only on the nodes but also on the network’s edges. Additionally, demands are not restricted to reside on the nodes but are distributed along the edges. In such a condition, the problem of locating obnoxious facilities is much closer to the real-world. A bi-objective mixed-integer linear programming formulation is developed for this novel problem. This bi-objective problem is solved using the ε-constraint method and NSGA-II. The ε-constraint method can be used to solve the small and medium-sized problems optimally in a reasonable time. As a realistic example, this approach is implemented in a case study in Isfahan for a particular urban planning problem. The case is locating obnoxious solid waste disposal facilities that should be located as far away as possible and simultaneously cover the least demands. Large scale problems cannot be solved efficiently using the ε-constraint method. However, the numerical analysis showed the efficiency and effectiveness of the NSGA-II approach for these problems. Finally, sensitivity analysis is applied to evaluate the effect of changes in coverage distance and the number of facilities on the conflicting objective functions.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:opsear:v:58:y:2021:i:2:d:10.1007_s12597-020-00487-0
    DOI: 10.1007/s12597-020-00487-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-020-00487-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12597-020-00487-0?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. 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.
    2. Richard L. Church & Alan Murray, 2018. "Location Covering Models," Advances in Spatial Science, Springer, number 978-3-319-99846-6, February.
    3. Plastria, Frank & Carrizosa, Emilio, 1999. "Undesirable facility location with minimal covering objectives," European Journal of Operational Research, Elsevier, vol. 119(1), pages 158-180, November.
    4. Ali Reza Sepasian, 2019. "Reverse 1-maxian problem with keeping existing 1-median," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 1-13, March.
    5. 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.
    6. Rabbani, M. & Heidari, R. & Yazdanparast, R., 2019. "A stochastic multi-period industrial hazardous waste location-routing problem: Integrating NSGA-II and Monte Carlo simulation," European Journal of Operational Research, Elsevier, vol. 272(3), pages 945-961.
    7. Sayah, David & Irnich, Stefan, 2017. "A new compact formulation for the discrete p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 62-67.
    Full references (including those not matched with items on IDEAS)

    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. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    2. 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.
    3. Haywood, Adam B. & Lunday, Brian J. & Robbins, Matthew J. & Pachter, Meir N., 2022. "The weighted intruder path covering problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 347-358.
    4. Heydari, Ruhollah & Melachrinoudis, Emanuel, 2012. "Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives," European Journal of Operational Research, Elsevier, vol. 223(2), pages 452-460.
    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. Ghazale Kordi & Parsa Hasanzadeh-Moghimi & Mohammad Mahdi Paydar & Ebrahim Asadi-Gangraj, 2023. "A multi-objective location-routing model for dental waste considering environmental factors," Annals of Operations Research, Springer, vol. 328(1), pages 755-792, September.
    7. Ghalehkhondabi, Iman & Maihami, Reza & Ahmadi, Ehsan, 2020. "Optimal pricing and environmental improvement for a hazardous waste disposal supply chain with emission penalties," Utilities Policy, Elsevier, vol. 62(C).
    8. Pelegrín, Mercedes & Xu, Liding, 2023. "Continuous covering on networks: Improved mixed integer programming formulations," Omega, Elsevier, vol. 117(C).
    9. Jian Zhou & Meixi Zhang & Sisi Wu, 2022. "Multi-Objective Vehicle Routing Problem for Waste Classification and Collection with Sustainable Concerns: The Case of Shanghai City," Sustainability, MDPI, vol. 14(18), pages 1-25, September.
    10. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    11. Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    12. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    13. Asif Iqbal & Abdullah Yasar & Abdul-Sattar Nizami & Rafia Haider & Faiza Sharif & Imran Ali Sultan & Amtul Bari Tabinda & Aman Anwer Kedwaii & Muhammad Murtaza Chaudhary, 2022. "Municipal Solid Waste Collection and Haulage Modeling Design for Lahore, Pakistan: Transition toward Sustainability and Circular Economy," Sustainability, MDPI, vol. 14(23), pages 1-39, December.
    14. Oscar Lopez Jaramillo & Joel Rinebold & Michael Kuby & Scott Kelley & Darren Ruddell & Rhian Stotts & Aimee Krafft & Elizabeth Wentz, 2021. "Hydrogen Station Location Planning via Geodesign in Connecticut: Comparing Optimization Models and Structured Stakeholder Collaboration," Energies, MDPI, vol. 14(22), pages 1-26, November.
    15. Karatas, Mumtaz, 2017. "A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1040-1051.
    16. Kalczynski, Pawel & Drezner, Zvi, 2022. "The Obnoxious Facilities Planar p-Median Problem with Variable Sizes," Omega, Elsevier, vol. 111(C).
    17. Haoqing Wang & Wen Yi & Yannick Liu, 2022. "Optimal Route Design for Construction Waste Transportation Systems: Mathematical Models and Solution Algorithms," Mathematics, MDPI, vol. 10(22), pages 1-13, November.
    18. Wu, Weitiao & Ma, Jian & Liu, Ronghui & Jin, Wenzhou, 2022. "Multi-class hazmat distribution network design with inventory and superimposed risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    19. Jaller, Miguel & Pahwa, Anmol, 2023. "Coping with the Rise of E-commerce Generated Home Deliveries through Innovative Last-mile Technologies and Strategies," Institute of Transportation Studies, Working Paper Series qt5t76x0kh, Institute of Transportation Studies, UC Davis.
    20. Andrés Martínez-Reyes & Carlos L. Quintero-Araújo & Elyn L. Solano-Charris, 2021. "Supplying Personal Protective Equipment to Intensive Care Units during the COVID-19 Outbreak in Colombia. A Simheuristic Approach Based on the Location-Routing Problem," Sustainability, MDPI, vol. 13(14), pages 1-16, July.

    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:spr:opsear:v:58:y:2021:i:2:d:10.1007_s12597-020-00487-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.