Abstract
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of introducing more sophisticated operator, a diploid system was designed to divide the task into two steps: in meiosis phase, crossover was used to break two haploid of same individual into small units and remix them thoroughly. Then better phenotype was rebuilt from diploid of zygote in development phase. We introduced a new representation for Hamiltonian Cycle Problem and implemented an algorithm to test the system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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
Xianghui, D., Ruwei, D. (2003). Study Diploid System by a Hamiltonian Cycle Problem Algorithm. 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_19
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_19
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