Biologically inspired non-mendelian repair for constraint handling in evolutionary algorithms

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.

[1]  Sanghamitra Bandyopadhyay,et al.  Genetic operators for combinatorial optimization in TSP and microarray gene ordering , 2007, Applied Intelligence.

[2]  J. Langdale,et al.  Faculty Opinions recommendation of Genome-wide non-mendelian inheritance of extra-genomic information in Arabidopsis. , 2005 .

[3]  Animesh Ray.  Plant genetics: RNA cache or genome trash? , 2005, Nature.

[4]  Sancho Salcedo-Sanz,et al.  A survey of repair methods used as constraint handling techniques in evolutionary algorithms , 2009, Comput. Sci. Rev..

[5]  Xinyu Liu,et al.  Genetic Repair Strategies Inspired by Arabidopsisthaliana , 2009, AICS.

[6]  Tim Walters,et al.  Repair and Brood Selection in the Traveling Salesman Problem , 1998, PPSN.

[7]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[8]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[9]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[10]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

[11]  George G. Mitchell,et al.  A NEW OPERATOR FOR EFFICIENT EVOLUTIONARY SOLUTIONS TO THE TRAVELLING SALESMAN PROBLEM , 2000 .

[12]  Z. Michalewicz,et al.  Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[13]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

[14]  A. Conejo,et al.  A parallel repair genetic algorithm to solve the unit commitment problem , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[15]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.