| Title: | Genetic Algorithm Based Approach for Serving Maximum Number of Customers Using Limited Resources |
|---|
| Authors: | ID Atta, Soumen, Department of Computer Science & Engineering, University of Kalyani, Kalyani-741 235, India (Author)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science & Engineering, University of Kalyani, Kalyani-741 235, 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: | 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. |
|---|
| Keywords: | Maximal Covering Location Problem, Facility Location, Genetic Algorithm |
|---|
| Publication status: | Published |
|---|
| Year of publishing: | 2013 |
|---|
| Number of pages: | 492-497 |
|---|
| PID: | 20.500.12556/RUNG-8242 |
|---|
| COBISS.SI-ID: | 154452995 |
|---|
| DOI: | https://doi.org/10.1016/j.protcy.2013.12.387. |
|---|
| NUK URN: | URN:SI:UNG:REP:VW12VPIH |
|---|
| Publication date in RUNG: | 05.06.2023 |
|---|
| Views: | 1837 |
|---|
| 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. |
