By Topic

Parallel Ant Colony Optimization Algorithms for Time Series Segmentation on a Multi-core Processor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huibin Liu ; Sch. of Math. & Comput. Sci., Fuzhou Univ., Fuzhou, China ; Zhenfeng He

This paper proposes four novel parallelization methods of a modified Ant Colony Optimization algorithm. The parallelization methods are aiming at finding the optimal segmentation scheme of time series with a low execution time. The series is decomposed into different sub-series firstly, and then each sub-series can be solved by colonies independently, finally merge the solutions of each colony to obtain the full segmentation scheme. According to the synchronization of individuals and colonies, we design four types of dual parallel models, and implement the parallel versions by using OpenMP library on a computing platform with a multi-core processor for time series segmentation. Experiment results suggest that the parallel algorithms can greatly shorten the execution time without reducing the quality of the final solution.

Published in:

Intelligent Human-Machine Systems and Cybernetics (IHMSC), 2012 4th International Conference on  (Volume:1 )

Date of Conference:

26-27 Aug. 2012