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
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Case-Based Initialization of Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Genetic Algorithms for Tracking Changing Environments
Proceedings of the 5th International Conference on Genetic Algorithms
A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization
Proceedings of the 6th International Conference on Genetic Algorithms
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
A Comparative Study of Steady State and Generational Genetic Algorithms
Selected Papers from AISB Workshop on Evolutionary Computing
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Designing Evolutionary Algorithms for Dynamic Environments
Designing Evolutionary Algorithms for Dynamic Environments
Population-based incremental learning with memory scheme for changing environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Memory-based immigrants for genetic algorithms in dynamic environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
Balancing Population- and Individual-Level Adaptation in Changing Environments
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Hyper-learning for population-based incremental learning in dynamic environments
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Adaptive primal-dual genetic algorithms in dynamic environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Journal of Network and Computer Applications
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A particle swarm optimization based memetic algorithm for dynamic optimization problems
Natural Computing: an international journal
Ant colony optimization with immigrants schemes in dynamic environments
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Genetic algorithms for multi-objectives problems under its objective boundary
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
IEEE Transactions on Evolutionary Computation
Particle swarm optimization with composite particles in dynamic environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A study on population's diversity for dynamic environments
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
CellularDE: a cellular based differential evolution for dynamic optimization problems
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Memory-based CHC algorithms for the dynamic traveling salesman problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
The effect of selection from old populations in genetic algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
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
Memory-based immigrants for ant colony optimization in changing environments
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
A parallel multi-start search algorithm for dynamic traveling salesman problem
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Information Sciences: an International Journal
A method to reuse old populations in genetic algorithms
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
The sandpile mutation operator for genetic algorithms
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Simplex model based evolutionary algorithm for dynamic multi-objective optimization
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Ant colony optimization with immigrants schemes for the dynamic vehicle routing problem
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
How long should we run in dynamic optimization?
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Expert Systems with Applications: An International Journal
EA'11 Proceedings of the 10th international conference on Artificial Evolution
Extended virtual loser genetic algorithm for the dynamic traveling salesman problem
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Exploration and exploitation in evolutionary algorithms: A survey
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme addresses dynamic environments by maintaining the population diversity while the memory scheme aims to adapt genetic algorithms quickly to new environments by reusing historical information. This paper investigates a hybrid memory and random immigrants scheme, called memory-based immigrants, and a hybrid elitism and random immigrants scheme, called elitism-based immigrants, for genetic algorithms in dynamic environments. In these schemes, the best individual from memory or the elite from the previous generation is retrieved as the base to create immigrants into the population by mutation. This way, not only can diversity be maintained but it is done more efficiently to adapt genetic algorithms to the current environment. Based on a series of systematically constructed dynamic problems, experiments are carried out to compare genetic algorithms with the memory-based and elitism-based immigrants schemes against genetic algorithms with traditional memory and random immigrants schemes and a hybrid memory and multi-population scheme. The sensitivity analysis regarding some key parameters is also carried out. Experimental results show that the memory-based and elitism-based immigrants schemes efficiently improve the performance of genetic algorithms in dynamic environments.