Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
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
Genetic Algorithms for Tracking Changing Environments
Proceedings of the 5th International Conference on Genetic Algorithms
Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors
EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
Ant Colony Optimization
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Contrary to popular belief, biologists discovered that worker ants are really not all hardworking. It has been found that in three separate 30-strong colonies of black Japanese ants (Myrmecina nipponica), about 20% of worker ants are diligent, 60% are ordinary, and 20% are lazy. That is called 20:60:20 rule. Though they are lazy, biologists suggested that lazy worker ants could be contributing something to the colony that is yet to be determined. In our last research, we used CHC (cross generational elitist selection, heterogeneous recombination, and cataclysmic mutation) with the worker ants' rule (WACHC) aiming at solving optimization problems in changing environments. CHC is a nontraditional genetic algorithm (GA) which combines a conservative selection strategy that always preserves the best individuals found so far with a radical (highly disruptive) recombination operator. In our last research, we verified that WACHC performs better than CHC in only one case of fully changing environment. In this paper, we further discuss our proposed WACHC dealing with changing environment problems with varying degree of difficulty, compare our proposal with hypermutation GA which is also proposed for dealing with changing environment problems, and discuss the difference between our proposal and ant colony optimization algorithms.