|
|||||
|
|
| Solving traveling salesman problems by genetic algorithms | |
| 作者姓名： | LIANG Yanchun GE Hongwei ZHOU Chunguang LEE Heow Pueh LIN Wuzhong LIM Siak Piang LEE Kwok Hong |
| 作者单位： | College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China;Institute of High Performance Computing, Singapore 117528, Singapore,College of Mathematics Science, Jilin University, Changchun 130012, China,College of Computer Science and Technology, Jilin University, Changchun 130012, China,Institute of High Performance Computing, Singapore 117528, Singapore,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 |
| 基金项目： | Supported by the National Natural Science Foundation of China (Grant Nos. 19872027, 60175024) |
| 摘 要： | The gene section ordering on solving traveling salesman problems is analyzed by numerical experiments. Some improved crossover operations are presented. Several combinations of genetic operations are examined and the functions of these operations are analyzed. The essentiality of the ordering of the gene section and the significance of the evolutionary inversion operation are discussed. Some results and conclusions are obtained and given, which provide useful information for the implementation of the genetic operations for solving the traveling salesman problem. |
| 关 键 词： | genetic algorithms traveling salesman problem gene section evolutionary inversion genetic operat |
Solving traveling salesman problems by genetic algorithms |
|
| LIANG Yanchun,GE Hongwei,ZHOU Chunguang,LEE Heow Pueh,LIN Wuzhong,LIM Siak Piang,LEE Kwok Hong.Solving traveling salesman problems by genetic algorithms[J].Progress in Natural Science,2003,13(2):135-141. | |
| Authors: | LIANG Yanchun GE Hongwei Zhou Chunguang LEE Heow Pueh LIN Wuzhong LIM Siak Piang LEE Kwok Hong |
| Institution: | 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China;Institute of High Performance Computing, Singapore 117528, Singapore 2. College of Mathematics Science, Jilin University, Changchun 130012, China 3. College of Computer Science and Technology, Jilin University, Changchun 130012, China 4. Institute of High Performance Computing, Singapore 117528, Singapore 5. Department of Mechanical Engineering, National University of Singapore, Singapore 119260, Singapore |
| Abstract: | The gene section ordering on solving traveling salesman problems is analyzed by numerical experiments. Some improved crossover operations are presented. Several combinations of genetic operations are examined and the functions of these operations are analyzed. The essentiality of the ordering of the gene section and the significance of the evolutionary inversion operation are discussed. Some results and conclusions are obtained and given, which provide useful information for the implementation of the genetic operations for solving the traveling salesman problem. |
| Keywords: | genetic algorithms traveling salesman problem gene section evolutionary inversion genetic operat |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《自然科学进展(英文版)》浏览原始摘要信息 | |
| 点击此处可从《自然科学进展(英文版)》下载免费的PDF全文 | |