Abstract
In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the classical p-median problem indicate that our method is superior and very close to the optimal solution.
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
References
Kelly D. Crawford, Cory J. Hoelting, Roger L. Wainwright, and Dale A. Schoenefeld. A study of fixed-length subset recombination. In Richard K. Belew and Michael D. Vose, editors, Foundations of Genetic Algorithms 4, pages 365–378. Morgan Kaufmann, San Francisco, CA, 1997.
Alp O., Z. Drezner, and E. Erkut. An efficient genetic algorithm for the p-median problem. Annals of Operations Research, 2003. forthcoming.
Nicholas J. Radcliffe. Genetic set recombination. In Foundations of Genetic Algorithms 2, San Mateo, CA, 1993. Morgan Kaufmann Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, A., Xu, Z. (2003). A Fixed-Length Subset Genetic Algorithm for the p-Median Problem. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_42
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive