Solving traveling salesman problems by genetic algorithms

作     者：LEE Heow Pueh,LIM Siak Piang,LEE Kwok Hong 

作者机构：Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore 

出 版 物：《Progress in Natural Science:Materials International》 (自然科学进展·国际材料(英文))

年 卷 期：2003年第2期

页      面：57-63页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (Grant Nos. 19872027  60175024) 

主　　题：genetic algorithms traveling salesman problem gene section evolutionary inversion genetic operations. 

摘      要：Abstract The gene section ordering on solving traveling salesman problems is analyzed by numerical experiments. Some improvedcrossover operations are presented. Several combinations of genetic operations are examined and the functions of these operations are ana-lyzed. The essentiality of the ordering of the gene section and the significance of the evolutionary inversion operation are discussed. Someresults and conclusions are obtained and given, which provide useful information for the implementation of the genetic operations for solv-ing the traveling salesman problem.