Changing or keeping solutions in dynamic optimization problems with switching costs

Dynamic optimization problems (DOPs) are problems that change over time. However, most investigations in this domain are focused on tracking moving optima (TMO) without considering the cost of switching from one solution to another when the environment changes. Robust optimization over time (ROOT) tries to address this shortcoming by finding solutions which remain acceptable for several environments. However, ROOT methods change solutions only when they become unacceptable. Indeed, TMO and ROOT are two extreme cases in the sense that in the former, the switching cost is considered zero and in the latter, it is considered very large. In this paper, we propose a new semi ROOT algorithm based on a new approach to switching cost. This algorithm changes solutions when: 1) the current solution is not acceptable and 2) the current solution is still acceptable but algorithm has found a better solution and switching is preferable despite the cost. The main objective of the proposed algorithm is to maximize the performance based on the fitness of solutions and their switching cost. The experiments are done on modified moving peaks benchmark (mMPB) and the performance of the proposed algorithm alongside state-of-the-art ROOT and TMO methods is investigated.

[1]  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).

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

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

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

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

[6]  Xin Yao,et al.  Robust optimization over time — A new perspective on dynamic optimization problems , 2010, IEEE Congress on Evolutionary Computation.

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

[8]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Mohammad Mahdi Dehshibi,et al.  A novel hybrid algorithm for optimization in multimodal Dynamic environments , 2012, 2012 12th International Conference on Hybrid Intelligent Systems (HIS).

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

[11]  Mohammad Reza Meybodi,et al.  A new artificial fish swarm algorithm for dynamic optimization problems , 2012, 2012 IEEE Congress on Evolutionary Computation.

[12]  Yun Liu,et al.  Find robust solutions over time by two-layer multi-objective optimization method , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

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

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

[15]  Peter J. Fleming,et al.  Optimization of Adaptation - A Multi-objective Approach for Optimizing Changes to Design Parameters , 2013, EMO.

[16]  Shahriar Lotfi,et al.  A novel approach for optimization in dynamic environments based on modified cuckoo search algorithm , 2016, Soft Comput..

[17]  G. Avigad,et al.  Handling changes of performance requirements in multi-objective problems , 2012 .

[18]  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..

[19]  Trung Thanh Nguyen,et al.  Dynamic Time-Linkage Problems - The Challenges , 2012, 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future.

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

[21]  Jin Wang,et al.  A New Multi-swarm Particle Swarm Optimization for Robust Optimization Over Time , 2017, EvoApplications.

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

[23]  Jin Wang,et al.  A Multi-objective Time-Linkage Approach for Dynamic Optimization Problems with Previous-Solution Displacement Restriction , 2018, EvoApplications.

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

[25]  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 .

[26]  Xiaodong Li,et al.  Using regression to improve local convergence , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

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

[29]  Bin Li,et al.  Multi-strategy ensemble particle swarm optimization for dynamic optimization , 2008, Inf. Sci..

[30]  Xin Yao,et al.  Finding Robust Solutions to Dynamic Optimization Problems , 2013, EvoApplications.

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