|
|||||
|
|
Solving traveling salesman problems using generalized chromosome genetic algorithm |
|
| Authors: | Jinhui Yang Chunguo Wu Heow Pueh Lee Yanchun Liang |
| Affiliation: | [1]College of Computer Science and Technology, Jilin University,Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education, Changchun 130012, China; [2]National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100080, China; [3]Institute of High Performance Computing, Singapore 117528, Singapore; [4]Department of Mechanical Engineering, National University of Singapore, Singapore 1175 76, Singapore |
| Abstract: | Generalized chromosome genetic algorithm (GCGA) was proposed for solving generalized traveling salesman problems (GTSP) as reported in the authors' earlier work. Theoretically, the GCGA could also be used to solve the classical traveling salesman problem (CTSP), which has not been reported by others. In this paper, the generalized chromosome characteristics are analyzed and the feasibility for consistently solving the GTSP and CTSP is verified. Numerical experiments show the advantages of the GCGA for solving a large-scale CTSP. |
| Keywords: | Chromosome Genetic algorithm Solution space Generalized traveling salesman problem |
| 本文献已被 维普 万方数据 ScienceDirect 等数据库收录！ | |
| 点击此处可从《自然科学进展(英文版)》浏览原始摘要信息 | |
| 点击此处可从《自然科学进展(英文版)》下载全文 | |
