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.
CITATION STYLE
Atta, S., & Mahapatra, P. R. S. (2014). Genetic Algorithm Based Approaches to Install Different Types of Facilities. In Advances in Intelligent Systems and Computing (Vol. 248 VOLUME I, pp. 195–203). Springer Verlag. https://doi.org/10.1007/978-3-319-03107-1_23
Mendeley helps you to discover research relevant for your work.