The large-scale dynamic maximal covering location problem

Soheil Davari

doi:10.1016/j.mcm.2012.07.028

The large-scale dynamic maximal covering location problem

Soheil Davari

Hertfordshire Business School

Research output: Contribution to journal › Article › peer-review

43 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	710-719
Number of pages	10
Journal	Mathematical and Computer Modelling
Volume	57
Issue number	3-4
Early online date	25 Aug 2012
DOIs	https://doi.org/10.1016/j.mcm.2012.07.028
Publication status	Published - 1 Feb 2013

Access to Document

10.1016/j.mcm.2012.07.028Licence: Other

Cite this

@article{d86085659e9a40c6a7f09b58fb9db319,

title = "The large-scale dynamic maximal covering location problem",

abstract = "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.",

author = "Soheil Davari",

year = "2013",

month = feb,

day = "1",

doi = "10.1016/j.mcm.2012.07.028",

language = "English",

volume = "57",

pages = "710--719",

journal = "Mathematical and Computer Modelling",

issn = "0895-7177",

publisher = "Elsevier",

number = "3-4",

}

TY - JOUR

T1 - The large-scale dynamic maximal covering location problem

AU - Davari, Soheil

PY - 2013/2/1

Y1 - 2013/2/1

N2 - 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.

AB - 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.

U2 - 10.1016/j.mcm.2012.07.028

DO - 10.1016/j.mcm.2012.07.028

M3 - Article

SN - 0895-7177

VL - 57

SP - 710

EP - 719

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

IS - 3-4

ER -

The large-scale dynamic maximal covering location problem

Abstract

Access to Document

Fingerprint

Cite this