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

Maximal Covering Location Problems on networks with regional demand

Author

Listed:
  • Blanquero, Rafael
  • Carrizosa, Emilio
  • G.-Tóth, Boglárka

Abstract

Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper, we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a network so that the expected demand covered is maximized, where demand is continuously distributed along the edges. This MINLP has a combinatorial part (which edges of the network are chosen to contain facilities) and a continuous global optimization part (once the edges are chosen, which are the optimal locations within such edges).

Suggested Citation

  • Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka, 2016. "Maximal Covering Location Problems on networks with regional demand," Omega, Elsevier, vol. 64(C), pages 77-85.
    • Handle: RePEc:eee:jomega:v:64:y:2016:i:c:p:77-85
    DOI: 10.1016/j.omega.2015.11.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048315002443
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2015.11.004?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. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
    2. Hasan Pirkul & David A. Schilling, 1991. "The Maximal Covering Location Problem with Capacities on Total Workload," Management Science, INFORMS, vol. 37(2), pages 233-248, February.
    3. Abdullah Dasci & Gilbert Laporte, 2005. "A Continuous Model for Multistore Competitive Location," Operations Research, INFORMS, vol. 53(2), pages 263-280, April.
    4. Rafael Blanquero & Emilio Carrizosa & Amaya Nogales-Gómez & Frank Plastria, 2014. "Single-facility huff location problems on networks," Annals of Operations Research, Springer, vol. 222(1), pages 175-195, November.
    5. Nimrod Megiddo, 1981. "The Maximum Coverage Location Problem," Discussion Papers 490, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. O Berman & Z Drezner & D Krass, 2013. "Continuous covering and cooperative covering problems with a general decay function on networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(11), pages 1644-1653, November.
    7. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    8. ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
    9. Emilio Carrizosa & Frank Plastria, 2008. "Optimal Expected-Distance Separating Halfspace," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 662-677, August.
    10. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    11. Soo-Haeng Cho & Hoon Jang & Taesik Lee & John Turner, 2014. "Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning," Operations Research, INFORMS, vol. 62(4), pages 751-771, August.
    12. Rafael Blanquero & Emilio Carrizosa, 2013. "Solving the median problem with continuous demand on a network," Computational Optimization and Applications, Springer, vol. 56(3), pages 723-734, December.
    13. Gregory Dobson & Uday S. Karmarkar, 1987. "Competitive Location on a Network," Operations Research, INFORMS, vol. 35(4), pages 565-574, August.
    14. Galvao, Roberto Dieguez & ReVelle, Charles, 1996. "A Lagrangean heuristic for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 88(1), pages 114-123, January.
    15. Z Drezner & A Suzuki, 2010. "Covering continuous demand in the plane," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 878-881, 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. Huizhu Wang & Jianqin Zhou & Ling Zhou, 2024. "A Lattice Boltzmann Method-like Algorithm for the Maximal Covering Location Problem on the Complex Network: Application to Location of Railway Emergency-Rescue Spot," Mathematics, MDPI, vol. 12(2), pages 1-20, January.
    2. Huizhu Wang & Jianqin Zhou, 2023. "Location of Railway Emergency Rescue Spots Based on a Near-Full Covering Problem: From a Perspective of Diverse Scenarios," Sustainability, MDPI, vol. 15(8), pages 1-16, April.
    3. Pelegrín, Mercedes & Xu, Liding, 2023. "Continuous covering on networks: Improved mixed integer programming formulations," Omega, Elsevier, vol. 117(C).
    4. Wang, Wei & Wu, Shining & Wang, Shuaian & Zhen, Lu & Qu, Xiaobo, 2021. "Emergency facility location problems in logistics: Status and perspectives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    5. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).

    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. Cordeau, Jean-François & Furini, Fabio & Ljubić, Ivana, 2019. "Benders decomposition for very large scale partial set covering and maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 882-896.
    2. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    3. Peker, Meltem & Kara, Bahar Y., 2015. "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, Elsevier, vol. 54(C), pages 158-172.
    4. Kevin Curtin & Karen Hayslett-McCall & Fang Qiu, 2010. "Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models," Networks and Spatial Economics, Springer, vol. 10(1), pages 125-145, March.
    5. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    6. Stephanie A. Snyder & Robert G. Haight, 2016. "Application of the Maximal Covering Location Problem to Habitat Reserve Site Selection," International Regional Science Review, , vol. 39(1), pages 28-47, January.
    7. Carreras, Miquel & Serra, Daniel, 1999. "On optimal location with threshold requirements," Socio-Economic Planning Sciences, Elsevier, vol. 33(2), pages 91-103, June.
    8. Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka & Nogales-Gómez, Amaya, 2016. "p-facility Huff location problem on networks," European Journal of Operational Research, Elsevier, vol. 255(1), pages 34-42.
    9. Vatsa, Amit Kumar & Jayaswal, Sachin, 2016. "A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 251(2), pages 404-418.
    10. Boffey, Brian & Galvao, Roberto & Espejo, Luis, 2007. "A review of congestion models in the location of facilities with immobile servers," European Journal of Operational Research, Elsevier, vol. 178(3), pages 643-662, May.
    11. Dilek, Hande & Karaer, Özgen & Nadar, Emre, 2018. "Retail location competition under carbon penalty," European Journal of Operational Research, Elsevier, vol. 269(1), pages 146-158.
    12. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    13. Oded Berman & Dmitry Krass, 2005. "An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure," Annals of Operations Research, Springer, vol. 136(1), pages 21-34, April.
    14. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    15. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    16. Ting L. Lei & Richard L. Church, 2011. "Constructs for Multilevel Closest Assignment in Location Modeling," International Regional Science Review, , vol. 34(3), pages 339-367, July.
    17. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2017. "Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 60-77.
    18. Alexandris, George & Giannikos, Ioannis, 2010. "A new model for maximal coverage exploiting GIS capabilities," European Journal of Operational Research, Elsevier, vol. 202(2), pages 328-338, April.
    19. Sardar Ansari & Laura Albert McLay & Maria E. Mayorga, 2017. "A Maximum Expected Covering Problem for District Design," Transportation Science, INFORMS, vol. 51(1), pages 376-390, February.
    20. Eiselt, H.A. & Marianov, Vladimir, 2009. "Gradual location set covering with service quality," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 121-130, June.

    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:64:y:2016:i:c:p:77-85. 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.