Advertisement

Soft Computing

, Volume 19, Issue 3, pp 547–566 | Cite as

Dynamic optimization facilitated by the memory tree

  • Tao Zhu
  • Wenjian LuoEmail author
  • Lihua Yue
Methodologies and Application

Abstract

Memorizing the past information for later environments is an effective and widely employed approach to optimize dynamic problems. Although the existing explicit memories for dynamic optimization differ widely in the literature, all of them organize memory entries in a linear list. This naive structure leads to problems, such as heavy computational overhead and small memory capacity, and thus restricts the performance of the memories. In this paper, the binary space partition tree is adopted to organize the memory entries, and then a memory tree is constructed. The memory tree partitions the search space into regions. In order to make use of the memory tree, a neighbor shift strategy is proposed. When a new individual is generated in a region that has never been visited since the last change, the new individual is shifted to the neighboring memory individual of that region, if it is less fit than the memory individual. The proposed approach can be easily combined with many population-based algorithms for dynamic optimization in the real space. As examples, the proposed approach was combined with a basic particle swarm optimizer and two state-of-the-art dynamic optimizers. The experimental results showed that it significantly enhanced the performance of the three optimizers on various test problems. The proposed approach demonstrates the importance of memory structure in memory approaches.

Keywords

Dynamic optimization problem Population-based algorithms Memory Memory structure Binary space partition tree 

Notes

Acknowledgments

This work is partly supported by the 2006-2007 Excellent Young and Middle-aged Academic Leader Development Program of Anhui Province Research Experiment Bases. We would like to thank Dr. Stefan Bird and Dr. Changhe Li for the source codes of SPSO and CPSO, respectively. We also would like to express our great appreciation to the anonymous reviewers for their valuable comments which contribute a lot to the improvement of the paper.

