ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Proceedings of the 3rd International Conference on Genetic Algorithms
Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints
Proceedings of the 5th International Conference on Genetic Algorithms
Repair and Brood Selection in the Traveling Salesman Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Genetic operators for combinatorial optimization in TSP and microarray gene ordering
Applied Intelligence
A comparison of selection schemes used in evolutionary algorithms
Evolutionary Computation
Explorations on template-directed genetic repair using ancient ancestors and other templates
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
This paper examines a repair technique that enables evolutionary algorithms to handle constraints. This repair technique, known as GeneRepair, repairs invalid individuals so that all problem constraints are met by every individual in the population. GeneRepair is based on the repair technique used by the Arabidopsis thaliana plant which was proposed by Lolle et al in 2005. This controversial repair method uses information inherited from ancestors previous to the parent (non-Mendelian inheritance) as a repair template to fix errors or invalidities in the current population. We compare the use of three different ancestors as repair templates and investigate the effects of various biological parameters on the choice of repair template to use.