Journal
MATHEMATICAL AND COMPUTER MODELLING
Volume 57, Issue 3-4, Pages 710-719Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mcm.2012.07.028
Keywords
Combinatorial optimization; Facility location; Logistics; Metaheuristics; Simulated annealing
Ask authors/readers for more resources
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. (C) 2012 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available