A Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem

Publisher： IGI Global_journal

E-ISSN： 1947-8291|8|3|53-65

ISSN： 1947-8283

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

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

Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization

By Ting Tiew-On   Rao M.V.C.   Loo C.K.   Ngu S.S.  

Journal of Heuristics, Vol. 9, Iss. 6, 2003-12 ,pp. : 507-520

Springer Publishing Company

Access to resources Recommend Favorite

Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem

By Bockenhauer H.-J.   Hromkovic J.   Klasing R.   Seibert S.   Unger W.  

Theoretical Computer Science, Vol. 285, Iss. 1, 2002-08 ,pp. : 3-24

Elsevier

Access to resources Recommend Favorite

Discrete optimization by optimal control methods. II. The static traveling salesman problem

By Sergeev S.  

Automation and Remote Control, Vol. 67, Iss. 6, 2006-06 ,pp. : 927-932

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

An improved particle swarm optimisation for solving generalised travelling salesman problem

By Gao Yu-xi  

International Journal of Computing Science and Mathematics, Vol. 3, Iss. 4, 2012-01 ,pp. : 385-393

Inderscience Publishers

Access to resources Recommend Favorite