Representation, mutation and crossover issues in evolutionary computation

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

Volumn 2, Issue , 2000, Pages 916-923

  Hinterding, Robert ^a  

^a VICTORIA UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; EVOLUTIONARY COMPUTATION;

ALGORITHMS; HISTORY; CALCULATIONS; PHILOSOPHICAL ASPECTS;

COMPUTATION THEORY; EVOLUTIONARY ALGORITHMS;

EID: 0033675453     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. J. Antonisse. A new interpretation of schema notation that overtums the binary encoding constraint. In J.D. Schaffer, editor, Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann, 1989. pp. 86-91.
2. H.J. Bremermann, M. Rogson, and S. Salaff. Global properties of evolution processes. In H.H. Pattee, E.A. Edlsack, L. Fein, and A.B. Callahan, editors, Natural Automata and Useful Simulations. Spartan Books, Washington DC, 1966. pp. 3-41.
3. A. Calenti and R. Hinterding. Two dimensional bin packing problems. In B. McKay, Y. Tsujimura, R. Sarker, A. Namatame, X. Yao, and M. Gen, editors, Proceedings of the Third Australian-Japan Joint Workshop on Intelligent and Evolutionary Systems, Canberra, 1999. University op New South Wales. pp. 183-190.
4. R. Caruana and J. D. Schaffer. Representation and hidden bias: Gray vs. binary coding for genetic algorithms. In Proceedings of the 5th International Conference on Machine Learning, San Mateo, 1988. pp. 153-161.
5. L. Davis. Job-shop scheduling with genetic algorithms. In J.J. Grefenstette, editor, Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates, 1985. pp. 136-140.
6. A.E. Eiben and R. Hinterding Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124-141, 1999.
7. L.J. Fogel. On the Organization oflntellect. Doctoral dissertation, University of California at Los Angeles, 1964.
8. D.B. Fogel. Evolving Artijicial Intelligence. Doctoral dissertation, University of Califomia at San Diego, 1992.
9. L.J. Fogel. Evolving mutation. In X. Yao, editor, Preprints of the A1'93 Workshop on Evolutionary Computation, Canberra, 1993. Dept. of Computer Science, University Colledge, University of New South Wales. pp. 74-86.
10. D.B. Fogel, editor. Evolutionary Computation: The Fossil Record. IEEE Press, Piscataway, NJ, 1998.
11. A.S. Fraser. Simulation of genetic systems by automatic digital computers. Australian Journal of Biological Sciences, Vol. 10:pp. 484-491, 1957.
12. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
13. R. Hinterding. Representation, constraint satisfaction and the knapsack problem. In Proceedings of the 1999 Congress on Evolutionary Computation. IEEE Press, 1999. pp. 1286-1292.
14. R.B. Hollstein. Artificial Genetic Adaption in Computer Control Systems. PhD thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, Michigan, 1971.
15. J. H. Holland. Adaption in Natural and ArtiJicial Systems. MIT Press, 1975.
16. J. H. Holland. Adaption in Natural and Artijicial Systems. MIT Press, 2nd edition, 1992.
17. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer - Verlag, 2nd edition, 1994.
18. J. Reed, R. Toombs, and N.A. Barricelli. Simulation of biological evolution and machine leaming. Theoretical Biology, Vol. 17:pp. 319-342, 1967.
19. H-P Schwefel. Kybernetische evolution als strategie der experimentellen forschung in der Stromungstecknik. Diplomarbeit, Berlin Technical University, 1965.
20. H-P. Schwefel. Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. Wiley, 1995.
21. A.H. Wright. Genetic algorithms for real parameter optimization. In G. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann, 1991. pp. 205-218.