| Title: | A multi-objective formulation of maximal covering location problem with customers’ preferences: Exploring Pareto optimality-based solutions |
|---|
| Authors: | ID Atta, Soumen, Laboratoire des Sciences du Numérique de Nantes (LS2N), UMR 6004, UFR Sciences et Techniques, Université de Nantes, IMT Atlantique, 4 Rue Alfred Kastler, Nantes 44307, France (Author)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Kalyani 741235, West Bengal, India (Author)
ID Mukhopadhyay, Anirban, Department of Computer Science and Engineering, University of Kalyani, Kalyani 741235, West Bengal, India (Author) |
|---|
| Files: |
This document has no files that are freely available to the public. This document may have a physical copy in the library of the organization, check the status via COBISS.  |
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | UNG - University of Nova Gorica
|
|---|
| 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. |
|---|
| Keywords: | Maximal covering location problem (MCLP), Multi-objective MCLP, Customers’ preferences, Multi-objective harmony search algorithm (MOHSA), NSGA II, CPLEX |
|---|
| Publication version: | Version of Record |
|---|
| Year of publishing: | 2021 |
|---|
| Number of pages: | 115830 |
|---|
| Numbering: | December, 186 |
|---|
| PID: | 20.500.12556/RUNG-8137 |
|---|
| COBISS.SI-ID: | 149312003 |
|---|
| DOI: | https://doi.org/10.1016/j.eswa.2021.115830 |
|---|
| NUK URN: | URN:SI:UNG:REP:GRAT26NE |
|---|
| Publication date in RUNG: | 17.04.2023 |
|---|
| Views: | 1649 |
|---|
| Downloads: | 0 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
