Abstract
Recently, Evolutionary Algorithms (EAs) with associative memory schemes have been developed to solve Dynamic Optimization Problems (DOPs). Current associative memory schemes always retrieve both the best memory individual and the corresponding environmental information. However, the memory individual with the best fitness could not be the most appropriate one for new environments. In this paper, two novel associative memory retrieving strategies are proposed to obtain the most appropriate memory environmental information. In these strategies, two best individuals are first selected from the two best memory individuals and the current best individual. Then, their corresponding environmental information is evaluated according to either the survivability or the diversity, one of which is retrieved. In experiments, the proposed two strategies were embedded into the state-of-the-art algorithm, i.e. the MPBIL, and tested on three dynamic functions in cyclic environments. Experiment results demonstrate that the proposed retrieving strategies enhance the search ability in cyclic environments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Grefenstette, J.J.: Genetic Algorithms for Changing Environments. In: Proceedings of Parallel Problem Solving From Nature, Amsterdam, Netherlands, pp. 137–144 (1992)
Mori, N., Kita, H.: Genetic Algorithms for Adaptation to Dynamic Environments - a Survey. In: Proceedings of the 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation, Nagoya, Japan, vol. 4, pp. 2947–2952 (2000)
Jin, Y., Branke, J.: Evolutionary Optimization in Uncertain Environments - a Survey. IEEE Transactions on Evolutionary Computation 9(3), 303–317 (2005)
Cobb, H.G.: An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous. Time-Dependent Nonstationary Environments, NRL-MR-6760, United States (1990)
Tinós, R., Yang, S.: A Self-Organizing Random Immigrants Genetic Algorithm for Dynamic Optimization Problems. Genetic Programming and Evolvable Machines 8(3), 255–286 (2007)
Branke, J.: Memory Enhanced Evolutionary Algorithms for Changing Optimization Problems. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1999), Washington, DC, USA, pp. 1875–1882 (1999)
Yang, S.: Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments: Evolutionary Computation in Dynamic and Uncertain Environments, vol. 51, pp. 3–28. Springer, Heidelberg (2007)
Oppacher, F., Wineberg, M.: Reconstructing the Shifting Balance Theory in a GA: Taking Sewall Wright Seriously. In: Proceedings of the 2000 IEEE Congress on Evolutionary Computation (CEC 2000), vol. 1, pp. 219–226 (2000)
Ursem, R.K.: Multinational GAs: Multimodal Optimization Techniques in Dynamic Environments. In: Proceedings of the 2000 Genetic and Evolutionary Computation Conference (GECCO 2000), Riviera Hotel, Las Vegas, USA, vol. 1, pp. 19–26 (2000)
Branke, J., Kaussler, T., Smidt, C., Schmeck, H.: A Multi-Population Approach to Dynamic Optimization Problems. In: Proceedings of the 4th International Conference on Adaptive Computing in Design and Manufacture (ACDM 2000), Plymouth, England, pp. 299–307 (2000)
Goldberg, D.E., Smith, R.E.: Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy. In: Proceedings of the 2nd International Conference on Genetic Algorithms, USA, pp. 59–68 (1987)
Yang, S., Yao, X.: Experimental Study on Population-Based Incremental Learning Algorithms for Dynamic Optimization Problems. Soft Computing 9(11), 815–834 (2005)
Ramsey, C.L., Grefenstette, J.J.: Case-Based Initialization of Genetic Algorithms. Australian Electronics Engineering 27(2), 84–91 (1994)
Yang, S.: Memory-Based Immigrants for Genetic Algorithms in Dynamic Environments. In: Proceedings of the 2005 Genetic and Evolutionary Computation Conference (GECCO 2005), Washington, DC, US, vol. 2, pp. 1115–1122 (2005)
Yang, S.: Population-Based Incremental Learning with Memory Scheme for Changing Environments. In: Proceedings of the 2005 Genetic and Evolutionary Computation Conference (GECCO 2005), Washington, DC, US, pp. 711–718 (2005)
Yang, S., Yao, X.: Population-Based Incremental Learning with Associative Memory for Dynamic Environments. IEEE Transactions on Evolutionary Computation 12(5), 542–561 (2008)
Louis, S.J., Xu, Z.J.: Genetic Algorithms for Open Shop Scheduling and Re-Scheduling. In: Proceedings of the 11th International Conference on Computers and Their Applications (ISCA), pp. 99–102 (1996)
Baluja, S.: Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. CMU-CS-94-163, United States (1994)
Yang, S.: Associative Memory Scheme for Genetic Algorithms in Dynamic Environments. In: Proceedings of EvoWorkshops 2006: Applications of Evolutionary Computing, Heidelberg, Germany, pp. 788–799 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, Y., Luo, W. (2009). Novel Associative Memory Retrieving Strategies for Evolutionary Algorithms in Dynamic Environments. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-04843-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04842-5
Online ISBN: 978-3-642-04843-2
eBook Packages: Computer ScienceComputer Science (R0)