An analysis of a reordering operator with tournament selection on a GA-hard problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2723, Issue , 2003, Pages 825-836

  Chen, Ying Ping ^a   Goldberg, David E ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; GENETIC ALGORITHMS;

COMBINED EFFECT; HARD PROBLEMS; NUMERICAL SOLUTION; TOURNAMENT SELECTION; UPPER BOUND;

EVOLUTIONARY ALGORITHMS;

EID: 35248872639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_96     Document Type: Article

References (22)

1. Goldberg, D.E., Deb, K., Clark, J.H.: Genetic algorithms, noise, and the sizing of populations. Complex Systems 6 (1992) 333-362
2. Goldberg, D.E., Deb, K., Thierens, D.: Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers 32 (1993) 10-16
3. Goldberg, D.E., Bridges, C.L.: An analysis of a reordering operator on a GA-hard problem. Biological Cybernetics 62 (1990) 397-405
4. Bagley, J.D.: The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan (1967) (University Microfilms No. 68-7556).
5. Cavicchio, Jr., D.J.: Adaptive Search Using Simulated Evolution. Unpublished doctoral dissertation, University of Michigan, Ann Arbor, MI (1970) (University Microfilms No. 25-0199).
6. Frantz, D.R.: Non-linearities in genetic adaptive search. PhD thesis, University of Michigan (1972) (University Microfilms No. 73-11,116).
7. Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI (1975)
8. Smith, S.F.: A learning system based on genetic adaptive algorithms. Dissertation Abstracts International 41 (1980) 4582B (University Microfilms No. 81-12638).
9. Davis, L., Smith, D.: Adaptive design for layout synthesis. Internal report, Texas Instruments, Dallas (1985)
10. Davis, L.: Applying adaptive algorithms to epistatic domains. Proceedings of the 9th International Joint Conference on Artificial Intelligence 1 (1985) 162-164
11. Goldberg, D.E., Lingle, Jr., R.: Alleles, loci, and the traveling salesman problem. Proceedings of an International Conference on Conference on Genetic Algorithms (1985) 154-159
12. Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms (1987) 224-230
13. Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesmen: The genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms (1989) 133-140
14. Banzhaf, W.: The 'molecular' traveling salesman. Biological Cybernetics 64 (1990) 7-14
15. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., Whitley, C.: A comparison of genetic sequencing operators. Proceedings of the Fourth International Conference on Genetic Algorithms (1991) 69-76
16. Goldberg, D.E.: Simple genetic algorithms and the minimal, deceptive problem. In Davis, L., ed.: Genetic algorithms and simulated annealing. Morgan Kaufmann Publishers, Inc., Los Altos, CA (1987) 74-88
17. Yamamura, M., Satoh, H., Kobayashi, S.: An Markov analysis of generation alternation models on minimal deceptive problems. In Wang, P.P., ed.: International Conference of Information Sciences: Fuzzy Logic, Intelligent Control & Genetic Algorithm. Volume 1., Durham, NC, Duke University (1997) 47-50
18. Novkovic, S., Šverko, D.: The minimal deceptive problem revisited: the role of 'genetic waste'. Computers and Operations Research 25 (1998) 895-911
19. Grefenstette, J.J.: Deception considered harmful. Foundations of Genetic Algorithms 2 (1993) 75-91
20. Forrest, S., Mitchell, M.: What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation. Machine Learning 13 (1993) 285-319
21. Naudts, B., Verschoren, A.: Epistasis and deceptivity. Simon Stevin - Bulletin of the Belgian Mathematical Society 6 (1999) 147-154
22. Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Foundations of Genetic Algorithms 1 (1991) 69-93 (Also TCGA Report 90007).