Solving maximal covering location problem using genetic algorithm with local refinement

Soumen Atta (Avtor), Priya Ranjan Sinha Mahapatra (Avtor), Anirban Mukhopadhyay (Avtor)

Povzetek

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;genetic algorithm;local refinement;

Podatki

Jezik:	Angleški jezik
Leto izida:	2018
Tipologija:	1.01 - Izvirni znanstveni članek
Organizacija:	UNG - Univerza v Novi Gorici
UDK:	004
COBISS:	149352195
ISSN:	1432-7643
Št. ogledov:	106
Št. prenosov:	0
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

URN:	URN:SI:UNG
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	str. 3891-3906
Letnik:	ǂVol. ǂ22
Zvezek:	ǂissue ǂ12
Čas izdaje:	2018
DOI:	10.1007/s00500-017-2598-3
ID:	18625130