A multi-objective formulation of maximal covering location problem with customers' preferences: Exploring Pareto optimality-based solutions. (30th December 2021)

• Record Type: Journal Article
• Authors: Atta, Soumen; Mahapatra, Priya Ranjan Sinha; Mukhopadhyay, Anirban
• Is Part Of: Expert systems with applications. Volume 186(2021)
• Publication Date: 2021-12-30
• Subjects: Maximal covering location problem (MCLP) -- Multi-objective MCLP -- Customers' preferences -- Multi-objective harmony search algorithm (MOHSA) -- NSGA II -- CPLEX; Expert systems (Computer science) -- Periodicals; Systèmes experts (Informatique) -- Périodiques; Electronic journals; 006.33
• DOI: 10.1016/j.eswa.2021.115830
• Languages: English
• ISSNs: 0957-4174

Abstract

Abstract: The maximal covering location problem (MCLP) is a well-known combinatorial optimization problem with several applications in emergency and military services as well as in public services. Traditionally, MCLP is a single objective problem where the objective is to maximize the sum of the demands of customers which are served by a fixed number of open facilities. In this article, a multi-objective MCLP is proposed where each customer has a preference for each facility. The multi-objective MCLP with customers' preferences (MOMCLPCP) deals with the opening of a fixed number of facilities from a given set of potential facility locations and then customers are assigned to these opened facilities such that both (i) the sum of the demands of customers and (ii) the sum of the preferences of the customers covered by these opened facilities are maximized. A Pareto-based multi-objective harmony search algorithm (MOHSA), which utilizes a harmony refinement strategy for faster convergence, is proposed to solve MOMCLPCP. The proposed MOHSA is terminated based on the stabilization of the density of non-dominated solutions. For experimental purposes, 82 new test instances of MOMCLPCP are generated from the existing single objective MCLP benchmark data sets. The performance of the proposed MOHSA is compared with the well-known non-dominated sorting genetic algorithm II (NSGA-II), and it has been observed that the proposed MOHSA always outperforms NSGA-II in terms of computation time. Moreover, statistical tests show that the objective values obtained from both algorithms are comparable. Highlights: A new multi-objective maximal covering location problem is proposed. Customers' preferences for different potential facility locations are considered. A Pareto optimality-based multi-objective harmony search algorithm is proposed. NSGA-II and CPLEX optimizer are used for performance comparisons.