Hybrid memory scheme for genetic algorithm in dynamic environments

被引:0
|
作者
Chen H. [1 ]
Li M. [2 ]
Chen X. [2 ]
机构
[1] College of Automation Engineering, Nanjing University of Aeronautics and Astronautics
[2] Key Laboratory of Nondestructive Test under the Ministry of Education, Nanchang Hangkong University
来源
关键词
Dynamic environment; Genetic algorithm; Memory scheme;
D O I
10.3969/j.issn.0255-8297.2010.05.015
中图分类号
学科分类号
摘要
In order to effectively solve dynamic optimization problems, a new hybrid memory scheme that consists of short-term memory and long-term memory is proposed. Information to be memorized includes the best individual and the probability vector of current population. Information of short-term memory is extracted to build the next population in each generation. Long-term memory is assigned for the short-term memory when a environmental change is detected. A new genetic algorithm is thus constructed based on the hybrid memory. Performance of the algorithm is verified in different environments including non-cyclic, cyclic, and cyclic with noise. Computation results indicate that this algorithm is superior to similar algorithms in dealing with dynamic optimization problems.
引用
收藏
页码:540 / 545
页数:5
相关论文
共 13 条
  • [1] Jin Y., Branke J., Evolutionary optimization in uncertain environments-a survey, IEEE Transactions on Evolutionary Computation, 7, 3, pp. 303-317, (2005)
  • [2] Wang H., Wang D., Yang S., Evolutionary algorithms in dynamic environments, Control and Decision, 22, 2, pp. 127-131, (2007)
  • [3] Tin'os R., Carvalho A., A genetic algorithm with gene dependent mutation probability for nonstationary optimization problems, Proceedings of 2004 Congress on Evolutionary Computing, pp. 1278-1285, (2004)
  • [4] Wang H., Wang D., An improved primal-dual genetic algorithm for optimization in dynamic environments, Lecture Notes in Computer Science, 4234, pp. 835-844, (2006)
  • [5] Wang H., Wang D., Tri-island particle swarm optimization with memory in dynamic environment, Journal of System Engineering, 23, 2, pp. 252-256, (2008)
  • [6] Yang S., Population-based incremental learning with memory scheme for changing environments, Proceedings of the Genetic and Evolutionary Computation Conference, pp. 711-718, (2005)
  • [7] Uyar A.S., Harmanci A.E., A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments, Soft Computing-A Fusion of Foundations, Methodologies and Applications, 9, 11, pp. 803-814, (2005)
  • [8] Yang S., Associative memory scheme for genetic algorithms in dynamic environments, Lecture Notes in Computer Science, 3907, pp. 788-799, (2006)
  • [9] Louis S., Xu Z., Genetic algorithms for open shop scheduling and rescheduling, ISCA 11th Int, l. Conf. on Computers and Their Applications, pp. 99-102, (1996)
  • [10] Branke J., Memory enhanced evolutionary algorithms for changing optimization problems, Proceedings of the 1999 Congress on Evolutionary Computation, pp. 1875-1882, (1999)