Abstract
We propose a hybrid genetic algorithm for the hexagonal tortoise problem. We combined the genetic algorithm with an efficient local heuristic and aging mechanism. Another search heuristic which focuses on the space around existing solutions is also incorporated into the genetic algorithm. With the proposed algorithm, we could find the optimal solutions of up to a fairly large problem.
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.
Similar content being viewed by others
References
S. J. Choi. Gusuryak (a reprint). Shungshin Womens University Press, Seoul, Korea, 1983.
Y. H. Jun. Mysteries of mathematics: The order of the universe hidden in numbers. Dong-A Science, 14(7):68–77, 1999.
S. K. Lee, D. I. Seo, and B. R. Moon. A hybrid genetic algorithm for optimal hexagonal tortoise problem. In Genetic and Evolutionary Computation Conference, page 689, 2002.
D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms, volume 2, pages 109–126. Morgan Kaufmann, 1993.
J. Horn and D. E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In Foundations of Genetic Algorithms, volume 3, pages 243–270. Morgan Kaufmann, 1995.
T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Sixth International Conference on Genetic Algorithms, pages 184–192. Morgan Kaufmann, 1995.
E. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997.
F. Glover. Tabu search: Part I,. ORSA Journal of Computing, 3(1):190–206, 1977.
H. R. Lourenço, O. C. Martin, and T. Stützle. Iterated local search. In F. W. Glover and G. Kochenberger, editors, Handbook of Metaheuristic, chapter 11. Kluwer Academic Publisher, 2002.
O. Martin, S. W. Otto, and E. W. Felten. Large-step markov chains for the traveling salesman problem. Complex Systems, 5:299–326, 1991.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolutionary Programs. Springer, 1992.
A. Ghosh, S. Tsutsui, and T. Tanaka. Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals. In IEEE International Conference on Evolutionary Computation, pages 666–671, 1998.
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
Choe, H., Choi, SS., Moon, BR. (2003). A Hybrid Genetic Algorithm for the Hexagonal Tortoise Problem. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_98
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive