Third International Conference on Natural Computation (ICNC 2007) (2007)
Haikou, Hainan, China
Aug. 24, 2007 to Aug. 27, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNC.2007.585
Ying Lin , Sun Yat-Sen University, China
HuaChun Cai , Sun Yat-Sen University, China
Jing Xiao , Sun Yat-Sen University, China
Jun Zhang , Sun Yat-Sen University, China
This paper presents a pseudo parallel ant colony optimization (ACO) algorithm in continuous domain. The variables of a solution are optimized by two parallel cooperative ACO-based processes, either of which attacks a relatively-independent sub-component of the original problem. Both processes contain tunable and untunable solution vectors. The best tunable vector migrates into the other process as an untunable vector through a migration controller, in which the migration strategy is synchronously sprung or adaptively controlled according to the temporal stagnation situation. Implementation of this mechanism is suitable for hardware which supports parallel computation, resulting in decline of unit computational cost and improvement of training speed. Optimization to a set of benchmark functions is carried out to prove the feasibility and efficiency of this parallel ACO algorithm.
J. Zhang, Y. Lin, J. Xiao and H. Cai, "Pseudo Parallel Ant Colony Optimization for Continuous Functions," Third International Conference on Natural Computation (ICNC 2007)(ICNC), Haikou, Hainan, China, 2007, pp. 494-500.