Computer Science ›› 2007, Vol. 34 ›› Issue (4): 222-224.
Previous Articles Next Articles
ZHANG Ying-Hui ,WANG Zhi-Wei ,ZENG Qing-Hua (Chengdu Neusoft Institute of Information, Chengdu 611844)
Online:
Published:
Abstract: In a general Genetic Algorithms (GA), it is difficulty to avoid prematurely convergence and raise the speed of the algorithm convergence for complex finding the optimal solution, in which the algorithm is run with a single set of crossover/mutation operat
Key words: Genetic algorithms, Genetic operators, Global optimization, Prematurely convergence, Traveling Salesman Problems (TSP)
ZHANG Ying-Hui ,WANG Zhi-Wei ,ZENG Qing-Hua (Chengdu Neusoft Institute of Information, Chengdu 611844). [J].Computer Science, 2007, 34(4): 222-224.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2007/V34/I4/222
Cited