Open Access
2014 Applying Data Clustering Feature to Speed Up Ant Colony Optimization
Chao-Yang Pang, Ben-Qiong Hu, Jie Zhang, Wei Hu, Zheng-Chao Shan
Abstr. Appl. Anal. 2014(SI64): 1-8 (2014). DOI: 10.1155/2014/545391


Ant colony optimization (ACO) is often used to solve optimization problems, such as traveling salesman problem (TSP). When it is applied to TSP, its runtime is proportional to the squared size of problem N so as to look less efficient. The following statistical feature is observed during the authors’ long-term gene data analysis using ACO: when the data size N becomes big, local clustering appears frequently. That is, some data cluster tightly in a small area and form a class, and the correlation between different classes is weak. And this feature makes the idea of divide and rule feasible for the estimate of solution of TSP. In this paper an improved ACO algorithm is presented, which firstly divided all data into local clusters and calculated small TSP routes and then assembled a big TSP route with them. Simulation shows that the presented method improves the running speed of ACO by 200 factors under the condition that data set holds feature of local clustering.


Download Citation

Chao-Yang Pang. Ben-Qiong Hu. Jie Zhang. Wei Hu. Zheng-Chao Shan. "Applying Data Clustering Feature to Speed Up Ant Colony Optimization." Abstr. Appl. Anal. 2014 (SI64) 1 - 8, 2014.


Published: 2014
First available in Project Euclid: 27 February 2015

zbMATH: 07022595
Digital Object Identifier: 10.1155/2014/545391

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI64 • 2014
Back to Top