Solving constrained traveling salesman problems by genetic algorithms*

Author： Wu Chunguo   Liang Yanchun   Lee Heowpueh   Lu Chun   Lin Wuzhong  

Publisher： Taylor & Francis Ltd

ISSN： 1002-0071

Source： Progress in Natural Science, Vol.14, Iss.7, 2004-07, pp. : 631-637

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Solving traveling salesman problems by genetic algorithms*

By Liang Yanchun   Ge Hongwei   Zhou Chunguang   Lee Heow Pueh   Lin Wuzhong   Lim Siak Piang   Lee Kwok Hong  

Progress in Natural Science, Vol. 13, Iss. 2, 2003-02 ,pp. : 135-141

Taylor & Francis Ltd

Access to resources Recommend Favorite

Genetic algorithms and traveling salesman problems

By Chatterjee S.   Carrera C.   Lynch L.A.  

European Journal of Operational Research, Vol. 93, Iss. 3, 1996-09 ,pp. : 490-510

Elsevier

Access to resources Recommend Favorite

Rank-based ant colony optimization applied to dynamic traveling salesman problems

By Liu Jenn-long  

Engineering Optimization, Vol. 37, Iss. 8, 2005-12 ,pp. : 831-847

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new encoding based genetic algorithm for the traveling salesman problem

By Wang Yuping  

Engineering Optimization, Vol. 38, Iss. 1, 2006-01 ,pp. : 1-13

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient genetic algorithm for the traveling salesman problem with precedence constraints

By Moon C.   Kim J.   Choi G.   Seo Y.  

European Journal of Operational Research, Vol. 140, Iss. 3, 2002-08 ,pp. : 606-617

Elsevier

Access to resources Recommend Favorite