Solving maximal covering location problem using chemical reaction optimization

Abstract

The Maximal covering location problem (MCLP) works with a given number of nodes in a network, each node has a demand value and is provided with a fixed number of facilities. Here the target is to maximize the total demands within some constraints. In this article, we have proposed a metaheuristic algorithm based on chemical reaction optimization to solve this problem. We have used two data sets to measure the performance of our proposed method. The proposed method gives better results in almost all the test cases in terms of percentage of coverage as well as computational time.