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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Drezner, Z., Hamache, H.W.: Facility location: Applications and Theory. Springer, Heidelberg (2001) ISBN 3-540-21345-7
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)
Mukherjee, M., Chakraborty, K.: A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. Information Processing Letters 83, 41–48 (2002)
Kennington, J., Olinick, E., Rajan, D.: Wireless Network Design: Optimization Models and Solution Procedures. Springer, New York (2011)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, New York (1989)
Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
Bandyopadhyay, S., Maulik, U.: Nonparametric genetic clustering: Comparison validity indices. IEEE Transactions on Systems, Man and Cybernetics, Part C 31, 120–125 (2001)
Bandyopadhyay, S., Maulik, U.: Genetic Clustering for Automatic Evolution of Clusters and Application to Image Classification. Pattern Recognition 35, 1197–1208 (2002)
Bandyopadhyay, S., Pal, S.K.: Classification and Learning Using Genetic Algorithms: Applications in Bioinformatics and Web Intelligence. Springer, Heidelberg (2007)
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)
Abravaya, S., Segal, M.: Maximizing the number of obnoxious facilities to locate within a bounded region. Computers & Operations Research 37, 163–171 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Atta, S., Mahapatra, P.R.S. (2014). Genetic Algorithm Based Approaches to Install Different Types of Facilities. In: Satapathy, S., Avadhani, P., Udgata, S., Lakshminarayana, S. (eds) ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I. Advances in Intelligent Systems and Computing, vol 248. Springer, Cham. https://doi.org/10.1007/978-3-319-03107-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-03107-1_23
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03106-4
Online ISBN: 978-3-319-03107-1
eBook Packages: EngineeringEngineering (R0)