Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
A Hyperheuristic Approach to Scheduling a Sales Summit
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
UMDAs for dynamic optimization problems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A greedy hyper-heuristic in dynamic environments
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Hyper-learning for population-based incremental learning in dynamic environments
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Optimization in dynamic environments: a survey on problems, methods and measures
Soft Computing - A Fusion of Foundations, Methodologies and Applications
An investigation of selection hyper-heuristics in dynamic environments
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
An ant-based selection hyper-heuristic for dynamic environments
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Hi-index | 0.00 |
Selection hyper-heuristic methodologies explore the space of heuristics which in turn explore the space of candidate solutions for solving hard computational problems. This study investigates the performance of approaches based on a framework that hybridizes selection hyper-heuristics and population based incremental learning (PBIL), mixing offline and online learning mechanisms for solving dynamic environment problems. The experimental results over well known benchmark instances show that the approach is generalized enough to provide a good average performance over different types of dynamic environments.