The large-scale dynamic maximal covering location problem

Soheil Davari

Research output: Contribution to journalArticlepeer-review

43 Citations (Scopus)


Most of the publications regarding the maximal covering location problem (MCLP) address the case where the decision is to be made for one period. In this paper, we deal with a rather untouched version of MCLP which is called dynamic MCLP (DMCLP). In order to solve this problem, a simulated annealing (SA) has been presented. The proposed solution algorithm is capable of solving problems with up to 2500 demand nodes and 200 potential facilities with a fair amount of exactness. Our experiments showed that the proposed approach finds solutions with errors less than one percent.
Original languageEnglish
Pages (from-to)710-719
Number of pages10
JournalMathematical and Computer Modelling
Issue number3-4
Early online date25 Aug 2012
Publication statusPublished - 1 Feb 2013


Dive into the research topics of 'The large-scale dynamic maximal covering location problem'. Together they form a unique fingerprint.

Cite this