IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v250y2016i1p65-76.html
   My bibliography  Save this article

A mean-shift algorithm for large-scale planar maximal covering location problems

Author

Listed:
  • He, Zhou
  • Fan, Bo
  • Cheng, T.C.E.
  • Wang, Shou-Yang
  • Tan, Chin-Hon

Abstract

The planar maximal covering location problem (PMCLP) concerns the placement of a given number of facilities anywhere on a plane to maximize coverage. Solving PMCLP requires identifying a candidate locations set (CLS) on the plane before reducing it to the relatively simple maximal covering location problem (MCLP). The techniques for identifying the CLS have been mostly dominated by the well-known circle intersect points set (CIPS) method. In this paper we first review PMCLP, and then discuss the advantages and weaknesses of the CIPS approach. We then present a mean-shift based algorithm for treating large-scale PMCLPs, i.e., MSMC. We test the performance of MSMC against the CIPS approach on randomly generated data sets that vary in size and distribution pattern. The experimental results illustrate MSMC’s outstanding performance in tackling large-scale PMCLPs.

Suggested Citation

  • He, Zhou & Fan, Bo & Cheng, T.C.E. & Wang, Shou-Yang & Tan, Chin-Hon, 2016. "A mean-shift algorithm for large-scale planar maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 250(1), pages 65-76.
    • Handle: RePEc:eee:ejores:v:250:y:2016:i:1:p:65-76
    DOI: 10.1016/j.ejor.2015.09.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715008309
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.09.006?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. Younies, Hassan & Wesolowsky, George O., 2004. "A mixed integer formulation for maximal covering by inclined parallelograms," European Journal of Operational Research, Elsevier, vol. 159(1), pages 83-94, November.
    2. Matisziw, Timothy C. & Murray, Alan T., 2009. "Siting a facility in continuous space to maximize coverage of a region," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 131-139, June.
    3. Brian T. Downs & Jeffrey D. Camm, 1996. "An exact algorithm for the maximal covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 435-461, April.
    4. Schilling, David A. & Revelle, Charles & Cohon, Jared & Elzinga, D. Jack, 1980. "Some models for fire protection locational decisions," European Journal of Operational Research, Elsevier, vol. 5(1), pages 1-7, July.
    5. Luke Shillington & Daoqin Tong, 2011. "Maximizing Wireless Mesh Network Coverage," International Regional Science Review, , vol. 34(4), pages 419-437, October.
    6. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    7. Richard Church & Charles R. Velle, 1974. "The Maximal Covering Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 32(1), pages 101-118, January.
    8. David J. Eaton & Mark S. Daskin & Dennis Simmons & Bill Bulloch & Glen Jansma, 1985. "Determining Emergency Medical Service Vehicle Deployment in Austin, Texas," Interfaces, INFORMS, vol. 15(1), pages 96-108, February.
    9. Maged Dessouky & Fernando Ordóñez & Hongzhong Jia & Zhihong Shen, 2006. "Rapid Distribution of Medical Supplies," International Series in Operations Research & Management Science, in: Randolph W. Hall (ed.), Patient Flow: Reducing Delay in Healthcare Delivery, chapter 0, pages 309-338, Springer.
    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. Jiuping Xu & Lurong Fan & Chengwei Lv, 2017. "Equilibrium Strategy Based Recycling Facility Site Selection towards Mitigating Coal Gangue Contamination," Sustainability, MDPI, vol. 9(2), pages 1-27, February.
    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. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    4. Sadeghi, Mohammad & Yaghoubi, Saeed, 2024. "Optimization models for cloud seeding network design and operations," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1146-1167.
    5. Craparo, Emily M. & Fügenschuh, Armin & Hof, Christoph & Karatas, Mumtaz, 2019. "Optimizing source and receiver placement in multistatic sonar networks to monitor fixed targets," European Journal of Operational Research, Elsevier, vol. 272(3), pages 816-831.

    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. 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).
    2. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    3. James J. Cochran & Martin S. Levy & Jeffrey D. Camm, 2010. "Bayesian coverage optimization models," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 158-173, February.
    4. Murray, Alan T. & Feng, Xin, 2016. "Public street lighting service standard assessment and achievement," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 14-22.
    5. 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.
    6. 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.
    7. Wajid, Shayesta & Nezamuddin, N., 2023. "Capturing delays in response of emergency services in Delhi," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    8. Wajid, Shayesta & Nezamuddin, N., 2022. "A robust survival model for emergency medical services in Delhi, India," Socio-Economic Planning Sciences, Elsevier, vol. 83(C).
    9. Jeffrey D. Camm & Jeremy Christman & A. Narayanan, 2022. "Total Unduplicated Reach and Frequency Optimization at Procter & Gamble," Interfaces, INFORMS, vol. 52(2), pages 149-157, March.
    10. Jing Yao & Alan T. Murray, 2014. "Locational Effectiveness of Clinics Providing Sexual and Reproductive Health Services to Women in Rural Mozambique," International Regional Science Review, , vol. 37(2), pages 172-193, April.
    11. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    12. Li, Ran & Tong, Daoqin, 2017. "Incorporating activity space and trip chaining into facility siting for accessibility maximization," Socio-Economic Planning Sciences, Elsevier, vol. 60(C), pages 1-14.
    13. Shayesta Wajid & N. Nezamuddin, 2023. "Optimizing emergency services for road safety using a decomposition method: a case study of Delhi," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 155-173, March.
    14. Dmitrii Usanov & G.A. Guido Legemaate & Peter M. van de Ven & Rob D. van der Mei, 2019. "Fire truck relocation during major incidents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(2), pages 105-122, March.
    15. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    16. Brian T. Downs & Jeffrey D. Camm, 1996. "An exact algorithm for the maximal covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 435-461, April.
    17. N C Simpson & P G Hancock, 2009. "Fifty years of operational research and emergency response," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 126-139, May.
    18. Luo, Weicong & Yao, Jing & Mitchell, Richard & Zhang, Xiaoxiang & Li, Wenqiang, 2022. "Locating emergency medical services to reduce urban-rural inequalities," Socio-Economic Planning Sciences, Elsevier, vol. 84(C).
    19. 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.
    20. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, 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:ejores:v:250:y:2016:i:1:p:65-76. 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/locate/eor .

    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.