Genetic Algorithm Based Approaches to Install Different Types of Facilities
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.
KeywordsFacility Location Enclosing Problem Optimization Problem Genetic Algorithm
Unable to display preview. Download preview PDF.
- 1.Drezner, Z., Hamache, H.W.: Facility location: Applications and Theory. Springer, Heidelberg (2001) ISBN 3-540-21345-7Google Scholar
- 2.Sharir, M., Welz, E.: Rectilinear and Polygonal p-Piercing and p-Center Problems. In: Proceedings of the 12th Annual Symposium on Computational Geometry, pp. 122–132 (1999)Google Scholar
- 6.Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)Google Scholar
- 9.Bandyopadhyay, S., Pal, S.K.: Classification and Learning Using Genetic Algorithms: Applications in Bioinformatics and Web Intelligence. Springer, Heidelberg (2007)Google Scholar
- 10.Alt, H., Arkin, E.M., Bronnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey: Minimum-cost coverage of point sets by disks. In: Proceedings of the 22th Annual Symposium on Computational Geometry (SCG 2006), Sedona, Arizona, USA, pp. 449–458 (2006)Google Scholar