Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study

Author： Schmitt L.J.   Amini M.M.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.108, Iss.3, 1998-08, pp. : 551-570

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 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

Relaxed tours and path ejections for the traveling salesman problem

By Rego C.  

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 522-538

Elsevier

Access to resources Recommend Favorite

A computational study of smoothing heuristics for the traveling salesman problem

By Coy S.P.   Golden B.L.   Wasil E.A.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 15-27

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

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