Hybrid Particle Swarm Optimization Algorithm for Large-Scale Travelling Salesman Problem

Jiang Wei Zhang

doi:10.4028/www.scientific.net/AMM.513-517.1773

Paper Titles

LabVIEW-Based Design of Virtual Instruments and R&G of Virtual Experimental System
p.1756

Study on Finding Experts in Community Question-Answering System
p.1760

Application of Cloud Counting in Product Platform Design Services Research
p.1765

Research on Service Update Dynamically Based on OSGi Frame
p.1769

Hybrid Particle Swarm Optimization Algorithm for Large-Scale Travelling Salesman Problem
p.1773

Decision Diagram-Based Modeling of Network Reachability
p.1779

The Application of the Fuzzy ART Neural Network Algorithm
p.1783

Ant Colony Algorithm Dynamically Adjust the Parameters Based on Chaos Theory
p.1787

Study on Partition Testing Based on Software Models
p.1793

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Hybrid Particle Swarm Optimization Algorithm for...

Hybrid Particle Swarm Optimization Algorithm for Large-Scale Travelling Salesman Problem

Abstract:

Based on the improved enhanced self-tentative (IEST) particle swarm optimization (PSO) algorithm, 2-opt local searching algorithm is introduced in the later evolution stage. 2-opt method further strengthen the self-tentative and make up the deficiency of the IEST PSO algorithm and solve the cross solution problem. The hybrid PSO algorithm greatly increases the chances to find the better solution in the evolutionary process. Time complexity of the 2-opt method is analyzed. Based on this the proper parameters is set to solve different benchmark TSP problems, numerical simulation results show the effectiveness and efficiency of the hybrid PSO algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

1773-1778

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.1773

Citation:

Cite this paper

Online since:

February 2014

Authors:

Jiang Wei Zhang*

Keywords:

2-opt Algorithm, Improved Enhanced Self-Tentative (IEST), Particle Swarm Optimization (PSO), Travelling Salesman Problem (TSP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Wang Cuiru, Zhang Jiangwei, etc. Solving Traveling Salesman Problem Based on Improved Particle Swarm Optimization Algorithm. In: Proceedings of the 11th Joint International Computer Conference.

DOI: 10.1109/icnnb.2005.1614723

Google Scholar

[2] Zhang Jiang-wei, Si Wen-jian. An Improved Enhanced Self-Tentative Particle Swarm Optimization Algorithm for TSP[C]. ICNC10, 279~283.

Google Scholar

[3] Lin S, Kernighan B. An effective heuristic algorithm for the travleling salesman problem [J]. Operations Research, 1973, 21(2): 498-516.

DOI: 10.1287/opre.21.2.498

Google Scholar

[4] Gunter Duck. New optimization Heuristics: the great deluge algorithm and the record-to-record travel [J]. Journal of Computational Physics, 1993, 104(1): 86-92.

Google Scholar

[5] Ji Jun-zhong, Huang Zhen, Liu Chun-nian. An Ant Colony algorithm Based on Clustering and Partition Optimization[J]. Jounal of Beijing University of Technology. 2008, Vol 34, No4: 434~440.

Google Scholar

[6] Sheng Hong-ping, Ma Liang. Modified Great Deluge Algorithm for Large-scale Travelling Salesman Problem. Journal of Chinese Computer Systems. Vol, 33, No. 2, 2012: 259~262.

Google Scholar