Scaling Up Dynamic Optimization Problems: A Divide-and-Conquer Approach

Scalability is a crucial aspect of designing efficient algorithms. Despite their prevalence, large-scale dynamic optimization problems are not well studied in the literature. This paper is concerned with designing benchmarks and frameworks for the study of large-scale dynamic optimization problems. We start by a formal analysis of the moving peaks benchmark (MPB) and show its nonseparable nature irrespective of its number of peaks. We then propose a composite MPB suite with exploitable modularity covering a wide range of scalable partially separable functions suitable for the study of large-scale dynamic optimization problems. The benchmark exhibits modularity, heterogeneity, and imbalance features to resemble real-world problems. To deal with the intricacies of large-scale dynamic optimization problems, we propose a decomposition-based coevolutionary framework which breaks a large-scale dynamic optimization problem into a set of lower-dimensional components. A novel aspect of the framework is its efficient bi-level resource allocation mechanism which controls the budget assignment to components and the populations responsible for tracking multiple moving optima. Based on a comprehensive empirical study on a wide range of large-scale dynamic optimization problems with up to 200-D, we show the crucial role of problem decomposition and resource allocation in dealing with these problems. The experimental results clearly show the superiority of the proposed framework over three other approaches in solving large-scale dynamic optimization problems.

[1]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[2]  Xiaodong Li,et al.  Efficient Resource Allocation in Cooperative Co-Evolution for Large-Scale Global Optimization , 2017, IEEE Transactions on Evolutionary Computation.

[3]  Arvind S. Mohais,et al.  DynDE: a differential evolution for dynamic optimization problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[5]  Jürgen Branke,et al.  Robust Optimization Over Time by Learning Problem Space Characteristics , 2019, IEEE Transactions on Evolutionary Computation.

[6]  Xiaodong Li,et al.  DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box Optimization , 2017, IEEE Transactions on Evolutionary Computation.

[7]  Mike Preuss,et al.  Niching the CMA-ES via nearest-better clustering , 2010, GECCO '10.

[8]  John J. Grefenstette,et al.  Evolvability in dynamic fitness landscapes: a genetic algorithm approach , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Saman K. Halgamuge,et al.  A Recursive Decomposition Method for Large Scale Continuous Optimization , 2018, IEEE Transactions on Evolutionary Computation.

[10]  Yi Jiang,et al.  Applying Multi-Swarm Accelerating Particle Swarm Optimization to Dynamic Continuous Functions , 2009, 2009 Second International Workshop on Knowledge Discovery and Data Mining.

[11]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

[12]  Bin Yang,et al.  A Hybrid Particle Swarm Optimization for High-Dimensional Dynamic Optimization , 2017, SEAL.

[13]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[14]  Jürgen Branke,et al.  Multiswarms, exclusion, and anti-convergence in dynamic environments , 2006, IEEE Transactions on Evolutionary Computation.

[15]  Steven C. H. Hoi,et al.  Online Deep Learning: Learning Deep Neural Networks on the Fly , 2017, IJCAI.

[16]  R. Paul Wiegand,et al.  An empirical analysis of collaboration methods in cooperative coevolutionary algorithms , 2001 .

[17]  Nam Ho-Nguyen,et al.  Exploiting problem structure in optimization under uncertainty via online convex optimization , 2017, Mathematical Programming.

[18]  Uwe Aickelin,et al.  Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem , 2000, ArXiv.

[19]  Xin Yao,et al.  Benchmark Generator for CEC'2009 Competition on Dynamic Optimization , 2008 .

[20]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[21]  Xiaodong Li,et al.  Designing benchmark problems for large-scale continuous optimization , 2015, Inf. Sci..

[22]  Changhe Li,et al.  A Generalized Approach to Construct Benchmark Problems for Dynamic Optimization , 2008, SEAL.

[23]  Philip S. Yu,et al.  A Framework for Projected Clustering of High Dimensional Data Streams , 2004, VLDB.

