Abstract
This paper presents an evolutionary coding method that maps genotype to phenotype in a genetic algorithm. Unlike traditional genetic algorithms, the proposed algorithm involves mating and reproduction of cells that have multiple chromosomes instead of single chromosomes. The algorithm also evolves the mapping from genotype to phenotype rather than using a fixed mapping that is associated with one particular encoding method. The genotype-to-phenotype mapping is conjectured to explicitly capture important schema information. Some empirical results are presented to demonstrate the efficacy of the algorithm with some GA-Hard problems.
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
Whitley, L.D.: Fundamental principles of deception in genetic search. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms, pp. 221–241. Morgan Kaufmann, San Mateo (1991)
Goldberg, D.: Genetic Algorithms and Walsh Functions: Part II, Deception and its Analysis. Complex Systems 3, 153–171 (1989)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Mathias, K., Whitley, L.D.: Transforming the search space with gray coding. In: Proc. IEEE Int’l Conference on Evolutionary Computation, pp. 513–518 (1994)
Yokose, Y., Cingoski, V., Kaneda, K., Yamashita, H.: Performance Comparison Between Gray Coded and Binary Coded Genetic Algorithms for Inverse Shape Optimization of Magnetic Devices. Applied Electromagnetics, 115–120 (2000)
Wolfram, Gray Code, http://mathworld.wolfram.com/GrayCode.html
Goldberg, D.: Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction. Complex Systems 3, 129–152 (1989)
Goldberg, D., Bridges, C.: An Analysis of a Reordering Operator on a GA-Hard Problem. Biological Cybernetics 62, 397–405 (1990)
Dasgupta, D.: Handling deceptive problems using a different genetic search. In: Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 807–811 (1994)
Shackleton, M., Shipman, R., Ebner, M.: An investigation of redundant genotypephenotype mappings and their role in evolutionary search. In: Proceedings of Congress on Evolutionary Computation, pp. 493–500 (2000)
Whitley, D., Rana, S., Heckendorn, R.B.: Exploiting Separability in Search: The Island Model Genetic Algorithm. Journal of Computing and Information Technology 7(1), 33–47 (1999); Special Issue on Evolutionary Computing
Sehitoglu, O.T., Ucoluk, G.: A building block favoring reordering method for gene positions in genetic algorithms. In: Spector, L., Goodman, E.D., Wu, A., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 571–575 (2001)
De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. Thesis, University of Michigan (1975)
Digalakis, J., Konstantinos, M.: An Experimental study of Benchmarking Functions for Evolutionary Algorithms. International Journal of Computer Mathemathics 79, 403–416 (2002)
Salomon, R.: Reevaluating Genetic Algorithm Performance under Coordinate Rotation of Benchmark Functions. BioSystems 39, 263–278 (1995)
Collard, P., Aurand, J.-P.: DGA: an efficient Genetic Algorithm. In: Proceedings of the 11th European Conference on Artificial Intelligence (ECAI 1994), pp. 487–492 (1994)
Collard, P., Clergue, M., Defoin, P.M.: Artificial Evolution. In: Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M., Ronald, E. (eds.) AE 1999. LNCS, vol. 1829, pp. 254–265. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chow, R. (2004). Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive