Abstract
Genetic Algorithms have been successfully applied to the function optimization problem. However, the main disadvantage of this technique is its large chromosome length and hence long conversion time specially when applied to functions with a large number of parameters. In this paper, a new chromosome representation scheme that reduces the chromosome length is proposed. The scheme is also domain independent and may be used with any function. Results and a comparison between the conventional chromosome representation and the proposed one are presented.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Manderick, B., de Weger, M., Spiessens, P.: The genetic algorithm and the structure of the fitness lanDScape. In: Proceedings of the Fourth International Conference on Genetic Algorithms, La Jolla, CA. Morgan Kaufmann, San Francisco (1991)
De Jong, K., Spears, W.: On the state of Evolutionary Computation. In: Proceedings of the 1993 International Conference on Genetic Algorithms, Urbana-Champaign, IL, pp. 618–623 (1993)
Harik, G., Lobo, F., Goldberg, D.: The Compact Genetic Algorithm, IlliGAL Report No. 97006 (August 1997)
Holland, J.H.: Adaptation in natural and artificial systems, 1st edn. MIT press, Cambridge (1975)
Shaefer, C.G.: The ARGOT strategy: adaptive representation genetic optimizer technique. In: Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Erlbaum, Cambridge (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baraka, H.A., Eid, S., Kamal, H., Abdel Wahab, A.H. (1999). Unified Chromosome Representation for Large Scale Problems. In: Imam, I., Kodratoff, Y., El-Dessouki, A., Ali, M. (eds) Multiple Approaches to Intelligent Systems. IEA/AIE 1999. Lecture Notes in Computer Science(), vol 1611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48765-4_80
Download citation
DOI: https://doi.org/10.1007/978-3-540-48765-4_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66076-7
Online ISBN: 978-3-540-48765-4
eBook Packages: Springer Book Archive