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

Zhou He, Bo Fan, Edwin Tai Chiu Cheng, Shou Yang Wang, Chin Hon Tan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

23 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)65-76
Number of pages12
JournalEuropean Journal of Operational Research
Issue number1
Publication statusPublished - 1 Apr 2016


  • Large scale optimization
  • Location
  • Mean shift
  • Planar maximal covering location problem

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'A mean-shift algorithm for large-scale planar maximal covering location problems'. Together they form a unique fingerprint.

Cite this