Abstract
High-Dimensional Dynamic Optimization Problems (HDDOPs) commonly exist in real-world applications. In evolutionary computation field, most of existing benchmark problems, which could simulate HDDOPs, are non-separable. Thus, we give a novel benchmark problem, called high-dimensional moving peaks benchmark to simulate separable, partially separable, and non-separable problems. Moreover, a hybrid Particle Swarm Optimization algorithm based on Grouping, Clustering and Memory strategies, i.e. GCM-PSO, is proposed to solve HDDOPs. In GCM-PSO, a differential grouping method is used to decompose a HDDOP into a number of sub-problems based on variable interactions firstly. Then each sub-problem is solved by a species-based particle swarm optimization, where the nearest better clustering is adopted as the clustering method. In addition, a memory strategy is also adopted in GCM-PSO. Experimental results show that GCM-PSO performs better than the compared algorithms in most cases.
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
References
Cruz, C., González, J.R., Pelta, D.A.: Optimization in dynamic environments: a survey on problems, methods and measures. Soft. Comput. 15(7), 1427–1448 (2011)
Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm and Evolutionary Computation. 6, 1–24 (2012)
Bu, C., Luo, W., Yue, L.: Continuous dynamic constrained optimization with ensemble of locating and tracking feasible regions strategies. IEEE Trans. Evol. Comput. 21(1), 14–33 (2016)
Tang, K., Yáo, X., Suganthan, P.N., MacNish, C., et al.: Benchmark functions for the CEC 2008 special session and competition on large scale global optimization. Nat. Inspir. Comput. Appl. Lab. USTC, China 24, 153–177 (2007)
Li, X., Tang, K., Omidvar, M.N., Yang, Z., et al.: Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Gene 7(33), 8 (2013)
Hu, X.-M., He, F.-L., Chen, W.-N., Zhang, J.: Cooperation coevolution with fast interdependency identification for large scale optimization. Inf. Sci. 381, 142–160 (2017)
Omidvar, M.N., Li, X., Yao, X.: Cooperative co-evolution with delta grouping for large scale non-separable function optimization. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2010)
Omidvar, M.N., Li, X., Mei, Y., Yao, X.: Cooperative co-evolution with differential grouping for large scale optimization. IEEE Trans. Evol. Comput. 18(3), 378–393 (2014)
Yang, Z., Tang, K., Yao, X.: Large scale evolutionary optimization using cooperative coevolution. Inf. Sci. 178(15), 2985–2999 (2008)
Yang, Z., Tang, K., Yao, X.: Multilevel cooperative coevolution for large scale optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 1663–1670. IEEE (2008)
Mei, Y., Omidvar, M.N., Li, X., Yao, X.: A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization. ACM Trans. Math. Softw. 42(2), 13 (2016)
Omidvar, M.N., Yang, M., Mei, Y., Li, X., et al.: DG2: a faster and more accurate differential grouping for large-scale black-box optimization. IEEE Trans. Evol. Comput. (2017). http://ieeexplore.ieee.org/abstract/document/7911173/
Preuss, M.: Niching the CMA-ES via nearest-better clustering. In: Proceedings of 12th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 1711–1718. ACM (2010)
Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 1875–1882. IEEE (1999)
Li, C., Yang, S., Nguyen, T., Yu, E., et al.: Benchmark generator for CEC 2009 competition on dynamic optimization. Technical report, University of Leicester, University of Birmingham, Nanyang Technological University (2008)
Li, C., Yang, S., Pelta, D.A.: Benchmark generator for the IEEE WCCI-2012 competition on evolutionary computation for dynamic optimization problems. Brunel University, UK (2011)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 69–73. IEEE (1998)
Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002)
Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC), pp. 81–86. IEEE (2001)
Parrott, D., Li, X.: Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans. Evol. Comput. 10(4), 440–458 (2006)
Das, S., Mandal, A., Mukherjee, R.: An adaptive differential evolution algorithm for global optimization in dynamic environments. IEEE Trans. Cybern. 44(6), 966–978 (2014)
Luo, W., Sun, J., Bu, C., Liang, H.: Species-based particle swarm optimizer enhanced by memory for dynamic optimization. Appl. Soft Comput. 47, 130–140 (2016)
Acknowledgment
This work is partly supported by the National Natural Science Foundation of China (No. 61573327).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Luo, W., Yang, B., Bu, C., Lin, X. (2017). A Hybrid Particle Swarm Optimization for High-Dimensional Dynamic Optimization. In: Shi, Y., et al. Simulated Evolution and Learning. SEAL 2017. Lecture Notes in Computer Science(), vol 10593. Springer, Cham. https://doi.org/10.1007/978-3-319-68759-9_81
Download citation
DOI: https://doi.org/10.1007/978-3-319-68759-9_81
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68758-2
Online ISBN: 978-3-319-68759-9
eBook Packages: Computer ScienceComputer Science (R0)