A Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem

Yong Wang and Ning Xu
Additional contact information
Yong Wang: School of Renewable Energy, North China Electric University, Beijing, China
Ning Xu: School of Renewable Energy, North China Electric University, Beijing, China

International Journal of Applied Metaheuristic Computing (IJAMC), 2017, vol. 8, issue 3, 53-65

Abstract: Traveling salesman problem (TSP) is one well-known NP-Complete problem. The objective is to search the optimal Hamiltonian circuit (OHC) in a tourist map. The particle swarm optimization (PSO) integrated with the four vertices and three lines inequality is introduced to detect the OHC or approximate OHC. The four vertices and three lines inequality is taken as local heuristics to find the local optimal paths composed of four vertices and three lines. Each of this kind of paths in the OHC or approximate OHC conforms to the inequality. The particle swarm optimization is used to search an initial approximation. The four vertices and three lines inequality is applied to convert all the paths in the approximation into the optimal paths. Then a better approximation is obtained. The method is tested with several Euclidean TSP instances. The results show that the much better approximations are searched with the hybrid PSO. The convergence rate is also faster than the traditional PSO under the same preconditions.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJAMC.2017070104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:8:y:2017:i:3:p:53-65

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().