Genetic algorithm based approaches to install different types of facilities

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

Povzetek

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;

Podatki

Jezik:	Angleški jezik
Leto izida:	2014
Tipologija:	1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija:	UNG - Univerza v Novi Gorici
UDK:	004
COBISS:	154445315
Št. ogledov:	48
Št. prenosov:	0
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

URN:	URN:SI:UNG
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	Str. 195-203
DOI:	https://doi.org/10.1007/978-3-319-03107-1_23
ID:	19159996