References

  1. Barlow GJ (2011) Improving memory for optimization and learning in dynamic environments. Doctoral dissertation, Carnegie Mellon University, PittsburghGoogle Scholar
  2. Bendtsen CN, Krink T (2002) Dynamic memory model for non-stationary optimization. In: Proceedings 2002 Congress Evolutionary Computation, pp 145–150Google Scholar
  3. Bird S, Li X (2006) Enhancing the robustness of a speciation-based pso. In: IEEE Congress on Evolutionary Computation, Vancouver, pp 843–850Google Scholar
  4. Bird S, Li X (2007) Using regression to improve local convergence. In: IEEE Congress on Evolutionary Computation 2007Google Scholar
  5. Blackwell T, Branke J (2006) Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Trans Evol Comput 10(4):459–472CrossRefGoogle Scholar
  6. Bosman (2005) Learning, anticipation and time deception in evolutionary online dynamic optimization. In: GECCO’05, Washington, pp 39–47Google Scholar
  7. Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. In: The 1999 IEEE Congress on Evolutionary Computation, Washington, pp 1875–1882Google Scholar
  8. Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer Academic Publishers, DordrechtCrossRefzbMATHGoogle Scholar
  9. Branke J, Kaußler T, Schmidt C, Schmeck H (2000) A multi-population approach to dynamic optimization problemsGoogle Scholar
  10. Brest J, Zamuda A, Boskovic B, Maucec MS, Zumer V (2009) Dynamic optimization using self-adaptive differential evolution. In: The 2009 IEEE Congress on Evolutionary Computation, Trondheim, pp 415–422Google Scholar
  11. Cao Y, Luo W (2010) A novel updating strategy for associative memory scheme in cyclic dynamic environments. In: Proceedings of the Third International Workshop on Advanced Computational Intelligence, SuzhouGoogle Scholar
  12. Cedeno W, Vemuri VR (1997) On the use of niching for dynamic landscapes. In: The 1997 International Conference on Evolutionary Computation, pp 361–366Google Scholar
  13. Chow CK, Yuen SY (2011) An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans Evol Comput 15(6):741–769CrossRefGoogle Scholar
  14. Chow CK, Yuen SY (2012) A multiobjective evolutionary algorithm that diversifies population by its density. IEEE Trans Evol Comput 16(2):149–172CrossRefGoogle Scholar
  15. Clerc M, Kennedy J (2002) The particle swarm—explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73CrossRefGoogle Scholar
  16. Cobb HG (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, WashingtonGoogle Scholar
  17. Dasgupta D, McGregor DR (1992) Nonstationary function optimization using the structured genetic algorithmGoogle Scholar
  18. Eberhart R, Kennedy J (1995) New optimizer using particle swarm theory. In: Proceedings of the 1995 6th International Symposium on Micro Machine and Human Science, Nagoya, pp 39–43Google Scholar
  19. Eggermont J, Lenaerts T (2002) Dynamic optimization using evolutionary algorithms with a case-based, memoryGoogle Scholar
  20. Fred G (1989) Tabu search part i. ORSA J Comput 1(3):190–206CrossRefzbMATHGoogle Scholar
  21. Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments—a survey. IEEE Trans Evol Comput 9(3):303–317Google Scholar
  22. Karaman A, Uyar S, Eryigit G (2005) The memory indexing evolutionary algorithm for dynamic environments. In: Lecture notes in computer science, vol 3449. Heidelberg, D-69121, Germany, pp 563–573Google Scholar
  23. Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: The 2002 IEEE Congress on Evolutionary Computation, pp 1671–1675Google Scholar
  24. Lee SK, Moon BR (2009) Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems. In: The 11th Annual conference on Genetic and evolutionary computation, Montreal, pp 1865–1866Google Scholar
  25. Li X (2004) Adaptively choosing neighbourhood bests using species in a particle swarm optimizer for multimodal function optimization. In: Proceedings of Genetic and Evolutionary Computation Conference, pp 105–116Google Scholar
  26. Li X, Branke J, Blackwell T (2006) Particle swarm with speciation and adaptation in a dynamic environment. In: Proceedings of the 8th annual conference on Genetic and evolutionary computationGoogle Scholar
  27. Li C, Yang S, Nguyen TT, Yu EL, Yao X, Jin Y, Beyer HG, Suganthan PN (2008) Benchmark generator for cec 2009 competition on dynamic optimization. Department of Computer Science, University of Leicester, Technical report, UKGoogle Scholar
  28. Liu L, Yang S, Wang D (2010) Particle swarm optimization with composite particles in dynamic environments. IEEE Trans Syst Man Cybernet Part B 40(6):1634–1648CrossRefGoogle Scholar
  29. Mostaghim S, Teich J, Tyagi A (2002) Comparison of data structures for storing pareto-sets in moeas. CEC ’02 1:843–848Google Scholar
  30. Nguyen TT, Yang Z, Bonsall S (2012a) Dynamic time-linkage problems—the challenges. In: 2012 9th IEEE RIVF International Conference on Computing and Communication Technologies, Research, Innovation, and Vision, Ho Chi Minh CityGoogle Scholar
  31. Nguyen TT, Yang S, Branke J (2012b) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol Comput 6:1–24CrossRefGoogle Scholar
  32. Parrott D, Li X (2006) Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput 10(4):440–458CrossRefGoogle Scholar
  33. Ramsey CL, Grefenstette JJ (1993) Case-based initialization of genetic algorithms. In: the 5th International Conference on Genetic Algorithms, pp 84–91Google Scholar
  34. Richter H, Yang S (2009) Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Comput 13(12):1163–1173CrossRefzbMATHGoogle Scholar
  35. Salomon R (1996) Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. Biosystems 39(3):263–278CrossRefGoogle Scholar
  36. Schütze O (2003) A new data structure for the nondominance problem in multi-objective, OptimizationGoogle Scholar
  37. Simöes A, Costa E (2007a) Improving memory’s usage in evolutionary algorithms for changing environments. In: The 2007 IEEE Congress on Evolutionary Computation, Singapore, pp 276–283Google Scholar
  38. Simöes A, Costa E (2007b) Variable-size memory evolutionary algorithm to deal with dynamic environments. In: Applications of evolutionary computing, vol. 4448. Springer, Berlin, pp 617–626Google Scholar
  39. Tinós R, Yang S (2007) A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Gen Progr Evolv Mach 8(3):255–286CrossRefGoogle Scholar
  40. Urbanowicz RJ, Moore JH (2009) Learning classifier systems: a complete introduction, review, and roadmap. J Artif Evol Appl 2009Google Scholar
  41. Ursem RK (2000) Multinational gas: multimodal optimization techniques in dynamic environments. In: The 2000 Genetic and Evolutionary Computation Conference, vol. 1, Riviera Hotel, Las Vegas, pp 19–26Google Scholar
  42. Uyar AS, Harmanci AE (2005) A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments. Soft Comput 9(11):803–814CrossRefzbMATHGoogle Scholar
  43. Vavak F, Fogarty TC, Jukes K (1996) A genetic algorithm with variable range of local search for tracking changing environments. In: Parallel Problem Solving from, Nature, pp 376–385Google Scholar
  44. Vavak F, Jukes K, Fogarty TC (1997) Learning the local search range for genetic optimisation in nonstationary environments. In: IEEE International Conference on Evolutionary Computation, pp 355–360Google Scholar
  45. Yang S (2003) Non-stationary problem optimization using the primal-dual genetic algorithm. In: the 2003 IEEE Congress On Evolutionary Computation, vol 3, pp 2246–2253 Google Scholar
  46. Yang S (2005) Memory-based immigrants for genetic algorithms in dynamic environments. In: The 2005 Genetic and Evolutionary Computation Conference, vol 2, Washington, pp 1115–1122Google Scholar
  47. Yang S (2007) Genetic algorithms with elitism-based immigrants for chaning optimization problems. In: EvoWorkshops 2007: applications of evolutionary, computing, vol 4448, pp 627–636Google Scholar
  48. Yang S, Tinós R (2007) A hybrid immigrants scheme for genetic algorithms in dynamic environments. Intern J Autom Comput 4(3):243–254CrossRefGoogle Scholar
  49. Yang S (2008) Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evol Comput 16(3):385–416CrossRefGoogle Scholar
  50. Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542–561CrossRefGoogle Scholar
  51. Yang S, Li C (2010) A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments. IEEE Trans Evol Comput 14(6):959–974CrossRefGoogle Scholar
  52. Yu EL, Suganthan PN (2009) Evolutionary programming with ensemble of explicit memories for dynamic optimization. In: The 2009 IEEE Congress on Evolutionary Computation, Trondheim, pp 431–438Google Scholar
  53. Yuen SY, Chow CK (2009) A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput 13(2):454–472CrossRefGoogle Scholar
  54. Zhu T, Luo W, Li Z (2011) An adaptive strategy for updating the memory in evolutionary algorithms for dynamic optimization. In: Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments, ParisGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Anhui Province Key Laboratory of Software Engineering in Computing and Communication, School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei China

Personalised recommendations