The large-scale dynamic maximal covering location problem

Zarandi, Mohammad Hossein Fazel, Davari, Soheil and Sisakht, Seyyed Ali Haddad 2013. The large-scale dynamic maximal covering location problem. Mathematical and Computer Modelling 57 (3-4) , pp. 710-719. 10.1016/j.mcm.2012.07.028

Full text not available from this repository.

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Elsevier
ISSN:	0895-7177
Last Modified:	20 Jul 2017 04:03
URI:	https://orca.cardiff.ac.uk/id/eprint/68528

Citation Data

Cited 51 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item