Vector Prediction Approach to Handle Dynamical Optimization Problems

  • Bojin Zheng
  • Yuanxiang Li
  • Ting Hu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)


The Dynamical Optimization Evolutionary Algorithms (DOEAs) have been applied to solve Dynamical Optimization Problems which are very common in real-world applications. But little work focused on the convergent DOEAs. In this paper new definitions of convergence are proposed and a new algorithm named Vector Prediction Approach is designed. This algorithm firstly analyzes the genes of best individuals from the past, then predicts the next genes of best individual in every tick by Gene Programming, such that the algorithm tracks the optima when time varying. The numerical experiments on two test-bed functions show that this algorithm can track the optima when time varying. The convergence of this algorithm under certain conditions is proved.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yamasaki, K., Kitakaze, K., Sekiguchi, M.: Dynamic optimization by evolutionary algorithms applied to financial time series. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, pp. 2017–2022 (2002)Google Scholar
  2. 2.
    Bendtsen, C.N., Krink, T.: Dynamic memory model for non-stationary optimization. In: Proceedings of the 2002 Congress onEvolutionary Computation, CEC 2002, vol. 1, pp. 145–150 (2002)Google Scholar
  3. 3.
    Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 3, pp. 1875–1882 (1999)Google Scholar
  4. 4.
    Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report Memorandum Report 6760, Navy Research Laboratory,Washington, DC, USA (1990)Google Scholar
  5. 5.
    Morrison, R.: Design evolutionary algorithms for dynamic environments. PhD thesis, George Mason University, Fairfax, Virgina (2002)Google Scholar
  6. 6.
    Hemert, J., Hoyweghen, C., Lukshandl, E., Verbeeck, K.: A futurist approach to dynamic environments. In: Branke, J., Bäck, T. (eds.) Evolutionary Algorithms for Dynamic Optimization Problems, San Francisco, California, USA, pp. 35–38 (2001)Google Scholar
  7. 7.
    Dorigo, M., Gambardella, L.M., Middendorf, M., Stutzle, T.: Special section on ant colony optimization. IEEE Transactions on Evolutionary Computation 6(4), 317–320 (2002)CrossRefGoogle Scholar
  8. 8.
    Branke, J.: A multi-population approach to dynamic optimization problems. In: Parmee, I. (ed.) Fourth International Conference on Adaptive Computing in Design and Manufacture (ACDM 2000), Plymouth, Grossbritannien, pp. 299–308. Springer, Heidelberg (2000)Google Scholar
  9. 9.
    Ferreira, C.: Gene expression programming in problem solving. In: the 6th Online World Conference on Soft Computing in Industrial Applications(WSC6), vol. 1, pp. 1–22 (2001)Google Scholar
  10. 10.
    Ferreira, C.: Gene expression programming: A new adaptive algorithm for solving problems. Complex Systems 13(2), 87–129 (2001)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Iosifescu, M.: Finite Markov Processes and Their Applications. Wiley, Chichester (1980)zbMATHGoogle Scholar
  12. 12.
    Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Dordrecht (2002)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bojin Zheng
    • 1
    • 2
  • Yuanxiang Li
    • 2
  • Ting Hu
    • 3
  1. 1.College of Computer ScienceSouth-Central University For NationalitiesWuhanChina
  2. 2.State Key Lab. of Software EngineeringWuhan UniversityWuhanChina
  3. 3.Dept. of Computer ScienceMemorial University of NewfoundlandCanada

Personalised recommendations