A new encoding based genetic algorithm for the traveling salesman problem

ISSN： 0305-215X

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

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

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

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

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

An empirical study of a new metaheuristic for the traveling salesman problem

By Tsubakitani S. Evans J.R.

European Journal of Operational Research, Vol. 104, Iss. 1, 1998-01 ,pp. : 113-128

Elsevier

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