Genetic algorithm based approaches to install different types of facilities

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

Abstract

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.

Keywords

facility location;enclosing problem;optimization problem;genetic algorithm;

Data

Language:	English
Year of publishing:	2014
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	UNG - University of Nova Gorica
UDC:	004
COBISS:	154445315
Views:	48
Downloads:	0
Average score:	0 (0 votes)
Metadata:

Other data

URN:	URN:SI:UNG
Type (COBISS):	Not categorized
Pages:	Str. 195-203
DOI:	https://doi.org/10.1007/978-3-319-03107-1_23
ID:	19159996