Particle swarm and ant colony algorithms hybridized for improved continuous optimization

This paper proposes PSACO (particle swarm ant colony optimization) algorithm for highly non-convex optimization problems. Both particle swarm optimization (PSO) and ant colony optimization (ACO) are co-operative, population-based global search swarm intelligence metaheuristics. PSO is inspired by social behavior of bird flocking or fish schooling, while ACO imitates foraging behavior of real life ants. In this study, we explore a simple pheromone-guided mechanism to improve the performance of PSO method for optimization of multimodal continuous functions. The proposed PSACO algorithm is tested on several benchmark functions from the usual literature. Numerical results comparisons with different metaheuristics demonstrate the effectiveness and efficiency of the proposed PSACO method.

[1]  Jingyu Wang,et al.  Ant colony optimization for the nonlinear resource allocation problem , 2006, Appl. Math. Comput..

[2]  Patrick Siarry,et al.  Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[3]  Patrick Siarry,et al.  Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions , 2003, Eur. J. Oper. Res..

[4]  Bhaskar D. Kulkarni,et al.  An ant colony classifier system: application to some process engineering problems , 2004, Comput. Chem. Eng..

[5]  J. Dréo,et al.  Continuous interacting ant colony algorithm based on dense heterarchy , 2004, Future Gener. Comput. Syst..

[6]  Mei Zhao,et al.  A niche hybrid genetic algorithm for global optimization of continuous multimodal functions , 2005, Appl. Math. Comput..

[7]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[8]  Bertrand M. T. Lin,et al.  Ant colony optimization for the cell assignment problem in PCS networks , 2006, Comput. Oper. Res..

[9]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Y. Dong,et al.  An application of swarm optimization to nonlinear programming , 2005 .

[12]  Bo Liu,et al.  Improved particle swarm optimization combined with chaos , 2005 .

[13]  Patrick Siarry,et al.  A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions , 2005, Eur. J. Oper. Res..

[14]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[15]  Sandra Paterlini,et al.  Differential evolution and particle swarm optimisation in partitional clustering , 2006, Comput. Stat. Data Anal..

[16]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[17]  Patrick Siarry,et al.  A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions , 2000, J. Heuristics.

[18]  Krzysztof Socha,et al.  ACO for Continuous and Mixed-Variable Optimization , 2004, ANTS Workshop.

[19]  Shu-Kai S. Fan,et al.  Hybrid simplex search and particle swarm optimization for the global optimization of multimodal functions , 2004 .

[20]  E. Biscaia,et al.  The use of particle swarm optimization for dynamical analysis in chemical processes , 2002 .