×

Chaos embedded particle swarm optimization algorithms. (English) Zbl 1198.90400

Summary: This paper proposes new particle swarm optimization (PSO) methods that use chaotic maps for parameter adaptation. This has been done by using of chaotic number generators each time a random number is needed by the classical PSO algorithm. Twelve chaos-embedded PSO methods have been proposed and eight chaotic maps have been analyzed in the benchmark functions. It has been detected that coupling emergent results in different areas, like those of PSO and complex dynamics, can improve the quality of results in some optimization problems. It has been also shown that, some of the proposed methods have somewhat increased the solution quality, that is in some cases they improved the global searching capability by escaping the local solutions.
Editorial remark: There are doubts about a proper peer-reviewing procedure of this journal. The editor-in-chief has retired, but, according to a statement of the publisher, articles accepted under his guidance are published without additional control.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
37D45 Strange attractors, chaotic dynamics of systems with hyperbolic behavior
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Kennedy J, Eberhart RC. Particle swarm optimization. In: Proceedings of the IEEE conference on neural networks, Perth, Australia; 1995. p. 1942-8.; Kennedy J, Eberhart RC. Particle swarm optimization. In: Proceedings of the IEEE conference on neural networks, Perth, Australia; 1995. p. 1942-8.
[2] Suganthan PN, Particle swarm optimizer with neighborhood operator. In: Proceedings of the 1999 congress of evolutionary computation, vol. 3. IEEE Press; 1999. p. 1958-62.; Suganthan PN, Particle swarm optimizer with neighborhood operator. In: Proceedings of the 1999 congress of evolutionary computation, vol. 3. IEEE Press; 1999. p. 1958-62.
[3] Caponetto, R.; Fortuna, L.; Fazzino, S.; Xibilia, M. G., Chaotic sequences to improve the performance of evolutionary algorithms, IEEE Trans Evol Comput, 7, 3, 289-304 (2003)
[4] Schuster HG. Deterministic chaos: an introduction. 2nd revised ed. Weinheim, Federal Republic of Germany: Physick-Verlag GmnH; 1988.; Schuster HG. Deterministic chaos: an introduction. 2nd revised ed. Weinheim, Federal Republic of Germany: Physick-Verlag GmnH; 1988.
[5] Wong, K.; Man, K. P.; Li, S.; Liao, X., More secure chaotic cryptographic scheme based on dynamic look-up table circuits, Syst Signal Process, 24, 5, 571-584 (2005) · Zbl 1103.94019
[6] Suneel, M., Chaotic sequences for secure CDMA (2006), Ramanujan Institute for Advanced Study in Mathematics, p. 1-4
[7] Arena, P.; Caponetto, R.; Fortuna, L.; Rizzo, A.; La Rosa, M., Self organization in non recurrent complex system, Int J Bifurc Chaos, 10, 5, 1115-1125 (2000)
[8] Manganaro, G.; Pine dade Gyvez, J., DNA computing based on chaos, Proceedings of the 1997 IEEE international conference on evolutionary computation (1997), IEEE Press: IEEE Press Piscataway (NJ), p. 255-60
[9] Gao, H.; Zhang, Y.; Liang, S.; Li, D. A., New chaotic algorithm for image encryption, Chaos, Solitons & Fractals, 29, 393-399 (2006) · Zbl 1096.94006
[10] Liu, D.; Cao, Y. A., Chaotic genetic algorithm for fuzzy grid job scheduling, IEEE Int Conf Comput Intell Secur, 1, 320-323 (2006)
[11] Zuo, X. Q.; Fan, Y. S.A., Chaos search immune algorithm with its application to neuro-fuzzy controller design, Chaos, Solitons & Fractals, 30, 94-109 (2006) · Zbl 1221.92003
[12] Zhigang, L.; Xingsheng, G.; Bin, J., A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan, Chaos, Solitons & Fractals, 35, 5, 851-861 (2008) · Zbl 1146.90418
[13] Shi, Y.; Eberhart, R. C.A., Modified particle swarm optimizer, IEEE Int Conf Comput Intell, 69-73 (1998)
[14] Shi, Y.; Eberhart, R. C., Parameter selection in particle swarm optimization. evolutionary programming VII. Parameter selection in particle swarm optimization. evolutionary programming VII, Lecture notes in computer science, 1447 (1998), Springer, p. 591-600
[15] Carlisle A, Dozier G. An offthe-Shelf PSO. In: The particle swarm optimization workshop; 2001. p. 1-6.; Carlisle A, Dozier G. An offthe-Shelf PSO. In: The particle swarm optimization workshop; 2001. p. 1-6.
[16] Shi, Y.; Eberhart, R. C., Empirical study of particle swarm optimization, (Proceedings of the 1999 IEEE congress on evolutionary computation (1999), IEEE Press: IEEE Press Piscataway (NJ)), 1945-1950
[17] Shi, Y.; Eberhart, R. C., Parameter selection in particle swarm optimization, (Proceedings of the 7th international conference on evolutionary programming VII. Proceedings of the 7th international conference on evolutionary programming VII, LNCS, vol. 1447 (1998), Springer-Verlag: Springer-Verlag New York), 591-600
[18] Zheng, Y. L.; Ma, L. H.; Zhang, L. Y.; Qian, J. X., On the convergence analysis and parameter selection in particle swarm optimization, (Proceedings of the 2003 IEEE international conference on machine learning and cybernetics (2003), IEEE Press: IEEE Press Piscataway (NJ)), 1802-1807
[19] Zheng, Y. L.; Ma, L. H.; Zhang, L. Y.; Qian, J. X., Empirical study of particle swarm optimizer with an increasing inertia weight, (Proceedings of the 2003 IEEE congress on evolutionary computation (2003), IEEE Press: IEEE Press Piscataway (NJ)), 221-226
[20] Jiao, B., A dynamic inertia weight particle swarm optimization algorithm, Chaos, Solitons & Fractals, 37, 3, 698-705 (2008) · Zbl 1146.90533
[21] Shi Y, Eberhart, RC. Fuzzy adaptive particle swarm optimization. In: Proceedings of the 2001 congress on evolutionary computation, vol. 1; 2001. p. 101-6.; Shi Y, Eberhart, RC. Fuzzy adaptive particle swarm optimization. In: Proceedings of the 2001 congress on evolutionary computation, vol. 1; 2001. p. 101-6.
[22] Zhang L, Yu H, Hu S. A new approach to improve particle swarm optimization. GECCO 2003. LNCS, vol. 2723; 2003. p. 134-9.; Zhang L, Yu H, Hu S. A new approach to improve particle swarm optimization. GECCO 2003. LNCS, vol. 2723; 2003. p. 134-9. · Zbl 1028.68943
[23] Eberhart, E.; Shi, Y., Tracking and optimizing dynamic systems with particle swarms, (Proceedings of the 2001 IEEE congress on evolutionary computation (2001), IEEE Press: IEEE Press Piscataway (NJ)), 94-100
[24] Park, J. B.; Jeong, Y. W.; Kim, H. H.; Shin, J. R., An improved particle swarm optimization for economic dispatch with valve-point effect, Int J Innov Energ Syst Power, 1, 1, 1-7 (2006)
[25] Jiang, C.; Etorre, B. A., Hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimization, Math Comput Simul, V 68, 57-65 (2005) · Zbl 1108.90048
[26] Ratnaweera, A.; Halgamure, S. K.; Watson, H. C., Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients, IEEE Trans Evol Comput, 8, 240-255 (2004)
[27] Arumugam, M. S.; Rao, M. V.C., On the performance of the particle swarm optimization algorithm with various inertia weight variants for computing optimal control of a class of hybrid systems, Discrete Dyn Nat Soc, 1-17 (2006) · Zbl 1101.49025
[28] Arumugam MS, Rao MVC, Chandramohan A. Competitive approaches to PSO algorithms via new acceleration coefficient variant with mutation operators. In: Proceedings of the fifth international conference on computational intelligence and multimedia applications (ICCIMA’05). IEEE Comp. Sci. Press; 2005. p. 225-30.; Arumugam MS, Rao MVC, Chandramohan A. Competitive approaches to PSO algorithms via new acceleration coefficient variant with mutation operators. In: Proceedings of the fifth international conference on computational intelligence and multimedia applications (ICCIMA’05). IEEE Comp. Sci. Press; 2005. p. 225-30.
[29] Coelho, L.d. S.; Mariani, V. C., A novel chaotic particle swarm optimization approach using He’non map and implicit filtering local search for economic load dispatch, Chaos, Solitons & Fractals, 39, 2, 510-518 (2009)
[30] Chuanwen, J.; Bompard, E. A., Self-adaptive chaotic particle swarm algorithm for short term hydroelectric system scheduling in deregulated environment, Energy Convers Manage, 46, 2689-2696 (2005)
[31] Coelho, L.d. S., A quantum particle swarm optimizer with chaotic mutation operator, Chaos, Solitons & Fractals, 37, 5, 1409-1418 (2008)
[32] Liu, B.; Wang, L.; Jin, Y.; Tang, F.; Huang, D., Improved particle swarm optimization combined with chaos, Chaos, Solitons & Fractals, v25, 1261-1271 (2005) · Zbl 1074.90564
[33] Heidari-Bateni, G.; McGillem, C. D.A., Chaotic direct-sequence spread spectrum communication system, IEEE Trans Commun, 42, 2/3/4, 1524-1527 (1994)
[34] Trelea, I. C., The particle swarm optimization algorithm: convergence analysis and parameter selection, Inf Process Lett, 85, 6, 317-325 (2003) · Zbl 1156.90463
[35] May, R. M., Simple mathematical models with very complicated dynamics, Nature, 261, 459 (1976) · Zbl 1369.37088
[36] Peitgen, H.; Jurgens, H.; Saupe, D., Chaos and fractals (1992), Springer-Verlag: Springer-Verlag Berlin, Germany · Zbl 0779.58004
[37] Zheng, W. M., Kneading plane of the circle map, Chaos, Solitons & Fractals, 4, 1221 (1994) · Zbl 0817.58030
[38] Peterson G. Arnold’s cat map. Math 45 - Linear algebra fall; 1997.; Peterson G. Arnold’s cat map. Math 45 - Linear algebra fall; 1997.
[39] Ya, G., Sinai, Russ Math Surv, 27, 21 (1972)
[40] Zaslavskii, G. M., The simplest case of a strange attractor, Phys Lett A, 69, 145-147 (1978)
[41] Griewangk, A. O., Generalized descent of global optimization, J Optim Theor Appl, 34, 11-39 (1981) · Zbl 0431.49036
[42] Rastrigin, L. A., External control systems, (Theoretical foundations of engineering cybernetics series (1974), Nauka: Nauka Moscow, Russian) · Zbl 0284.49002
[43] De Jong K. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan; 1975.; De Jong K. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan; 1975.
[44] Digalakis, J. G.; Margaritis, K. G., An experimental study of benchmarking functions for genetic algorithms, Int J Comput Math, 79, 4, 403-416 (2002) · Zbl 1147.68881
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.