Please use this identifier to cite or link to this item:
|Title:||Solving traveling salesman problems using generalized chromosome genetic algorithm|
Generalized traveling salesman problem
|Citation:||Yang, J., Wu, C., Lee, H.P., Liang, Y. (2008-07). Solving traveling salesman problems using generalized chromosome genetic algorithm. Progress in Natural Science 18 (7) : 887-892. ScholarBank@NUS Repository. https://doi.org/10.1016/j.pnsc.2008.01.030|
|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.|
|Source Title:||Progress in Natural Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 22, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.