TY - GEN
T1 - Multi-stages genetic algorithms
T2 - 6th International Conference on Machine Learning and Applications, ICMLA 2007
AU - Qian, Ting
PY - 2007
Y1 - 2007
N2 - Standard genetic algorithms (GA) are often confronted with the problem of rapid premature convergence. The loss of diversity in a population usually slows down evolution to a significant extent. In this paper, we explore the use of an original strategy called the Multi-stages GA as a means of impeding premature convergence and optimizing evolutionary progresses at the same time. The algorithm introduces the idea of temporally organizing an evolutionary process. Evaluation results show that the Multi-stages GA significantly outperforms the standard GA.
AB - Standard genetic algorithms (GA) are often confronted with the problem of rapid premature convergence. The loss of diversity in a population usually slows down evolution to a significant extent. In this paper, we explore the use of an original strategy called the Multi-stages GA as a means of impeding premature convergence and optimizing evolutionary progresses at the same time. The algorithm introduces the idea of temporally organizing an evolutionary process. Evaluation results show that the Multi-stages GA significantly outperforms the standard GA.
UR - http://www.scopus.com/inward/record.url?scp=47349088455&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47349088455&partnerID=8YFLogxK
U2 - 10.1109/ICMLA.2007.77
DO - 10.1109/ICMLA.2007.77
M3 - Conference contribution
AN - SCOPUS:47349088455
SN - 0769530699
SN - 9780769530697
T3 - Proceedings - 6th International Conference on Machine Learning and Applications, ICMLA 2007
SP - 56
EP - 61
BT - Proceedings - 6th International Conference on Machine Learning and Applications, ICMLA 2007
Y2 - 13 December 2007 through 15 December 2007
ER -