Hybrid ant colony and particle swarm algorithm for solving TSP

Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (34): 60-63.

Previous Articles Next Articles

Hybrid ant colony and particle swarm algorithm for solving TSP

SUN Kai1, WU Hongxing1，2, WANG Hao1, DING Jiadong1

1.School of Computer and Information, Hefei University of Technology, Hefei 230009, China
2.Information Center, Anhui Province Huishang Group, Hefei 230061, China

Online:2012-12-01 Published:2012-11-30

蚁群与粒子群混合算法求解TSP问题

孙凯1，吴红星1，2，王浩1，丁家栋1

1.合肥工业大学计算机与信息学院，合肥 230009
2.安徽省徽商集团信息中心，合肥 230061

Abstract

Abstract: The Traveling Salesman Problem（TSP） is the oldest and most extensively studied combinatorial optimization problem. For the traveling salesman problem, Hybrid Ant colony and Particle swarm Algorithm（HAPA） is proposed. The HAPA divides the ant colony into several ant sub colonies, then optimizes parameters of the ant sub colonies as particles by the particle swarm optimization algorithm, and introduces the operation of swapping the pheromone in each ant sub colony. Results show that the HAPA has more advantages than the traditional algorithm and the similar algorithm in solving the traveling salesman problem.

Key words: Ant Colony Optimization, Particle Swarm Optimization, Traveling Salesman Problem

摘要： 旅行商问题（TSP）是最古老而且研究最广泛的组合优化问题。针对TSP问题，提出一种蚁群与粒子群混合算法（HAPA）。HAPA首先将蚁群划分成多个蚂蚁子群，然后把蚂蚁子群的参数作为粒子，通过粒子群算法来优化蚂蚁子群的参数，并在蚂蚁子群中引入了信息素交换操作。实验结果表明，HAPA在求解TSP问题中比传统算法和同类算法更具优越性。

关键词: 蚁群算法, 粒子群优化算法, 旅行商问题

SUN Kai1, WU Hongxing1，2, WANG Hao1, DING Jiadong1. Hybrid ant colony and particle swarm algorithm for solving TSP[J]. Computer Engineering and Applications, 2012, 48(34): 60-63.

孙凯1，吴红星1，2，王浩1，丁家栋1. 蚁群与粒子群混合算法求解TSP问题[J]. 计算机工程与应用, 2012, 48(34): 60-63.

[1]	SHI Chuntian, ZENG Yanyang, HOU Shouming. Summary of Application of Swarm Intelligence Algorithms in Image Segmentation [J]. Computer Engineering and Applications, 2021, 57(8): 36-47.
[2]	ZHANG Songcan, PU Jiexin, SI Yanna, SUN Lifan. Adaptive Improved Ant Colony Algorithm Based on Population Similarity and Its Application [J]. Computer Engineering and Applications, 2021, 57(8): 70-77.
[3]	LI Jingxing, YANG Youlong. Feature Selection of Markov Blanket for High Dimensional Data [J]. Computer Engineering and Applications, 2021, 57(6): 58-66.
[4]	BU Guannan, LIU Jianhua, JIANG Lei, ZHANG Dongyang. Ant Colony Algorithm with Adaptive Grouping [J]. Computer Engineering and Applications, 2021, 57(6): 67-73.
[5]	ZHU Jiaying, GAO Maoting. AUV Path Planning Based on Particle Swarm Optimization and Improved Ant Colony Optimization [J]. Computer Engineering and Applications, 2021, 57(6): 267-273.
[6]	HU Xiaomin, WANG Mingfeng, ZHANG Shourong, LI Min. New Differential Evolution with Particle Swarm Optimization Algorithm for Text Clustering [J]. Computer Engineering and Applications, 2021, 57(4): 61-67.
[7]	LI Zhuangkuo, CHANG Kaixuan. Ant Colony Optimization for Continuous Domains Applied to Cooperative Game [J]. Computer Engineering and Applications, 2021, 57(24): 198-204.
[8]	WANG Jiayue, SHI Li. Research on Path Optimization and Charging Strategy of Electric Refrigerated Vehicle Considering Cost of Battery Capacity Degradation [J]. Computer Engineering and Applications, 2021, 57(24): 283-289.
[9]	CHEN Wanfen, WANG Yujia, LIN Weixing. Heterogeneous Ensemble Surrogate Assisted Multi-objective Particle Swarm Optimization Algorithm [J]. Computer Engineering and Applications, 2021, 57(23): 71-80.
[10]	DU Shouxin, WU Tao. Study on Application of Double Population Hybrid Genetic Algorithm in Cut Order Planning [J]. Computer Engineering and Applications, 2021, 57(22): 182-189.
[11]	LIN Weixing, WANG Yujia, CHEN Wanfen, LIANG Haina. High-Dimensional Data Feature Selection Algorithm Based on Multifactor Particle Swarm Optimization [J]. Computer Engineering and Applications, 2021, 57(22): 199-207.
[12]	HE Yaying, FAN Xinwei. Application of Improved Ant Colony Optimization in Robot Path Planning [J]. Computer Engineering and Applications, 2021, 57(16): 276-282.
[13]	LI Leixiao, DENG Dan, LI Jie, WANG Yongsheng. All-to-All Comparison Computing Data Distribution Strategy Based on Particle Swarm Optimization [J]. Computer Engineering and Applications, 2021, 57(15): 109-117.
[14]	ZHANG Ming, DENG Wenhan, LIN Juan, ZHONG Yiwen. Modified Ant Colony Optimization Algorithm for Discounted {0-1} Knapsack Problem [J]. Computer Engineering and Applications, 2021, 57(13): 85-95.
[15]	YU Guolong, ZHAO Yong, WU Lian, CUI Zhongwei. Improvement of QPSO Algorithm and Its Application in DBN Parameter Optimization [J]. Computer Engineering and Applications, 2021, 57(10): 154-162.

Hybrid ant colony and particle swarm algorithm for solving TSP

蚁群与粒子群混合算法求解TSP问题

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics