A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Author： Buriol Luciana   França Paulo M.   Moscato Pablo  

Publisher： Springer Publishing Company

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.10, Iss.5, 2004-09, pp. : 483-506

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 IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM

By Kocer Hasan Erdinc   Akca Melike Ruhan  

Cybernetics and Systems, Vol. 45, Iss. 8, 2014-11 ,pp. : 635-649

Taylor & Francis Ltd

Access to resources Recommend Favorite

GENI Ants for the Traveling Salesman Problem

By Le Louarn François-Xavier   Gendreau Michel   Potvin Jean-Yves  

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 187-201

Springer Publishing Company

Access to resources Recommend Favorite

Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study

By Sena G.A.   Megherbi D.   Isern G.  

Future Generation Computer Systems, Vol. 17, Iss. 4, 2001-01 ,pp. : 477-488

Elsevier

Access to resources Recommend Favorite

Memetic algorithm for the antibandwidth maximization problem

By Bansal Richa  

Journal of Heuristics, Vol. 17, Iss. 1, 2011-02 ,pp. : 39-60

Springer Publishing Company

Access to resources Recommend Favorite

Dynamics of Local Search Trajectory in Traveling Salesman Problem

By Li Weiqi  

Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. : 507-524

Springer Publishing Company

Access to resources Recommend Favorite