论文信息 - Analysis of Selection Schemes for Solving an Optimization Problem in Genetic Algorithm

Analysis of Selection Schemes for Solving an Optimization Problem in Genetic Algorithm

Genetic algorithm is a population based an adaptive search and optimizations techniques and genetic mimic the natural evolution process. The Genetic operators include selection, crossover and mutation. The aim to present this paper is it gives comparative selection strategies for solving an optimization problem in genetic algorithm and evaluates their performance.

[1] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[2] Reyadh Naoum,et al. Comparison of Selection Methods and Crossover Operations using Steady State Genetic Based Intrusion Detection System , 2012 .

[3] S. N. Sivanandam,et al. Introduction to genetic algorithms , 2007 .

[4] Tom V. Mathew. Genetic Algorithm , 2022 .

[5] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

[6] John Geraghty,et al. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP , 2011 .

[7] Lothar Thiele,et al. A Comparison of Selection Schemes used in Genetic Algorithms , 1995 .

[8] Mahesh Panchal,et al. Comparison of Parents Selection Methods of Genetic Algorithm for TSP , 2012 .

[9] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.