| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1548995 | Progress in Natural Science: Materials International | 2008 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Materials Science
Electronic, Optical and Magnetic Materials
Authors
Jinhui Yang, Chunguo Wu, Heow Pueh Lee, Yanchun Liang,