Abstract
Chaos optimization algorithms (COAs) utilize the chaotic map to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. Many existing applications show that COAs escape from the local minima more easily than classical stochastic optimization algorithms. However, the search efficiency of COAs crucially depends on appropriately starting values. In view of the limitation of COAs, a novel mutative-scale pseudo-parallel chaos optimization algorithm (MPCOA) with cross and merging operation is proposed in this paper. Both cross and merging operation can exchange information within population and produce new potential solutions, which are different from those generated by chaotic sequences. In addition, mutative-scale search space is used for elaborate search by continually reducing the search space. Consequently, a good balance between exploration and exploitation can be achieved in the MPCOA. The impacts of different chaotic maps and parallel numbers on the MPCOA are also discussed. Benchmark functions and parameter identification problem are used to test the performance of the MPCOA. Simulation results, compared with other algorithms, show that the MPCOA has good global search capability.








Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Alatas B (2010) Chaotic harmony search algorithms. Appl Math Comput 216(9):2687–2699
Arunkumar R, Jothiprakash V (2013) Chaotic evolutionary algorithms for multi-reservoir optimization. Water Resour Manag 27(15):5207–5222
Askarzadeh A (2013) A discrete chaotic harmony search-based simulated annealing algorithm for optimum design of PV/wind hybrid system. Solar Energy 97:93–101
Brest J, Greiner S, Boskovic B, Mernik M, Zumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evol Comput 10(6):646–657
Chen SS (2011) Chaotic simulated annealing by a neural network with a variable delay: design and application. IEEE Trans Neural Netw 22(10):1557–1565
Chen JY, Lin QZ, Ji Z (2011) Chaos-based multi-objective immune algorithm with a fine-grained selection mechanism. Soft Comput 15(7):1273–1288
Cheng MY, Huang KY, Chen HM (2012) K-means particle swarm optimization with embedded chaotic search for solving multidimensional problems. Appl Math Comput 219(6):3091–3099
Coelho LD, Pessoa MW (2011) A tuning strategy for multivariable PI and PID controllers using differential evolution combined with chaotic Zaslavskii map. Expert Syst Appl 38(11):13694–13701
Coelho LD, Mariani VC (2012) Firefly algorithm approach based on chaotic Tinkerbell map applied to multivariable PID controller tuning. Comput Math Appl 64(8):2371–2382
Davendra D, Senkerik R, Zelinka I, Pluhacek M, Bialic-Davendra M (2014) Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time. Soft Comput 18(4):669–681
Hamaizia T, Lozi R, Hamri NE (2012) Fast chaotic optimization algorithm based on locally averaged strategy and multifold chaotic attractor. Appl Math Comput 219(1):188–196
He D, He C, Jiang LG, Zhu HW, Yu GR (2001 Chaotic characteristics of a onedimensional iterative map with infinite collapses. In: IEEE transactions on circuits and systems I: fundamental theory and applications, vol 48, no 7, pp 900–906
Ho SL, Yang SY (2012) A fast robust optimization methodology based on polynomial chaos and evolutionary algorithm for inverse problems. IEEE Trans Magn 48(2):259–262
Hong WC (2011) Traffic flow forecasting by seasonal SVR with chaotic simulated annealing algorithm. Neurocomputing 74(12-13):2096–2107
Igel C, Hansen N, Roth S (2007) Covariance matrix adaptation for multi-objective optimization. Evol Comput 15(1):1–28
Kromer P, Zelinka I, Snasel V (2014) Behaviour of pseudo-random and chaotic sources of stochasticity in nature-inspired optimization methods. Soft Comput 18(4):619–629
Li B, Jiang WS (1998) Optimizing complex function by chaos search. Cybern Syst 29(4):409–419
Li YY, Wen QY, Zhang BH (2012) Chaotic ant swarm optimization with passive congregation. Nonlinear Dyn 68(1–2):129–136
Liu LZ, Zhang JQ, Xu GX, Liang LS, Huang SF (2013) A modified chaotic ant swarm optimization algorithm. Acta Phys Sinica 62(17):170501
Ma ZS (2012) Chaotic populations in genetic algorithms. Appl Soft Comput 12(8):2409–2424
Okamoto T, Hirata H (2013) Global optimization using a multipoint type quasi-chaotic optimization method. Appl Soft Comput 13(2):1247–1264
Pluhacek M, Senkerik R, Zelinka I (2014) Particle swarm optimization algorithm driven by multichaotic number generator. Soft Comput 18(4):631–639
Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: IEEE CEC 2005. Proceedings of IEEE congress on evolutionary computation, vol 2, pp 1785–1791
Tavazoei MS, Haeri M (2007) Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187(2):1076–1085
Thangaraj R, Pant M, Abraham A (2011) Particle swarm optimization: hybridization perspectives and experimental illustrations. Appl Math Comput 217(12):5208–5226
Wan M, Wang C, Li L, Yang Y (2012) Chaotic ant swarm approach for data clustering. Appl Soft Comput 12(8):2387–2393
Wu Q (2011) A self-adaptive embedded chaotic particle swarm optimization for parameters selection of Wv-SVM. Expert Syst Appl 38(1):184–192
Yang DX, Gang L, Cheng GD (2006) Convergence analysis of first order reliability method using chaos theory. Comput Struct 84(8–9):563–571
Yang DX, Li G, Cheng GD (2007) On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fractals 34(4):1366–1375
Yang YM, Wang YN, Yuan XF, Yin F (2012) Hybrid chaos optimization algorithm with artificial emotion. Appl Math Comput 218(11):6585–6611
Yang DX, Liu ZJ, Zhou JL (2014) Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization. Commun Nonlinear Sci Numer Simul 19(4):1229–1246
Yuan XF, Wang YN, Wu LH (2007) Parallel chaotic optimization algorithm based on competitive-cooperative inter-communication. Control Decis 22(9):1027–1031
Yuan XF, Wang YN (2008) Parameter selection of support vector machine for function approximation based on chaos optimization. J Syst Eng Electr 19(1):191–197
Yuan XF, Yang YM, Wang H (2012) Improved parallel chaos optimization algorithm. Appl Math Comput 219(8):3590–3599
Yuan XF, Zhao JY, Yang YM, Wang YN (2014) Hybrid parallel chaos optimization algorithm with harmony search algorithm. Appl Soft Comput 17:12–22
Zhu Q, Yuan XF, Wang H (2012) An improved chaos optimization algorithm-based parameter identification of synchronous generator. Electr Eng 94(3):147–153
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
This work was supported in part by the National Natural Science Foundation of China (No. 61104088, No. 61203309) and Young Teachers Promotion Program of Hunan University .
Rights and permissions
About this article
Cite this article
Yuan, X., Dai, X. & Wu, L. A mutative-scale pseudo-parallel chaos optimization algorithm. Soft Comput 19, 1215–1227 (2015). https://doi.org/10.1007/s00500-014-1336-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-014-1336-3