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

ISSN： 0305-215X

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

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

Hybrid ant colony algorithm for traveling salesman problem*

By Huang Lan Zhou Chunguang Wang Kangping

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

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

Solving constrained traveling salesman problems by genetic algorithms*

By Wu Chunguo Liang Yanchun Lee Heowpueh Lu Chun Lin Wuzhong

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

Cluster based branching for the asymmetric traveling salesman problem

By Lysgaard J.

European Journal of Operational Research, Vol. 119, Iss. 2, 1999-12 ,pp. : 314-325

Elsevier

Access to resources Recommend Favorite