The effect of genetic operator probabilities and selection strategies on the performance of a genetic algorithm

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

Volumn 1418, Issue , 1998, Pages 139-153

  Wiese, Kay ^a   Goodwin, Scott D ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PROBABILITY; TRAVELING SALESMAN PROBLEM;

CROSSOVER AND MUTATION PROBABILITIES; GENETIC ALGORITHM (GAS); GENETIC OPERATORS; ROULETTE WHEEL SELECTION; TRAVELLING SALESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 84879106993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64575-6_46     Document Type: Conference Paper

References (13)

1. Baeck, T., “Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms”, Oxford University Press, 1996.
2. Goldberg, D.E. and Lingle, R., Jr., “Alleles, Loci, and the Traveling Salesman Problem”, Proceedings of the 1st ICG A, pp. 154-159, 1985.
3. Grefenstette, J.J., Gopal, R., Rosmaita, R., and van Gucht, D., “Genetic Algorithms for the Traveling Salesman Problem”, Proceedinqs of the 1st ICGA, pp. 160-168, 1985.
4. Holland, J.H., Adaptation in Natural and Artificial Systems, Ann Arbor, MI, University of Michigan Press, 1975.
5. McGuire, K.M. and Sabin R.E., “Using a Genetic Algorithm to Find Good Linear Error-Correcting Codes”, Proceedings of the 1998 ACM Symposium on Applied Computing SAC’98”, pp. 332-337, 1998.
6. Oliver, I.M., Smith, D.J., and Holland, J.R.C., “A Study of Permutation Crossover Operators on the Traveling Salesman Problem”, Proceedings of the 2nd ICGA, pp. 224-230, 1987.
7. Sandalidis H.G., Stavroulakis P.P., Rodriguez-Tellez J., “A Combinatorial Evolution Strategy for Dynamic Channel Assignment in Cellular Radio”, Proceedings of the 1998 ACM Symposium on Applied Computing SAC’98”, pp. 303-307, 1998.
8. Starkweather, T., McDaniel, S., et. al, “A Comparison of Genetic Sequencing Operators”, Proceedings of the 4th ICGA, pp. 69-76, 1991.
9. Thierens, D. and Goldberg, D.E., “Elitist Recombination: An Integrated Selection Recombination GA”, Proceedings of the 1st IEEE World Congress on Computational Intelligence, pp. 508-512, 1994.
10. Thierens, D., “Selection Schemes, Elitist Recombination and Selection Intensity”, Proceedings of the 7th International Conference on Genetic Algorithms ICG A-97, pp. 152-159, 1997.
11. Wiese, K. and Goodwin, S.D., “Keep-Best Reproduction: A Selection Strategy for Genetic Algorithms”, Proceedings of the 1998 ACM Symposium on Applied Computing SAC’98, pp. 343-348, 1998
12. Wiese K. and Goodwin, S.D., “Parallel Genetic Algorithms for Constrained Ordering Problems”, Proceedings of the 11th International Florida Artificial Intelligence Research Symposium, FLAIRS’98, to appear, 1998.
13. Whitley, D, Starkweather, T., and D’Ann Fuquay, “Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator”, Proceedings of the 3rd ICGA, pp. 133-140, 1989.