Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.pnsc.2008.01.030
Title: Solving traveling salesman problems using generalized chromosome genetic algorithm
Authors: Yang, J.
Wu, C.
Lee, H.P. 
Liang, Y.
Keywords: Chromosome
Generalized traveling salesman problem
Genetic algorithm
Solution space
Issue Date: Jul-2008
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
URI: http://scholarbank.nus.edu.sg/handle/10635/61340
ISSN: 10020071
DOI: 10.1016/j.pnsc.2008.01.030
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

40
checked on Aug 8, 2018

WEB OF SCIENCETM
Citations

27
checked on Jul 31, 2018

Page view(s)

48
checked on Jul 27, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.