Pseudo Parallel Ant Colony Optimization for Continuous Functions

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.

[1]  Cheng-Fa Tsai,et al.  A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..

[2]  Marco Dorigo,et al.  Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..

[3]  Gabriele Kotsis,et al.  Parallelization strategies for the ant system , 1998 .

[4]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

[5]  Cyril Fonlupt,et al.  Parallel Ant Colonies for Combinatorial Optimization Problems , 1999, IPPS/SPDP Workshops.

[6]  Thomas Stützle,et al.  Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.

[7]  Andrew Lewis,et al.  A Parallel Implementation of Ant Colony Optimization , 2002, J. Parallel Distributed Comput..

[8]  Cheng-Fa Tsai,et al.  A new approach for solving large traveling salesman problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[9]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[10]  Kenneth A. De Jong,et al.  A Cooperative Coevolutionary Approach to Function Optimization , 1994, PPSN.

[11]  Paul Levi,et al.  A new approach to exploiting parallelism in ant colony optimization , 2002, Proceedings of 2002 International Symposium on Micromechatronics and Human Science.

[12]  Jun Zhang,et al.  Continuous Function Optimization Using Hybrid Ant Colony Approach with Orthogonal Design Scheme , 2006, SEAL.

[13]  Hartmut Schmeck,et al.  Information Exchange in Multi Colony Ant Algorithms , 2000, IPDPS Workshops.

[14]  Eugene P. W. Tam,et al.  Pseudo-coevolutionary genetic algorithms for power electronic circuits optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[15]  Yan Ge,et al.  A hybrid ant colony algorithm for global optimization of continuous multi-extreme functions , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[16]  Henry Shu-Hung Chung,et al.  Pseudocoevolutionary genetic algorithms for power electronic circuits optimization , 2006 .