Please use this identifier to cite or link to this item:
Title: Solving traveling salesman problems by genetic algorithms
Authors: Liang, Y.
Ge, H.
Zhou, C.
Lee, H.P.
Lin, W.
Lim, S.P. 
Lee, K.H. 
Keywords: Evolutionary inversion
Gene section
Genetic algorithms
Genetic operations
Traveling salesman problem
Issue Date: Feb-2003
Citation: Liang, Y.,Ge, H.,Zhou, C.,Lee, H.P.,Lin, W.,Lim, S.P.,Lee, K.H. (2003-02). Solving traveling salesman problems by genetic algorithms. Progress in Natural Science 13 (2) : 135-141. ScholarBank@NUS Repository.
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.
Source Title: Progress in Natural Science
ISSN: 10020071
DOI: 10.1360/03jz9024
Appears in Collections:Staff Publications

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


checked on Dec 6, 2019

Page view(s)

checked on Dec 1, 2019

Google ScholarTM



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