×

An improved central force optimization algorithm for multimodal optimization. (English) Zbl 1442.90182

Summary: This paper proposes the hybrid CSM-CFO algorithm based on the simplex method (SM), clustering technique, and central force optimization (CFO) for unconstrained optimization. CSM-CFO is still a deterministic swarm intelligent algorithm, such that the complex statistical analysis of the numerical results can be omitted, and the convergence intends to produce faster and more accurate by clustering technique and good points set. When tested against benchmark functions, in low and high dimensions, the CSM-CFO algorithm has competitive performance in terms of accuracy and convergence speed compared to other evolutionary algorithms: particle swarm optimization, evolutionary program, and simulated annealing. The comparison results demonstrate that the proposed algorithm is effective and efficient.

MSC:

90C30 Nonlinear programming
90C59 Approximation methods and heuristics in mathematical programming

Software:

GSA
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Leung, Y. W.; Wang, Y., An orthogonal genetic algorithm with quantization for global numerical optimization, IEEE Transactions on Evolutionary Computation, 5, 1, 41-53 (2001)
[2] Neto, R. F. T.; Filho, M. G., An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed, Computers & Operations Research, 38, 9, 1286-1293 (2011) · Zbl 1208.90078
[3] Green, R. C.; Wang, L.; Alam, M., Training neural networks using central force optimization and particle swarm optimization: insights and comparisons, Expert Systems with Applications, 39, 1, 555-563 (2012)
[4] Kirkpatrick, S.; Gelatto, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 4598, 671-680 (1983) · Zbl 1225.90162
[5] Rashedi, E.; Nezamabadi-pour, H.; Saryazdi, S., GSA: a Gravitational Search Algorithm, Information Sciences, 179, 13, 2232-2248 (2009) · Zbl 1177.90378
[6] Formato, R. A., Central force optimization: a new metaheuristic with applications in applied electromagnetics, Progress in Electromagnetics Research, 77, 425-491 (2007)
[7] Formato, R. A., Central force optimization: a new nature inspired computational framework for multidimensional search and optimization, Studies in Computational Intelligence, 129, 221-238 (2008)
[8] Formato, R. A., Central force optimization: a new deterministic gradient-like optimization metaheuristic, Opsearch, 46, 1, 25-51 (2009) · Zbl 1190.90289
[9] Formato, R. A., Improved cfo algorithm for antenna optimization, Progress In Electromagnetics Research B, 19, 405-425 (2010)
[10] Formato, R. A., Pseudorandomness in central force optimization, British Journal of Mathematics & Computer Science, 3, 3, 241-264 (2013)
[11] Nelder, J. A.; Mead, R., A simplex method for function minimization, The Computer Journal, 7, 2, 308-313 (1965)
[12] Ding, D.; Qi, D.; Luo, X.; Chen, J.; Wang, X.; Du, P., Convergence analysis and performance of an extended central force optimization algorithm, Applied Mathematics and Computation, 219, 4, 2246-2259 (2012) · Zbl 1291.90184
[13] 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, 3, 636-654 (2005) · Zbl 1071.90035
[14] Fan, S. S.; Zahara, E., A hybrid simplex search and particle swarm optimization for unconstrained optimization, European Journal of Operational Research, 181, 2, 527-548 (2007) · Zbl 1121.90116
[15] Qu, B. Y.; Liang, J. J.; Suganthan, P. N., Niching particle swarm optimization with local search for multi-modal optimization, Information Sciences, 197, 131-143 (2012)
[16] Zhang, L.; Zhang, B., Good point set based genetic algorithm, Chinese Journal of Computers, 24, 9, 917-922 (2001)
[17] Xiao, C.; Cai, Z.; Wang, Y., A good nodes set evolution strategy for constrained optimization, Proceedings of the IEEE Congress on Evolutionary Computation (CEC ’07)
[18] Yao, X.; Liu, Y.; Lin, G., Evolutionary programming made faster, IEEE Transactions on Evolutionary Computation, 3, 2, 82-102 (1999)
[19] Liang, J. J.; Suganthan, P. N.; Deb, K., Novel composition test functions for numerical global optimization, Proceedings of the IEEE Swarm Intelligence Symposium (SIS ’05)
[20] Hedar, A.-R.; Fukushima, M., Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization, Optimization Methods & Software, 17, 5, 891-912 (2002) · Zbl 1065.90081
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.