论文信息 - A practical method for the analysis of genetic algorithms

A practical method for the analysis of genetic algorithms

In this research, a practical method was proposed for the analysis of genetic algorithms for the sake of proving their efficiency, showing the weak points, and checking the performance by answering most of the important questions related. The experimental result done on some of the known genetic algorithms show the usefulness of the proposed method in improving the quality of genetic algorithms.

Imad Fakhri Taha Alshaikhli

[1] Nirwan Ansari,et al. A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3] Stephan M. Winkler,et al. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications , 2009 .

[4] Chang Wook Ahn,et al. On the practical genetic algorithms , 2005, GECCO '05.

[5] Yongsheng Zhao,et al. Rough Sets in Hybrid Soft Computing Systems , 2007, ADMA.

[6] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .

[7] Imtiaz Ahmad,et al. Multiprocessor Scheduling in a Genetic Paradigm , 1996, Parallel Comput..

[8] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.