The large-scale dynamic maximal covering location problem

Autor:	Seyyed Ali Haddad Sisakht, Soheil Davari, Mohammad Hossein Fazel Zarandi
Rok vydání:	2013
Předmět:	Mathematical optimization Modeling and Simulation Modelling and Simulation Simulated annealing Combinatorial optimization Scale (descriptive set theory) Metaheuristic Facility location problem Mathematics Computer Science Applications
Zdroj:	Mathematical and Computer Modelling. 57(3-4):710-719
ISSN:	0895-7177
DOI:	10.1016/j.mcm.2012.07.028
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e32afad895a370e2cc498ab11dbfce9a Zobrazit plný text záznamu Full Text from ScienceDirect