Nonstationary function optimization using genetic algorithm with dominance and diploidy
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Designing Evolutionary Algorithms for Dynamic Environments
Designing Evolutionary Algorithms for Dynamic Environments
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
Towards an analysis of dynamic environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Evolutionary Computation in Dynamic and Uncertain Environments (Studies in Computational Intelligence)
Dynamic optimization by evolutionary algorithms applied to financial time series
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The role of representations in dynamic knapsack problems
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Analysis and modeling of control tasks in dynamic systems
IEEE Transactions on Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Dynamic Time-Linkage Problems Revisited
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
An improved firefly algorithm for solving dynamic multidimensional knapsack problems
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The field of evolutionary computation has traditionally focused on static optimisation problems but recently, many new approaches have been proposed that adapt traditional evolutionary algorithms to deal with the task of tracking high-quality solutions as the search space changes over time. Algorithms developed specifically for dynamic domains have been tested on a wide range of different problems, including well-specified benchmark generators. However, the lack of theoretical results, a general omission of references to actual real-world scenarios, as well as a substantial emphasis on the continuous domain may divert attention away from some highly relevant issues. Here we review the state of the field and analyse dynamics in the combinatorial domain, using the subset sum problem as an example. It is shown that some of the assumptions underlying the development of new algorithms do not necessarily hold in the case of discrete optimisation. Furthermore, it is argued that more attention should be paid to the underlying dynamics and the impact of the representation used.