Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Baluja (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, USA.
C. N. Bendtsen and T. Krink (2002). Dynamic memory model for non-stationary optimization. Proc. of the 2002 Congress on Evol. Comput., pp. 145-150.
J. Branke (1999). Memory enhanced evolutionary algorithms for changing optimization problems. Proc. of the 1999 Congress on Evolutionary Computation, vol. 3, pp. 1875-1882.
J. Branke, T. Kaußler, C. Schmidth, and H. Schmeck (2000). A multi-population approach to dynamic optimization problems. Proc. of the 4th Int. Conf. on Adaptive Computing in Design and Manufacturing, pp. 299-308.
J. Branke (2002). Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers.
H. G. Cobb and J. J. Grefenstette (1993). Genetic algorithms for tracking changing environments. Proc. of the 5th Int. Conf. on Genetic Algorithms, pp. 523-530.
D. Dasgupta and D. McGregor (1992). Nonstationary function optimization using the structured genetic algorithm. PPSN II, pp. 145-154.
D. E. Goldberg and R. E. Smith (1987). Nonstationary function optimization using genetic algorithms with dominance and diploidy. Proc. of the 2nd Int. Conf. on Genetic Algorithms, pp. 59-68.
D. E. Goldberg (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.
J. J. Grefenstette (1992). Genetic algorithms for changing environments. Parallel Problem Solving from Nature II, pp. 137-144.
P. Larrañaga and J. A. Lozano (2002). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers.
E. H. J. Lewis and G. Ritchie (1998). A comparison of dominance mechanisms and simple mutation on non-stationary problems. Proc. of the 5th Int. Conf. on Parallel Problem Solving from Nature, pp. 139-148.
S. J. Louis and Z. Xu (1996). Genetic algorithms for open shop scheduling and re-scheduling. Proc. of the 11th ISCA Int. Conf. on Computers and their Applications, pp. 99-102. 28 Shengxiang Yang
T. Mahnig and H. Mühlenbein (2000). Mathematical analysis of optimization methods using search distributions. Proc. of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pp. 205-208.
N. Mori, H. Kita and Y. Nishikawa (1997). Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm. Proc. of the 7th Int. Conf. on Genetic Algorithms, pp. 299-306.
R. W. Morrison and K. A. De Jong (1999). A test problem generator for non-stationary environments. In Proc. of the 1999 Congress on Evolutionary Computation, vol. 3, pp. 2047-2053.
R. W. Morrison and K. A. De Jong (2000). Triggered hypermutation revisited. In Proc. of the 2000 Congress on Evolutionary Computation, pp. 1025-1032.
H. Mühlenbein and G. Paaß(1996). From recombination of genes to the estimation of distributions I. Binary parameters. Proc. of the 4th Int. Conf. on Parallel Problem Solving from Nature, pp. 178-187.
H. Mühlenbein (1998). The equation for response to selection and its use for prediction. Evolutionary Computation, 5: 303-346.
K. P. Ng and K. C. Wong (1997). A new diploid scheme and dominance change mechanism for non-stationary function optimisation. Proc. of the 6th Int. Conf. on Genetic Algorithms.
C. L. Ramsey and J. J. Greffenstette (1993). Case-based initializtion of genetic algorithms. Proc. of the 5th Int. Conf. on Genetic Algorithms.
K. Trojanowski and Z. Michalewicz (1999). Searching for optima in non-stationary environments. Proc. of the 1999 Congress on Evolutionary Computation, pp. 1843-1850.
F. Vavak and T. C. Fogarty (1996). A comparative study of steady state and generational genetic algorithms for use in nonstationary environments. AISB Workshop on Evolutionary Computing, LNCS 1143, pp. 297-304.
S. Yang (2003). Non-stationary problem optimization using the primal-dual genetic algorithm. Proc. of the 2003 Congress on Evolutionary Computation, vol. 3, pp. 2246-2253.
S. Yang (2005). Memory-based immigrants for genetic algorithms in dynamic environments. Proc. of the 2005 Genetic and Evolutionary Computation Conference, vol. 2, pp. 1115-1122.
S. Yang (2005). Population-based incremental learning with memory scheme for changing environments. Proc. of the 2005 Genetic and Evolutionary Computation Conference, vol. 1, pp. 711-718.
S. Yang (2005). Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems. Proc. of the 2005 Congress on Evolutionary Computation, vol. 3, pp. 2560-2567.
S. Yang (2006). Associative memory scheme for genetic algorithms in dynamic environments. Applications of Evolutionary Computing, LNCS 3907, pp. 788-799.
S. Yang and X. Yao (2005). Experimental study on population-based incremental learning algorithms for dynamic optimization problems, Soft Computing, 9(11): 815-834.
S. Yang and X. Yao (2006). Population-based incremental learning with associative memory for dynamic environments, submitted to IEEE Transactions on Evolutionary Computation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yang, S. (2007). Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments. In: Yang, S., Ong, YS., Jin, Y. (eds) Evolutionary Computation in Dynamic and Uncertain Environments. Studies in Computational Intelligence, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49774-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-49774-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49772-1
Online ISBN: 978-3-540-49774-5
eBook Packages: EngineeringEngineering (R0)