A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A new approach to solving dynamic traveling salesman problems
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Polynomial modeling for time-varying systems based on a particle swarm optimization algorithm
Information Sciences: an International Journal
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Differential evolution for high scale dynamic optimization
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Fuzzy genetic sharing for dynamic optimization
International Journal of Automation and Computing
Differential evolution for dynamic environments with unknown numbers of optima
Journal of Global Optimization
Evaporation mechanisms for particle swarm optimization
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
A multiple local search algorithm for continuous dynamic optimization
Journal of Heuristics
An improved firefly algorithm for solving dynamic multidimensional knapsack problems
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
There has been a growing interest in studying evolutionary algorithms in dynamic environments in recent years due to its importance in real applications. However, different dynamic test problems have been used to test and compare the performance of algorithms. This paper proposes a generalized dynamic benchmark generator (GDBG) that can be instantiated into the binary space, real space and combinatorial space. This generator can present a set of different properties to test algorithms by tuning some control parameters. Some experiments are carried out on the real space to study the performance of the generator.