Network random keys - A tree representation scheme for genetic and evolutionary algorithms

Evolutionary Computation

Volumn 10, Issue 1, 2002, Pages 75-97

  Rothlauf, Franz ^a,c   Goldberg, David E ^b   Heinzl, Armin ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c Illinois Genetic Algorithms Lab   (United States)

Author keywords

Characteristic vector encoding; Network random keys; Random keys; Representation; Stealth mutation; Tree network

Indexed keywords

ALGORITHM; BIOLOGICAL MODEL; EVOLUTION; METHODOLOGY; MOLECULAR EVOLUTION; RANDOMIZATION; REVIEW;

ALGORITHMS; EVOLUTION; EVOLUTION, MOLECULAR; MODELS, GENETIC; RANDOM ALLOCATION; RESEARCH DESIGN;

EID: 0036516408     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365602317301781     Document Type: Article

References (36)

1. Abuali, F. N., Wainwright, R. L., and Schoenefeld, D. A. (1995). Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem. In Eshelman, L., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 470-477, Morgan Kaufmann, San Francisco, California.
2. Ackley, D. H. (1987). A connectionist machine for genetic hill climbing. Kluwer Academic, Boston, Massachusetts.
3. Bäck, T. and Schwefel, H.-P. (1995). Evolution strategies I: Variants and their computational implementation. In Winter, G. et al., editors, Genetic Algorithms in Engineering and Computer Science, pages 111-126, John Wiley and Sons, Chichester, UK.
4. Bean, J. C. (1992). Genetics and random keys for sequencing and optimization. Technical Report 92-43, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan.
5. Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154-160.
6. Berry, L. T. M., Murtagh, B. A., and Sugden, S. J. (1994). A genetic-based approach to tree network synthesis with cost constraints. In Zimmermann, H. J., editor, Second European Congress on Intelligent Techniques and Soft Computing - EUFIT'94, Volume 2, pages 626-629, Verlag der Augustinus Buchhandlung, Aachen, Germany.
7. Davis, L. et al. (1993). A genetic algorithm for survivable network design. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 408-415, Morgan Kaufmann, San Mateo, California.
8. Fox, B. R. and McMahon, M. B. (1991). Genetic operators for sequencing problems. In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms, pages 284-300, Morgan Kaufmann, San Mateo, California.
9. Goldberg, D. E. (1989a). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, Massachusetts.
10. Goldberg, D. E. (1989b). Sizing populations for serial and parallel genetic algorithms. In Schaffer, J. D., editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 70-79, Morgan Kaufmann, San Mateo, California.
11. Goldberg, D. E. (1990). Real-coded genetic algorithms, virtual alphabets, and blocking. IlliGAL Report No. 90001, University of Illinois at Urbana-Champaign, Urbana, Illinois.
12. Goldberg, D. E., Deb, K., and Clark, J. H. (1992). Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362.
13. Goldberg, D. E., Deb, K., and Thierens, D. (1993). Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers, 32(1):10-16.
14. Goldberg, D. E. et al. (1993). Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 56-64, Morgan Kaufmann, San Mateo, California.
15. Hamming, R. (1980). Coding and information theory. Prentice-Hall, London, England.
16. Harik, G. R. et al. (1997). The gambler's ruin problem, genetic algorithms, and the sizing of populations. In Bäck, T., editor, Proceedings of the Forth International Conference on Evolutionary Computation, pages 7-12, IEEE Press, Piscataway, New Jersey.
17. Kargupta, H., Deb, K., and Goldberg, D. E. (1992). Ordering genetic algorithms and deception. In Männer, R. and Manderick, B., editors, Parallel Problem Solving from Nature - PPSN II, pages 47-56, Elsevier Science, Amsterdam, The Netherlands.
18. Knjazew, D. (2000). Application of the fast messy genetic algorithm to permutation and scheduling problems. IlliGAL Report No. 2000022, University of Illinois at Urbana-Champaign, Urbana, Illinois.
19. Knjazew, D. and Goldberg, D. E. (2000a). Large-scale permutation optimization with the ordering messy genetic algorithm. IlliGAL Report No. 2000013, University of Illinois at Urbana-Champaign, Urbana, Illinois.
20. Knjazew, D. and Goldberg, D. E. (2000b). OMEGA - ordering messy ga: Solving permutation problems with the fast messy genetic algorithm and random keys. IlliGAL Report No. 2000004, University of Illinois at Urbana-Champaign, Urbana, Illinois.
21. Mühlenbein, H. and Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization. Evolutionary Computation, 1(1):25-49.
22. Norman, B. A. (1995). Scheduling using the random keys genetic algorithm. Unpublished Ph.D. thesis, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan.
23. Norman, B. A. and Bean, J. C. (1994). Random keys genetic algorithm for job shop scheduling. Technical Report No. 94-5, University of Michigan, Ann Arbor, Michigan.
24. Norman, B. A. and Bean, J. C. (1997). Operation sequencing and tool assignment for multiple spindle CNC machines. In Proceedings of the Forth International Conference on Evolutionary Computation, pages 425-430, IEEE, Piscataway, New Jersey.
25. Norman, B. A. and Bean, J. C. (2000). Scheduling operations on parallel machines. IIE Transactions, 32:449-459.
26. Norman, B. A. and Smith, A. E. (1997). Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems. In Proceedings of the Forth International Conference on Evolutionary Computation, pages 407-411, IEEE, Piscataway, New Jersey.
27. Norman, B. A., Smith, A. E., and Arapoglu, R. A. (1998). Integrated facility design using an evolutionary approach with a subordinate network algorithm. In Eiben, A. E. et al., editors, Parallel Problem Solving from Nature, PPSN V, pages 937-946, Springer-Verlag, Berlin, Germany.
28. Orvosh, D. and Davis, L. (1993). Shall we repair? Genetic algorithms, combinatorial optimization, and feasibility constraints. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, page 650, Morgan Kaufmann, San Mateo, California.
29. Palmer, C. C. (1994). An approach to a problem in network design using genetic algorithms. Unpublished Ph.D. thesis. Computer Science Department, Polytechnic University, Troy, New York.
30. Palmer, C. C. and Kershenbaum, A. (1994). Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, Volume 1, pages 379-384, IEEE, Piscataway, New Jersey.
31. Prüfer, H. (1918). Neuer Beweis eines Satzes über Permutationen. Archiv für Mathematik und Physik, 27:742-744.
32. Rothlauf, F. (2001). Towards a theory of representations for genetic and evolutionary algorithms: Development of basic concepts and their application to binary and tree representations. Doctoral dissertation, Department of Information Systems, University of Bayreuth, Bayreuth, Germany.
33. Rothlauf, F. and Goldberg, D. E. (2000). Prüfernumbers and genetic algorithms: A lesson on how the low locality of an encoding can harm the performance of GAs. In Schoenauer, M. et al., editors, Parallel Problem Solving from Nature, PPSN VI, pages 395-404, Springer-Verlag, Berlin, Germany.
34. Sinclair, M. C. (1995). Minimum cost topology optimisation of the COST 239 European optical network. In Pearson, D. W., Steele, N. C., and Albrecht, R. F., editors, Proceedings of the 1995 International Conference on Artificial Neural Nets and Genetic Algorithms, pages 26-29, Springer-Verlag, New York.
35. Tang, K. S., Man, K. F., and Ko, K. T. (1997). Wireless LAN design using hierarchical genetic algorithm. In Bäck, T., editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 629-635, Morgan Kaufmann, San Francisco, California.
36. Thierens, D. and Goldberg, D. E. (1994). Convergence models of genetic algorithm selection schemes. In Davidor, Y., Schwefel, H.-P., and Männer, R., editors, Parallel Problem Solving from Nature - PPSN III, pages 119-129, Springer-Verlag, Berlin, Germany.