Abstract
This paper deals with a continuous space problem in which demand centers are independently served from a given number of independent, uncapacitated supply centers. Installation costs are assumed not to depend on either the actual location or actual throughput of the supply centers. Transportation costs are considered to be proportional to the square Euclidean distance travelled and a mini-sum criteria is adopted. In order to solve this location problem, a new heuristic method, called Vibrational Genetic Algorithm (VGA), is applied. VGA assures efficient diversity in the population and consequently provides faster solution. We used VGA using vibrational mutation and for the mutational manner, a wave with random amplitude is introduced into population periodically, beginning with the initial step of the genetic process. This operation spreads out the population over the design space and increases exploration performance of the genetic process. This makes passing over local optimums for genetic algorithm easy. Since the problem is recognized as identical to certain cluster analysis and vector quantization problems, we also applied Kohonen maps which are Artificial Neural Networks (ANN) capable of extracting the main features of the input data through a selforganizing process based on local adaptation rules. The numerical results and comparison will be presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer-Verlag, Berlin Heidelberg New York (2002) 37–81
Reeves, C.R.: Genetic Algorithms in Modern Heuristic Techniques for Combibatorial Problems. Wiley, New York (1993) 151–196
Hacioglu, A., Özkol, I.: Vibrational Genetic Algorithm As a New Concept in Airfoil Design. Aircraft Eng. and Aerospace Technology, Vol 3 (2002)
Okabe, A., Boots, B., Sugihara, K.: Spatial Tesellations: Concepts and Applications of Voronoi Diagrams. Wiley, Chichester (1992)
Erkut, E., Öncü, T.: A parametric 1-maximin Location Problem. Journal of the Operational Research Society, Vol. 42 (1991) 49–55
Carrizosa, E., Munoz, M., Puerto, J.: On the Set of Optimal Points to the Weighted maximin Problem. Studies in Locational Analysis, Vol.7 (1995) 21–33
Drezner, Z., Wesolowsky, G.: Minimax and maximin Facility Location Problems on a Sphere. Naval Research Logistics Quarterly, Vol. 30 (1983) 305–312
Appa, G., Giannikos, I.: Is Linear Programming Necessary for Single Facility Location with maximin of Rectlinear Distance? Journal of the Operational Research Society, Vol. 45 (1994) 97–107
Liu, C-M., Kao, R-L., Wang, A-H.: Solving Location-Allocation Problems with Rectlinear Distances by Simulated Annealing. Journal of the Operational Research Society, Vol. 45 (1994) 1304–1315
Abdinnour-Helm, S.: A Hybrid Heuristic for the Uncapacitated Hub Location Problem. European Journal of Operational Research, Vol. 106 (1998) 489–499
Obayashi, S., Takanashi, S., Takeguchi, Y.: Niching and Elitist Model for MOGAs. Paralel Problem Solving from Nature-PPSN V, Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg New York 260–269.
Baker, J.E.:Reducing Bias and Inefficiency in the Selection Algorithm. Proceedings of the Second International Conference on Genetic Algorithms, Morgan Kaufman Publishers (1987) 14–21
Eshelman, L.J., Schaffer, J.D.: Real Coded Genetic Algorithms and Interval Schema. Foundations of Genetic Algorithms 2, Morgan Kaufman Publishers (1993) 187–202
Lazano, F., Guerrero, F., Onieva, L., Larraneta, J.: Kohonen Maps for Solving A Class of Location-Allocation Problems. European Journal of Operations Research, Vol.108 (1998)106–117
Sefrioui, M., Periaux, J.: Genetic Algorithms, Game Theory and Hierarchical Models: Some Theoretical Backgrounds Part I: Real Coded GA,von Karman Institute for Fluid Dynamics Lecture Series 2000-07
Ernst, A.T. and Krishnamoorthy, M.: Efficient Algorithms for the UncapacitatedSingle Allocation p-hub median problem. Location Science, 139–154
Beasley, J.E., OR-Library: Distributing Test Problems by Electronic Mail, Journal of the Operational Research Vol. 41 (1990) 1069–1072
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ermis, M., Ülengin, F., Hacioglu, A. (2002). Vibrational Genetic Algorithm (Vga) for Solving Continuous Covering Location Problems. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_30
Download citation
DOI: https://doi.org/10.1007/3-540-36077-8_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00009-9
Online ISBN: 978-3-540-36077-3
eBook Packages: Springer Book Archive