Optimum tracking with evolution strategies
Evolutionary Computation
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Genetic Programming and Evolvable Machines
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Learning behavior in abstract memory schemes for dynamic optimization problems
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue on ICNC-FSKD’2008;Guest Editors: Liang Zhao, Maozu Guo, Lipo Wang
Variable-Size Memory Evolutionary Algorithm to Deal with Dynamic Environments
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Constraint-Handling in Evolutionary Optimization
Constraint-Handling in Evolutionary Optimization
Benchmarking and solving dynamic constrained problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Detecting change in dynamic fitness landscapes
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memory based on abstraction for dynamic fitness functions
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Associative memory scheme for genetic algorithms in dynamic environments
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Solving dynamic constrained optimization problems with asynchronous change pattern
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Solving dynamic constraint optimization problems using ICHEA
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
| Hi-index | 0.00 |
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary algorithm. Based on ideas from abstract memory, two schemes, blending and censoring, are introduced and tested. Using a new benchmark we show in numerical experiments that such a memory can improve solving certain types of constrained dynamic problems.