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

Author： Moon C.   Kim J.   Choi G.   Seo Y.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

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

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

An efficient composite heuristic for the symmetric generalized traveling salesman problem

By Renaud J.   Boctor F.F.  

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 571-584

Elsevier

Access to resources Recommend Favorite