1. An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problemSoumen Atta, 2023, izvirni znanstveni članek Opis: In this article, an improved harmony search algorithm (IHSA) that utilizes opposition-based learning is presented for solving the maximal covering location problem (MCLP). The MCLP is a well-known facility location problem where a fixed number of facilities are opened at a given potential set of facility locations such that the sum of the demands of customers covered by the open facilities is maximized. Here, the performance of the harmony search algorithm (HSA) is improved by incorporating opposition-based learning that utilizes opposite, quasi-opposite and quasi-reflected numbers. Moreover, a local search heuristic is used to improve the performance of the HSA further. The proposed IHSA is employed to solve 83 real-world MCLP instances. The performance of the IHSA is compared with a Lagrangean/surrogate relaxation-based heuristic, a customized genetic algorithm with local refinement, and an improved chemical reaction optimization-based algorithm. The proposed IHSA is found to perform well in solving the MCLP instances. Ključne besede: maximal covering location problem, harmony search algorithm, opposition-based learning, facility location problem, opposite number Objavljeno v RUNG: 05.10.2023; Ogledov: 1022; Prenosov: 7 Celotno besedilo (2,69 MB) Gradivo ima več datotek! Več... |
2. |
3. 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: 1004; Prenosov: 0 Gradivo ima več datotek! Več... |
4. |
5. 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: 1062; Prenosov: 0 Gradivo ima več datotek! Več... |
6. Power-aware Traffic Grooming in WDM Optical Mesh Networks for Bandwidth Wastage Minimization: A Genetic Algorithm-based ApproachSoumen Atta, Anirban Mukhopadhyay, 2012, objavljeni znanstveni prispevek na konferenci Opis: The cost of optical backbone network has increased nowadays. So we need to reduce this cost. One of the major contributory costs is the power consumed by the underlying network. Power may also be consumed by different network equipments viz. add-drop multiplexers (ADM), Network Interface Device (NID), Optical Network Terminal (ONT), electrical-to-optical-to-electrical (EOE) conversion etc. In this article we have only considered the power consumption by EOE conversion in a mesh network. We have proposed a genetic algorithm to minimize the EOE conversions needed for a mesh network to satisfy all the traffic requests for a given physical topology. We have also considered the amount of wavelength wastages for our solution and we have minimized these wastages below a user given value. The results have been demonstrated on two optical mesh networks. Ključne besede: Optical Network, WDM, Traffic Grooming, Network Components, Green Optical Network, Genetic Algorithm Objavljeno v RUNG: 05.06.2023; Ogledov: 1101; Prenosov: 0 Gradivo ima več datotek! Več... |
7. Solving tool indexing problem using harmony search algorithm with harmony refinementSoumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2019, izvirni znanstveni članek Opis: The tool indexing problem (TIP) is the problem of allocating cutting tools to different slots in a tool magazine of Computer Numerically Controlled machine to reduce the processing time of jobs on the machine. This is one of the mostly encountered optimization problems in manufacturing systems. In TIP, the number of tools used by the machine is at most the number of slots available in the tool magazine. In this article, a customized harmony search (HS) algorithm, which utilizes a harmony refinement strategy for faster convergence, is presented to solve TIP. The harmony refinement method also helps to avoid getting stuck into local optima. The performance of the proposed method is tested on 27 instances taken from the literature and out of these it is found to improve the best known solutions for 16 instances. For the remaining instances, it gives the same results as found in the literature. Moreover, the performance of the proposed algorithm is tested on newly adapted 41 instances and for some of these instances the results obtained using the proposed algorithm are compared with that obtained using CPLEX. Ključne besede: Tool indexing problem (TIP), Computer Numerically Controlled (CNC) machine, Harmony search (HS) algorithm, Automatic tool changer (ATC), CPLEX Objavljeno v RUNG: 17.04.2023; Ogledov: 1096; Prenosov: 0 Gradivo ima več datotek! Več... |
8. 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: 1022; Prenosov: 0 Gradivo ima več datotek! Več... |
9. 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: 1113; Prenosov: 0 Gradivo ima več datotek! Več... |
10. Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular networkSoumen Atta, Priya Ranjan Sinha Mahapatra, 2018, izvirni znanstveni članek Opis: In cellular network short term demand fluctuation is a very common phenomenon. The demand of any cell may increase or decrease slightly or the system may expand by adding additional cells or the system may shrink if the demands of certain number of cells become zero. In this paper, the perturbation-minimising frequency assignment problem (PMFAP) is considered to address the short term fluctuation in demand vector. PMFAP is a frequency assignment problem in which newly generated demands are satisfied with minimum changes in the already existing frequency assignment keeping all the interference constraints. In this paper, an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. With a slight modification to the proposed algorithm, it can solve the well-known frequency assignment problem (FAP) and its performance is also compared with the existing results using the standard benchmark data sets for FAP. Ključne besede: short term demand fluctuation, frequency assignment problem, FAP, PMFAP, cellular network, perturbation, heuristic algorithm Objavljeno v RUNG: 17.04.2023; Ogledov: 959; Prenosov: 0 Gradivo ima več datotek! Več... |