[24]  Janez Brest,et al.  Dynamic optimization using Self-Adaptive Differential Evolution , 2009, 2009 IEEE Congress on Evolutionary Computation.

[25]  Anne Auger,et al.  Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[26]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[27]  Ming Yang,et al.  An Adaptive Multi-Swarm Optimizer for Dynamic Optimization Problems , 2014, Evolutionary Computation.

[28]  Shahryar Rahnamayan,et al.  Multilevel framework for large-scale global optimization , 2017, Soft Comput..

[29]  Xiaodong Li,et al.  A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization , 2016, ACM Trans. Math. Softw..

[30]  Ronald W. Morrison,et al.  Designing Evolutionary Algorithms for Dynamic Environments , 2004, Natural Computing Series.

[31]  Alireza Sepas-Moghaddam,et al.  A Novel Approach for Optimization in Dynamic Environments Based on Modified Artificial Fish Swarm Algorithm , 2016, Int. J. Comput. Intell. Appl..

[32]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[33]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[34]  Xin Yao,et al.  A framework for finding robust optimal solutions over time , 2013, Memetic Comput..

[35]  Changhe Li,et al.  A survey of swarm intelligence for dynamic optimization: Algorithms and applications , 2017, Swarm Evol. Comput..

[36]  Trung Thanh Nguyen,et al.  Continuous dynamic optimisation using evolutionary algorithms , 2011 .

[37]  Shahryar Rahnamayan,et al.  Cooperative co-evolution with sensitivity analysis-based budget assignment strategy for large-scale global optimization , 2017, Applied Intelligence.

[38]  C. J. Price,et al.  Exploiting problem structure in pattern search methods for unconstrained optimization , 2006, Optim. Methods Softw..

[39]  Yongsheng Ding,et al.  A multi-objective approach to robust optimization over time considering switching cost , 2017, Inf. Sci..

[40]  Xiaodong Li,et al.  Effective decomposition of large-scale separable continuous functions for cooperative co-evolutionary algorithms , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[41]  Ponnuthurai Nagaratnam Suganthan,et al.  Benchmark Functions for the CEC'2013 Special Session and Competition on Large-Scale Global Optimization , 2008 .

[42]  Shengxiang Yang,et al.  A prediction strategy based on center points and knee points for evolutionary dynamic multi-objective optimization , 2017, Appl. Soft Comput..

[43]  Graham Kendall,et al.  An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems , 2016, Knowl. Based Syst..

[44]  Roberto Santana,et al.  Gray-box optimization and factorized distribution algorithms: where two worlds collide , 2017, ArXiv.

[45]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[46]  Ming Yang,et al.  An Adaptive Multipopulation Framework for Locating and Tracking Multiple Optima , 2016, IEEE Transactions on Evolutionary Computation.

[47]  Changhe Li,et al.  A clustering particle swarm optimizer for dynamic optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[48]  Changhe Li,et al.  A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments , 2010, IEEE Transactions on Evolutionary Computation.

[49]  H. H. Rosenbrock,et al.  An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[50]  Xiaodong Li,et al.  Cooperative Co-evolution for large scale optimization through more frequent random grouping , 2010, IEEE Congress on Evolutionary Computation.

[51]  Xiaodong Li,et al.  Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale , 2009 .

[52]  Carlos Cruz,et al.  Optimization in dynamic environments: a survey on problems, methods and measures , 2011, Soft Comput..

[53]  Xin Yao,et al.  Robust Optimization Over Time: Problem Difficulties and Benchmark Problems , 2015, IEEE Transactions on Evolutionary Computation.

[54]  Xiaodong Li,et al.  Smart use of computational resources based on contribution for cooperative co-evolutionary algorithms , 2011, GECCO '11.

[55]  T. Hogg.  Exploiting Problem Structure as a Search Heuristic , 1998 .

