Paper Info
Title
Solving maximal covering location problem using genetic algorithm with local refinement.
Abstract
The maximal covering location problem (MCLP) deals with the problem of finding an optimal placement of a given number of facilities within a set of customers. Each customer has a specific demand and the facilities are to be placed in such a way that the total demand of the customers served by the facilities is maximized. In this article an improved genetic algorithm (GA)-based approach, which utilizes a local refinement strategy for faster convergence, is proposed to solve MCLP. The proposed algorithm is applied on several MCLP instances from literature and it is demonstrated that the proposed GA with local refinement gives better results in terms of percentage of coverage and computation time to find the solutions in almost all the cases. The proposed GA-based approach with local refinement is also found to outperform the other existing methods for most of the small as well as large instances of MCLP.
Year
DOI
Venue
2018
10.1007/s00500-017-2598-3
Soft Comput.
Keywords
Field
DocType
Facility location problem, Covering location problem, Maximal covering location problem (MCLP), Genetic algorithm (GA), Local refinement
Convergence (routing),Mathematical optimization,Computer science,Algorithm,Facility location problem,Genetic algorithm,Computation
Journal
Volume
Issue
ISSN
22
12
1432-7643
Citations 
PageRank 
References 
3
0.41
14
Authors
3
Name
Order
Citations
PageRank
Soumen Atta171.82
Priya Ranjan210316.24
Anirban Mukhopadhyay371150.07