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

ISSN： 1087-6553

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

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 Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 8, Iss. 3, 2017-07 ,pp. : 53-65

IGI Global_journal

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

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

Tracking Patterns with Particle Swarm Optimization and Genetic Algorithms

International Journal of Swarm Intelligence Research (IJSIR), Vol. 8, Iss. 2, 2017-04 ,pp. : 34-49

IGI Global_journal

Access to resources Recommend Favorite

Development of a novel crossover of hybrid genetic algorithms for large-scale traveling salesman problems

By Kuroda Masafumi

Artificial Life and Robotics, Vol. 15, Iss. 4, 2010-12 ,pp. : 547-550

Springer Publishing Company

Access to resources Recommend Favorite