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

Author： Sena G.A.   Megherbi D.   Isern G.  

Publisher： Elsevier

ISSN： 0167-739X

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

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

Neurodynamic programming: a case study of the traveling salesman problem

By Ma Jia   Yang Tao   Hou Zeng-Guang   Tan Min   Liu Derong  

Neural Computing & Applications, Vol. 17, Iss. 4, 2008-08 ,pp. : 347-355

Springer Publishing Company

Access to resources Recommend Favorite

A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

By Buriol Luciana   França Paulo M.   Moscato Pablo  

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

Springer Publishing Company

Access to resources Recommend Favorite

COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS

By Bhattacharyya Malay   Bandyopadhyay Anup Kumar  

Cybernetics and Systems, Vol. 40, Iss. 1, 2009-01 ,pp. : 1-24

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

A COMPARATIVE STUDY ON PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHMS FOR TRAVELING SALESMAN PROBLEMS

By Cunkas Mehmet   Ozsaglam M. Yasin  

Cybernetics and Systems, Vol. 40, Iss. 6, 2009-08 ,pp. : 490-507

Taylor & Francis Ltd

Access to resources Recommend Favorite