Hybrid ant colony algorithm for traveling salesman problem*

Author： Huang Lan   Zhou Chunguang   Wang Kangping  

Publisher： Taylor & Francis Ltd

ISSN： 1002-0071

Source： Progress in Natural Science, Vol.13, Iss.4, 2003-04, pp. : 295-299

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

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

Submodularity and the traveling salesman problem

By Herer Y.T.  

European Journal of Operational Research, Vol. 114, Iss. 3, 1999-05 ,pp. : 489-508

Elsevier

Access to resources Recommend Favorite

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

By Malandraki C.   Dial R.B.  

European Journal of Operational Research, Vol. 90, Iss. 1, 1996-04 ,pp. : 45-55

Elsevier

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