1. Genetic Algorithm Based Approach for Serving Maximum Number of Customers Using Limited ResourcesSoumen Atta, Priya Ranjan Sinha Mahapatra, 2013, izvirni znanstveni članek Opis: It is often needed to install limited number of facilities to address the demand of customers due to resource constraints and thus the requirement to provide service to all customers is not possible to meet. In such situation, the facilities are installed (placed) so that the maximum demand can be met. The problem of installing (locating) such facilities are known as Maximal Covering Location Problem (MCLP) [2] in facility location [1]. We assume that (i) all facilities are in a plane, and (ii) all customers can be considered as a point set on the same plane. The type of covering area (or range) of a facility depends on the facility to be installed. We consider the MCLP where the covering area (or range) of each facility is the area of a square with fixed size. In other words here, each facility is installed at the center of the square. The problem considered in this article is defined as follows: given a set P of n input points (customers) on the plane and k squares (facilities) each of fixed size, the objective is to find a placement of k squares so that the union of k axis parallel squares covers (contains) the maximum numbers of input points where k (1≤k≤n) is a positive integer constant. This problem is known to be NP-hard [5]. We have proposed a genetic algorithm (GA) to solve this problem. Ključne besede: Maximal Covering Location Problem, Facility Location, Genetic Algorithm Objavljeno v RUNG: 05.06.2023; Ogledov: 335; Prenosov: 0 Gradivo ima več datotek! Več... |
2. Genetic Algorithm Based Approaches to Install Different Types of FacilitiesSoumen Atta, Priya Ranjan Sinha Mahapatra, 2014, objavljeni znanstveni prispevek na konferenci Opis: Given a set P of n-points (customers) on the plane and a positive integer k (1 ≤ k ≤ n), the objective is to find a placement of k circles (facilities) such that the union of k circles contains all the points of P and the sum of the radii of the circles is minimized. We have proposed a Genetic Algorithm (GA) to solve this problem. In this context, we have also proposed two different algorithms for k=1 and 2. Finally, we have proposed a GA to solve another optimization problem to compute a placement of fixed number of facilities where the facilities are hazardous in nature and the range of each such facility is circular. Ključne besede: Facility Location, Enclosing Problem, Optimization Problem, Genetic Algorithm Objavljeno v RUNG: 05.06.2023; Ogledov: 340; Prenosov: 0 Gradivo ima več datotek! Več... |
3. |
4. Solving uncapacitated facility location problem using heuristic algorithmsSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2019, izvirni znanstveni članek Opis: A well-known combinatorial optimization problem, known as the uncapacitated facility location problem (UFLP) is considered in this article. A deterministic heuristic algorithm and a randomized heuristic algorithm are presented to solve UFLP. Though the proposed deterministic heuristic algorithm is very simple, it produces good solution for each instance of UFLP considered in this article. The main purpose of this article is to process all the data sets of UFLP available in the literature using a single algorithm. The proposed two algorithms are applied on these test instances of UFLP to determine their effectiveness. Here, the solution obtained from the proposed randomized algorithm is at least as good as the solution produced by the proposed deterministic algorithm. Hence, the proposed deterministic algorithm gives upper bound on the solution produced by the randomized algorithm. Although the proposed deterministic algorithm gives optimal results for most of the instances of UFLP, the randomized algorithm achieves optimal results for all the instances of UFLP considered in this article including those for which the deterministic algorithm fails to achieve the optimal solutions. Ključne besede: Uncapacitated Facility Location Problem (UFLP), Simple Plant Location Problem (SPLP), Warehouse Location Problem (WLP), Heuristics, Randomization Objavljeno v RUNG: 17.04.2023; Ogledov: 339; Prenosov: 0 Gradivo ima več datotek! Več... |
5. Solving maximal covering location problem using genetic algorithm with local refinementSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2018, izvirni znanstveni članek Opis: 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. Ključne besede: Facility location problem, Covering location problem, Maximal covering location problem (MCLP), Genetic algorithm (GA), Local refinement Objavljeno v RUNG: 17.04.2023; Ogledov: 318; Prenosov: 0 Gradivo ima več datotek! Več... |
6. 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, izvirni znanstveni članek Opis: 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. Ključne besede: Uncapacitated facility location problem (UFLP), Multi-objective UFLP with customers’ preferences (MOUFLPCP), NSGA-II, Weighted sum genetic algorithm (WSGA) Objavljeno v RUNG: 17.04.2023; Ogledov: 376; Prenosov: 0 Gradivo ima več datotek! Več... |
7. Deterministic and randomized heuristic algorithms for uncapacitated facility location problemSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2018, objavljeni znanstveni prispevek na konferenci Opis: A well-known combinatorial optimization problem, known as the Uncapacitated Facility Location Problem (UFLP) is considered in this paper. Given a set of customers and a set of potential facilities, the objective of UFLP is to open a subset of the potential facilities such that sum of the opening cost for opened facilities and the service cost of customers is minimized. In this paper, deterministic and randomized heuristic algorithms are presented to solve UFLP. The effectivenesses of the proposed algorithms are tested on UFLP instances taken from the OR-Library. Although the proposed deterministic algorithm gives optimal results for most of the instances, the randomized algorithm achieves optimal results for all the instances of UFLP considered in this paper including those for which the deterministic algorithm fails to achieve the optimal solutions. Ključne besede: Uncapacitated facility location problem (UFLP), Simple plant location problem (SPLP), Warehouse location problem (WLP), Heuristics Randomization Objavljeno v RUNG: 17.04.2023; Ogledov: 358; Prenosov: 0 Gradivo ima več datotek! Več... |
8. Solving uncapacitated facility location problem using monkey algorithmSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2018, objavljeni znanstveni prispevek na konferenci Opis: The Uncapacitated Facility Location Problem (UFLP) is considered in this paper. Given a set of customers and a set of potential facility locations, the objective of UFLP is to open a subset of facilities to satisfy the demands of all the customers such that the sum of the opening cost for the opened facilities and the service cost is minimized. UFLP is a well-known combinatorial optimization problem which is also NP-hard. So, a metaheuristic algorithm for solving this problem is natural choice. In this paper, a relatively new swarm intelligence-based algorithm known as the Monkey Algorithm (MA) is applied to solve UFLP. To validate the efficiency of the proposed binary MA-based algorithm, experiments are carried out with various data instances of UFLP taken from the OR-Library and the results are compared with those of the Firefly Algorithm (FA) and the Artificial Bee Colony (ABC) algorithm. Ključne besede: Uncapacitated Facility Location Problem (UFLP), Simple Plant Location Problem (SPLP), Warehouse Location Problem (WLP), Monkey Algorithm Objavljeno v RUNG: 17.04.2023; Ogledov: 380; Prenosov: 0 Gradivo ima več datotek! Več... |
9. Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approachSoumen Atta, Goutam Sen, 2020, izvirni znanstveni članek Opis: In video-on-demand (VoD) services, large volumes of digital data are kept at hubs which are spatially distributed over large geographic areas and users are connected to these hubs based on their demands. In this article, we consider a large database of video files, that are pre-partitioned to multiple segments based on the demand patterns of users. These segments are restricted to be located only in hubs. Here, users are allowed to be allocated to multiple hubs and all hubs are assumed to be connected with each other. We jointly decide the location of hubs, the placement of segments to these hubs and then the assignment of users to these hubs as per their demand patterns and finally, we find the optimal paths to route the demands of users for different segments having the objective of minimizing the total routing cost. In this article, a differential evolution (DE) based method is proposed to solve the problem. The proposed DE-based method utilizes an efficient function to evaluate the objective value of a candidate solution to the proposed problem. It also incorporates two problem-specific solution refinement techniques for faster convergence. Instances of the problem are generated from the real world movie database and the proposed method is applied to these instances and the performance is evaluated against the benchmark results obtained from CPLEX. Ključne besede: Video-on-demand (VoD) services, Content distribution networks, Database segment location, Hub location, Multiple hub allocation, Differential evolution (DE), IBM ILOG CPLEX Objavljeno v RUNG: 17.04.2023; Ogledov: 377; Prenosov: 0 Gradivo ima več datotek! Več... |
10. A new variant of the p-hub location problem with a ring backbone network for content placement in VoD servicesSoumen Atta, Goutam Sen, 2021, izvirni znanstveni članek Opis: In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allocated only to a single hub, and here hubs form a ring backbone network. SApHLP jointly addresses (i) the locations of hubs, (ii) the placement of segments to hubs, (iii) the allocation of users to hubs as per their demands, and (iv) the optimal paths to route the demands from users to hubs. We have introduced network flow-based 3-subscripted and path-based 4-subscripted MILP formulations of SApHLP. This article presents a novel discrete particle swarm optimization (PSO)-based approach where factoradic numbers are used to encode solution. It also incorporates three problem-specific solution refinement methods for faster convergence. In this article, SApHLP instances are generated from a real-world database of video files obtained from a movie recommender system. The benchmark solutions are generated using IBM’s CPLEX optimizer with default settings and Benders decomposition strategy. The performance of the proposed PSO is compared with the benchmark results produced by CPLEX. Ključne besede: Single allocation p-hub location problem, Ring backbone network, VoD services, Particle Swarm Optimization (PSO), Factoradics, CPLEX Objavljeno v RUNG: 17.04.2023; Ogledov: 325; Prenosov: 0 Gradivo ima več datotek! Več... |