Making IDEA-ARIMA Efficient in Dynamic Constrained Optimization Problems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9028)

Abstract

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.

References

  1. 1.
    Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer, Norwell (2002)CrossRefMATHGoogle Scholar
  2. 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
  3. 3.
    Nguyen, T., Yao, X.: Continuous dynamic constrained optimisation - the challenges. IEEE Trans. Evol. Comput. 16, 769–786 (2012)CrossRefGoogle Scholar
  4. 4.
    Yang, S., Yao, X.: Evolutionary Computation for Dynamic Optimization Problems. SCI, vol. 490. Springer, Heidelberg (2013)MATHGoogle Scholar
  5. 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. 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
  7. 7.
    Tinós, R., Yang, S.: A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genet. Program. Evolvable Mach. 8(3), 255–286 (2007)CrossRefGoogle Scholar
  8. 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. 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
  10. 10.
    Bosman, P.A.N.: Learning and anticipation in online dynamic optimization. In: Yang, S., Ong, Y.-S., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51, pp. 129–152. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Simões, A., Costa, E.: Evolutionary algorithms for dynamic environments: prediction using linear regression and Markov chains. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 306–315. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  12. 12.
    Box, G.E.P., Jenkins, G.M., Reinsel, G.C.: Time Series Analysis: Forecasting and Control. Wiley, New York (2013). Wiley.com Google Scholar
  13. 13.
    Filipiak, P., Michalak, K., Lipinski, P.: Infeasibility driven evolutionary algorithm with ARIMA-based prediction mechanism. In: Yin, H., Wang, W., Rayward-Smith, V. (eds.) IDEAL 2011. LNCS, vol. 6936, pp. 345–352. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  14. 14.
    Singh, H.K., Isaacs, A., Ray, T., Smith, W.: Infeasibility driven evolutionary algorithm for constrained optimization. In: Mezura-Montes, E. (ed.) Constraint Handling in Evolutionary Optimization. SCI, vol. 198, pp. 145–165. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Deb, K., Pratap, A., Agarwal, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Computational Intelligence Research Group, Institute of Computer ScienceUniversity of WroclawWroclawPoland

Personalised recommendations