Some issues of designing genetic algorithms for traveling salesman problems

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

Publisher： Springer Publishing Company

ISSN： 1432-7643

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

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

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

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

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

New classes of efficiently solvable generalized Traveling Salesman Problems

By Balas E.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 529-558

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems

By Frederickson Greg   Wittman Barry  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 1198-1221

Springer Publishing Company

Access to resources Recommend Favorite