| Naslov: | Genetic Algorithm Based Approach for Serving Maximum Number of Customers Using Limited Resources |
|---|
| Avtorji: | ID Atta, Soumen, Department of Computer Science & Engineering, University of Kalyani, Kalyani-741 235, India (Avtor)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science & Engineering, University of Kalyani, Kalyani-741 235, India (Avtor) |
|---|
| Datoteke: |
Gradivo nima datotek, ki so prostodostopne za javnost. Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u.  |
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Delo ni kategorizirano |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | UNG - Univerza v Novi Gorici
|
|---|
| 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 |
|---|
| Status publikacije: | Objavljeno |
|---|
| Leto izida: | 2013 |
|---|
| Št. strani: | 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 |
|---|
| Datum objave v RUNG: | 05.06.2023 |
|---|
| Število ogledov: | 1838 |
|---|
| Število prenosov: | 0 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
