1. |
2. Multi-objective uncapacitated facility location problem with customers’ preferences: Pareto-based and weighted sum GA-based approachesSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2019, original scientific article Abstract: The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem having single-objective function. The objective of UFLP is to find a subset of facilities from a given set of potential facility locations such that the sum of the opening costs of the opened facilities and the service cost to serve all the customers is minimized. In traditional UFLP, customers are served by their nearest facilities. In this article, we have proposed a multi-objective UFLP where each customer has a preference for each facility. Hence, the objective of the multi-objective UFLP with customers’ preferences (MOUFLPCP) is to open a subset of facilities to serve all the customers such that the sum of the opening cost and service cost is minimized and the sum of the preferences is maximized. In this article, the elitist non-dominated sorting genetic algorithm II (NSGA-II), a popular Pareto-based GA, is employed to solve this problem. Moreover, a weighted sum genetic algorithm (WSGA)-based approach is proposed to solve MOUFLPCP where conflicting two objectives of the problem are aggregated to a single quality measure. For experimental purposes, new test instances of MOUFLPCP are created from the existing UFLP benchmark instances and the experimental results obtained using NSGA-II and WSGA-based approaches are demonstrated and compared for these newly created test instances. Keywords: Uncapacitated facility location problem (UFLP), Multi-objective UFLP with customers’ preferences (MOUFLPCP), NSGA-II, Weighted sum genetic algorithm (WSGA) Published in RUNG: 17.04.2023; Views: 383; Downloads: 0 This document has many files! More... |
3. A multi-objective formulation of maximal covering location problem with customers’ preferences: Exploring Pareto optimality-based solutionsSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2021, original scientific article 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 Published in RUNG: 17.04.2023; Views: 340; Downloads: 0 This document has many files! More... |