Particle swarm and ant colony algorithms hybridized for improved continuous optimization. (English) Zbl 1114.65334

Summary: 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.


65K05 Numerical mathematical programming methods
90C15 Stochastic programming
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI


[1] Paterlini, S.; Krink, T., Differential evolution and particle swarm optimisation in partitional clustering, Computational Statistics & Data Analysis, 50, 5, 1220-1247 (2006) · Zbl 1431.62268
[2] Dong, Y.; Tang, J.; Xu, B.; Wang, D., An application of swarm optimization to nonlinear programming, Computers & Mathematics with Applications, 49, 11-12, 1655-1668 (2005) · Zbl 1127.90407
[3] Ourique, C. O.; Biscaia, E. C.; Pinto, J. C., The use of particle swarm optimization for dynamical analysis in chemical processes, Computers & Chemical Engineering, 26, 12, 1783-1793 (2002)
[4] Shelokar, P. S.; Jayaraman, V. K.; Kulkarni, B. D., An ant colony classifier system: application to some process engineering problems, Computers & Chemical Engineering, 28, 9, 1577-1584 (2004)
[5] Dorigo, M.; Blum, C., Ant colony optimization theory: a survey, Theoretical Computer Science, 344, 2-3, 243-278 (2005) · Zbl 1154.90626
[6] Yin, P.-Y.; Wang, J.-Y., Ant colony optimization for the nonlinear resource allocation problem, Applied Mathematics & Computation, 174, 2, 1438-1453 (2006) · Zbl 1111.90068
[7] Shyu, S. J.; Lin, B. M.T.; Hsiao, T.-S., Ant colony optimization for the cell assignment problem in PCS networks, Computers & Operations Research, 33, 6, 1713-1740 (2006) · Zbl 1087.90042
[8] Fan, S.-K. S.; Liang, Y.-C.; Zahara, E., Hybrid simplex search and particle swarm optimization for the global optimization of multimodal functions, Engineering Optimization, 36, 4, 401-418 (2004)
[9] Liu, B.; Wang, L.; Jin, Y.-H.; Tang, F.; Huang, D.-X., Improved particle swarm optimization combined with chaos, Chaos Solitons & Fractals, 25, 1261-1271 (2005) · Zbl 1074.90564
[10] Angeline, P. J., Evolutionary optimization versus particle swarm optimization: philosophy and performance difference, (Porto, V. W.; etal., Proceedings of 7th Annual Conference on Evolutionary Programming. Proceedings of 7th Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, vol. 1447 (1998), Springer: Springer Berlin), 601-610
[11] Eberhart, R. C.; Kennedy, J., A new optimizer using particle swarm theory, (Proceedings of the Sixth International Symposium on Micromachine and Human Science (1995), Nagoya: Nagoya Japan), 39-43
[12] Shi, Y.; Eberhart, R. C., A modified particle swarm optimizer. A modified particle swarm optimizer, Proceedings of IEEE International Conference on Evolutionary Computation (1998), Anchorage: Anchorage Alaska
[13] Dréo, J.; Siarry, P., Continuous interacting ant colony algorithm based on dense heterarchy, Future Generation Computer Systems, 20, 841-856 (2004)
[14] Socha, K., ACO for continuous and mixed-variable optimization, (Dorigo, M.; etal., Lecture Notes in Computer Science, vol. 3172 (2004), Springer-Verlag: Springer-Verlag Berlin), 25-36
[15] Chelouah, R.; Siarry, P., Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions, European Journal of Operational Research, 148, 335-348 (2003) · Zbl 1035.90062
[16] Chelouah, R.; Siarry, P., A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions, European Journal of Operational Research, 161, 636-654 (2005) · Zbl 1071.90035
[17] Bäck, T., Evolutionary Algorithms in Theory and Practice (1996), Oxford University Press: Oxford University Press New York · Zbl 0877.68060
[18] Wei, L.; Zhao, M., A niche hybrid genetic algorithm for global optimization of continuous multimodal functions, Applied Mathematics & Computation, 160, 649-661 (2005) · Zbl 1062.65065
[19] Chelouah, R.; Siarry, P., A continuous genetic algorithm designed for the global optimization of multimodal functions, Journal of Heuristics, 6, 191-213 (2000) · Zbl 0969.68641
[20] Chelouah, R.; Siarry, P., Tabu search applied to global optimization, European Journal of Operational Research, 123, 256-270 (2000) · Zbl 0961.90037
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.