Making IDEA-ARIMA Efficient in Dynamic Constrained Optimization Problems
A commonly used approach in Evolutionary Algorithms for Dynamic Constrained Optimization Problems forces re-evaluation of a population of individuals whenever the landscape changes. On the contrary, there are algorithms like IDEA-ARIMA that can effectively anticipate certain types of landscapes rather than react to changes which already happened and thus be one step ahead with the dynamic environment. However, the computational cost of IDEA-ARIMA and its memory consumption are barely acceptable in practical applications. This paper proposes a set of modifications aimed at making this algorithm an efficient and competitive tool by reducing the use of memory and proposing the new anticipation mechanism.
- 2.Nguyen, T., Yao, X.: Benchmarking and solving dynamic constrained problems. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2009), pp. 690–697 (2009)Google Scholar
- 5.Aragón, V.S., Esquivel, S.C.: An evolutionary algorithm to track changes of optimum value locations in dynamic environments. J. Comput. Sci. Technol. 4(3), 127–134 (2004)Google Scholar
- 6.Liu, X., Wu, Y., Ye, J.: An improved estimation of distribution algorithm in dynamic environments. In: Proceedings of the 4th International Conference on Natural Computing (ICNC 2008), pp. 269–272 (2008)Google Scholar
- 8.Singh, H.K., Isaacs, A., Nguyen, T.T., Ray, T., Yao, X.: Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2009), pp. 3127–3134 (2009)Google Scholar
- 9.Hatzakis, I., Wallace, D., Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation (GECCO 2006), pp. 1201–1208 (2006)Google Scholar