The large-scale dynamic maximal covering location problem

Zarandi, M. H. F ; Sharif University of Technology | 2013

230 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.mcm.2012.07.028
  3. Publisher: 2013
  4. Abstract:
  5. Most of the publications regarding the maxim 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
  6. Keywords:
  7. Facility location ; Demand node ; Facility locations ; Large-scale dynamics ; Maximal covering location problems ; Meta heuristics ; Solution algorithms ; Combinatorial optimization ; Logistics ; Simulated annealing ; Tracking (position)
  8. Source: Mathematical and Computer Modelling ; Volume 57, Issue 3-4 , February , 2013 , Pages 710-719 ; 08957177 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0895717712002191