Multi-chromosomal representations and chromosome shuffling in evolutionary algorithms

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 2, Issue , 2003, Pages 1145-1149

  Mayer, Helmut A ^a   Spitzlinger, Markus ^a  

^a UNIVERSITY OF SALZBURG   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS;

DEGREE OF COMPLEXITY; GENETIC OPERATORS; MULTI-CHROMOSOMAL REPRESENTATION; MULTIPLE CHROMOSOMES; TEST FUNCTIONS;

CHROMOSOMES;

EID: 27144434272     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299797     Document Type: Conference Paper

References (14)

1. Desai, R. and Patil, R. (1996). SALO: Combining simulated annealing and local optimization for efficient global optimization.
2. Digalakis, J. and Margaritis, K. (2002). An experimental study of benchmarking functions for evolutionary algorithms. International Journal of Computer Mathematics, 79(4):403-416.
3. Fogel, D. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York.
4. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley.
5. Gordon, V. S. and Whitley, D. (1993). Serial and parallel genetic algorithms as function optimizers. In Forrest, S., editor, Proceedings of the Fifth Internationa! Conference on Genetic Algorithms, pages 177-183, San Mateo, CA. Morgan Kaufman.
6. Kargupta, H. and Park, B.-H. (2001). Gene Expression and Fast Construction of Distributed Evolutionary Repre-sentation. Evolutionary Computation, 9(1).43-69.
7. Lodish, H., Baltimore, D., Berk, A., Zipursky, S. L., Mat-sudaira, P., and Darnell, J. (1995). Molecular Cell Biology. Scientific American Books, 3rd edition. ISBN 07167-2380-8.
8. Mayer, H. A. (1998). ptGAs-Genetic Algorithms Evolving Noncoding Segments by Means of Pro-moter/Terminator Sequences. Evolutionary Computation, 6(4):361-386.
9. Mitchell, M., Forrest, S., and Holland, J. H. (1992). The royal road for genetic algorithms: Fitness landscapes and GA performance. In Varela, F. J. and Bourgine, P., editors, Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, 1991, pages 245-254, Paris. A Bradford book, The MIT Press.
10. Pierrot, H. J. and Hinterding, R. (1997). Using multi- chromosomes to solve a simple mixed integer problem. In Australian Joint Conference on Artificial Intelligence, pages 137-146.
11. Ronald, S., Kirkby, S., and Eklund, P. (1997). Multi- chromosome Mixed Encodings for Heterogeneous Problems. In Proceedings of the 4th IEEE International Conference on Evolutionary Computation, pages 37-12. IEEE Press.
12. Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. Wi-ley, New York.
13. Whitley, D., Mathias, K., Rana, S., and Dzubera, J. (1995). Building better test functions. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 239-246, San Francisco, CA. Morgan Kaufmann.
14. Wu, A. S. (1996). Non-Coding DNA and Floating Building Blocks for the Genetic Algorithm. PhD thesis, University of Michigan.