[56]  Eyke Hüllermeier,et al.  Online clustering of parallel data streams , 2006, Data Knowl. Eng..

[57]  YaoXin,et al.  A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization , 2016 .

[58]  Xin Yao,et al.  Changing or keeping solutions in dynamic optimization problems with switching costs , 2018, GECCO.

[59]  Zhenyu Yang,et al.  Large-Scale Global Optimization Using Cooperative Coevolution with Variable Interaction Learning , 2010, PPSN.

[60]  Mohammad Reza Meybodi,et al.  Optimization in Dynamic Environments Utilizing a Novel Method Based on Particle Swarm Optimization , 2013 .

[61]  Janez Brest,et al.  Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems , 2006, IEEE Transactions on Evolutionary Computation.

[62]  D. Goldberg,et al.  A Survey of Linkage Learning Techniques in Genetic and Evolutionary Algorithms , 2007 .

[63]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[64]  Ming Yang,et al.  Multi-population methods in unconstrained continuous dynamic environments: The challenges , 2015, Inf. Sci..

[65]  Xin Yao,et al.  Large scale evolutionary optimization using cooperative coevolution , 2008, Inf. Sci..

[66]  R.W. Morrison,et al.  A test problem generator for non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[67]  Xiaodong Li,et al.  Particle Swarms for Dynamic Optimization Problems , 2008, Swarm Intelligence.

[68]  Kenneth A. De Jong,et al.  Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents , 2000, Evolutionary Computation.

[69]  Lamjed Ben Said,et al.  Handling time-varying constraints and objectives in dynamic evolutionary multi-objective optimization , 2017, Swarm Evol. Comput..

[70]  Changhe Li,et al.  Fast Multi-Swarm Optimization for Dynamic Optimization Problems , 2008, 2008 Fourth International Conference on Natural Computation.

[71]  Shahryar Rahnamayan,et al.  Metaheuristics in large-scale global continues optimization: A survey , 2015, Inf. Sci..

[72]  Hartmut Schmeck,et al.  Designing evolutionary algorithms for dynamic optimization problems , 2003 .

[73]  Xin Yao,et al.  Continuous Dynamic Constrained Optimization—The Challenges , 2012, IEEE Transactions on Evolutionary Computation.

[74]  Peter L. Lee,et al.  A multiple model, state feedback strategy for robust control of non-linear processes , 2007, Comput. Chem. Eng..

[75]  Xiaodong Li,et al.  CBCC3 — A contribution-based cooperative co-evolutionary algorithm with improved exploration/exploitation balance , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[76]  Lihua Yue,et al.  Continuous Dynamic Constrained Optimization With Ensemble of Locating and Tracking Feasible Regions Strategies , 2017, IEEE Transactions on Evolutionary Computation.

[77]  Ho-fung Leung,et al.  An Empirical Comparison of CMA-ES in Dynamic Environments , 2012, PPSN.

[78]  Karsten Weicker,et al.  Dynamic rotation and partial visibility , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[79]  Mohammad Reza Meybodi,et al.  A hibernating multi-swarm optimization algorithm for dynamic environments , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).

[80]  Andries Petrus Engelbrecht,et al.  Using Competitive Population Evaluation in a differential evolution algorithm for dynamic environments , 2012, Eur. J. Oper. Res..

[81]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[82]  John R. Koza,et al.  Hidden Order: How Adaptation Builds Complexity. , 1995, Artificial Life.

[83]  Mohammad Reza Meybodi,et al.  mNAFSA: A novel approach for optimization in dynamic environments with global changes , 2014, Swarm Evol. Comput..

[84]  Xiaodong Li,et al.  Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization , 2014, IEEE Transactions on Evolutionary Computation.

[85]  Mohammad Reza Meybodi,et al.  novel multi-swarm algorithm for optimization in dynamic environments based n particle swarm optimization , 2013 .

[86]  G. Harik.  Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .