Repozitorij Univerze v Novi Gorici

Izpis gradiva
A+ | A- | Pomoč | SLO | ENG

Naslov:Solving maximal covering location problem using genetic algorithm with local refinement
Avtorji:ID Atta, Soumen, Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal 741235, India (Avtor)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal 741235, India (Avtor)
ID Mukhopadhyay, Anirban, Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal 741235, 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. Povezava se odpre v novem oknu
Jezik:Angleški jezik
Vrsta gradiva:Delo ni kategorizirano
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:UNG - Univerza v Novi Gorici
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
Leto izida:2018
Št. strani:3891-3906
Številčenje:12, 22
PID:20.500.12556/RUNG-8146 Novo okno
COBISS.SI-ID:149352195 Novo okno
DOI:https://doi.org/10.1007/s00500-017-2598-3 Novo okno
NUK URN:URN:SI:UNG:REP:AHSQ5RKB
Datum objave v RUNG:17.04.2023
Število ogledov:1025
Število prenosov:0
Metapodatki:XML RDF-CHPDL DC-XML DC-RDF
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Soft Computing
Skrajšan naslov:Soft Comput
Založnik:Springer
Leto izida:2018
ISSN:1433-7479

Nazaj