Abstract
To solve the problem of premature convergence in traditional particle swarm optimization (PSO), This paper proposed a adaptive mutation opposition-based particle swarm optimization (AMOPSO). The new algorithm applies adaptive mutation selection strategy (AMS) on the basis of generalized opposition-based learning method (GOBL) and a nonlinear inertia weight (AW). GOBL strategy can provide more chances to find solutions by space transformation search and thus enhance the global exploitation ability of PSO. However, it will increase likelihood of being trapped into local optimum. In order to avoid above problem, AMS is presented to disturb the current global optimal particle and adaptively gain mutation position. This strategy is helpful to improve the exploration ability of PSO and make the algorithm more smoothly fast convergence to the global optimal solution. In order to further balance the contradiction between exploration and exploitation during its iteration process, AW strategy is introduced. Through compared with several opposition-based PSOs on 14 benchmark functions, the experimental results show that AMOPSO greatly enhance the performance of PSO in terms of solution accuracy, convergence speed and algorithm reliability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, Perth, Australia, pp. 1942–1948 (1995)
Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of 6th International Symposium on Micro-machine Human Science, Nagoya, Japan, pp. 39–43 (1995)
Dehuri, S., Nanda, B.K., Cho, S.-B.: A hybrid APSO-aided learnable Bayesian classifier. In: IICAI, pp. 695–706 (2009)
Dehuri, S., Roy, R., Cho, S.-B.: An adaptive binary PSO to learn Bayesian classifier for prognostic modeling of metabolic syndrome. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 495–501, 12–16 July 2011
Ismail, A., Engelbrecht, A.P.: Self-adaptive particle swarm optimization. In: Bui, L.T., Ong, Y.S., Hoai, N.X., Ishibuchi, H., Suganthan, P.N. (eds.) SEAL 2012. LNCS, vol. 7673, pp. 228–237. Springer, Heidelberg (2012)
Zhan, Z.H., Zhang, J., Li, Y., Chung, H.S.H.: Adaptive particle swarm optimization. IEEE Trans. Syst. Man Cybern. Part B 39, 1369–1381 (2009)
Shi, Y., Eberhart, R.C.: Parameter selection in particle swarm optimization. In: Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, New York, pp. 591–600 (1998)
Zhang, W., Liu, Y., Clerc, M.: An adaptive PSO algorithm for reactive power optimization In: Proceedings of 6th International Conference Advances in Power System Control, Operation and Management, pp. 302–307, November 2003
Mengqi, H., Teresa, W., Weir, J.D.: An adaptive particle swarm optimization with multiple adaptive methods. IEEE Trans. Evol. Comput. 17, 705–720 (2013)
Karafotias, G., Hoogendoorn, M., Eiben, A.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19(2), 167–187 (2015)
Wang H., Li, H., Liu, Y., et al.: Opposition-based particle swarm algorithm with Cauchy mutation. In: Proceedings of IEEE Congress on Evolutionary Computation, Tokyo, pp. 356–360 (2007)
Wang, H., Wang, W.J., Wu, Z.J.: Particle swarm optimization with adaptive mutation for multimodal optimization. Appl. Math. Comput. 221, 296–305 (2013)
Pehlivanoglu, Y.V.: A new particle swarm optimization method enhanced with a periodic mutation strategy and neural networks. IEEE Trans. Evol. Comput. 17(3), 436–452 (2013)
Wang Hui, H., Zhijian, W., Rahnamayan, S., et al.: Enhancing particle swarm optimization using generalized opposition-based learning. Inf. Sci. 181, 4699–4714 (2011)
Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of IEEE World Congress Computational Intelligence, pp. 69–73 (1998)
Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of IEEE International Conference of Intelligent for Modeling, Control and Automation. PiscatAWay: Institute of Electrical and Electronics Engineers Computer Society, pp. 695–701 (2005)
Wang, H., Wu, Z., Liu, Y., Wang, J., Jiang, D., Chen, L.: Space transformation search: a new evolutionary technique. In: Proceedings of World Summit Genetic Evolution Computer, pp. 537–544 (2009)
Ozcan, E., Mohan, C.K.: Particle swarm optimization: surfing and waves. In: Proceedings of Congress on Evolutionary Computation (CEC 1999), Washington DC, pp. 1939–1944 (1999)
van den Bergh, F., Engelbrecht, A.P.: Effect of swarm size on cooperative particle swarm optimizers. In: Genetic and Evolutionary Computation Conference, San Francisco, USA, pp. 892–899 (2001)
Gong, C., Wang, Z.: Proficient optimization calculation in MATLAB. Electronic Industry Press, Beijing (2012)
Zhou, X.Y., Wu, Z.J., Wang, H., et al.: Elite opposition based particle swarm optimization. Acta Electron. Sin. 41(8), 1647–1652 (2013)
Acknowledgment
We would like to thank the editors and the anonymous reviewers for their valuable comment and suggestions. This work was supported by the National Natural Science Foundation of China (No. 61170305, No. 61573157).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Kang, L., Dong, W., Li, K. (2016). Adaptive Mutation Opposition-Based Particle Swarm Optimization. In: Li, K., Li, J., Liu, Y., Castiglione, A. (eds) Computational Intelligence and Intelligent Systems. ISICA 2015. Communications in Computer and Information Science, vol 575. Springer, Singapore. https://doi.org/10.1007/978-981-10-0356-1_12
Download citation
DOI: https://doi.org/10.1007/978-981-10-0356-1_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0355-4
Online ISBN: 978-981-10-0356-1
eBook Packages: Computer ScienceComputer Science (R0)