Loading...

The large scale maximal covering location problem

Fazel Zarandi, M. H ; Sharif University of Technology | 2011

866 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.scient.2011.11.008
  3. Publisher: 2011
  4. Abstract:
  5. The maximal covering location problem (MCLP) is a challenging problem with numerous applications in practice. Previous publications in the area of MCLP proposed models and presented solution methodologies to solve this problem with up to 900 nodes. Due to the fact that in real-life applications, the number of nodes could be much higher, this paper presents a customized Genetic Algorithm (GA) to solve MCLP instances, with up to 2500 nodes. Results show that the proposed approach is capable of solving problems with a fair amount of exactness. In order to fine-tune the algorithm, Tukey's Least Significant Difference (LSD) tests are employed on a set of test problems
  6. Keywords:
  7. Genetic algorithm ; Maximal covering location problem (MCLP) ; Metaheuristics ; Customized genetic algorithm ; Least significant differences ; Real-life applications ; Solution methodology ; Test problem ; Analysis of variance (ANOVA) ; Location ; Problem solving ; Facility location ; Location decision ; Numerical method ; Optimization ; Variance analysis
  8. Source: Scientia Iranica ; Volume 18, Issue 6 , December , 2011 , Pages 1564-1570 ; 10263098 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S1026309811002100