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

Author： Bhattacharyya Malay Bandyopadhyay Anup Kumar

ISSN： 1087-6553

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

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

Some issues of designing genetic algorithms for traveling salesman problems

By Tsai H.-K. Yang J.-M. Tsai Y.-F. Kao C.-Y.

Soft Computing, Vol. 8, Iss. 10, 2004-11 ,pp. : 689-697

Springer Publishing Company

Access to resources Recommend Favorite

On the solution of the traveling salesman problem once again

By Parkhomenko P.

Automation and Remote Control, Vol. 67, Iss. 12, 2006-12 ,pp. : 2036-2050

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

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

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