Computer Science ›› 2006, Vol. 33 ›› Issue (8): 195-197.
Previous Articles Next Articles
CHEN Jing, YANG Xiao-Fan ,ZENG Zhi （Department of Computer Science and Engineering, Chongqing University, Chongqing 400044）
Online:
Published:
Abstract: Traveling salesman problem is a typical representative of combinatorial optimization problems. After analyzing the characteristic of genetic algorithm, a new genetic algorithm named GB-MGA is designed in this article. It combines gene bank and multiple-se
Key words: Traveling salesman problem, Genetic algorithm, Gene bank, Multiple-searching method
CHEN Jing, YANG Xiao-Fan ,ZENG Zhi （Department of Computer Science and Engineering, Chongqing University, Chongqing 400044）. [J].Computer Science, 2006, 33(8): 195-197.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2006/V33/I8/195
Cited
Home