Chasing chaos

Both simple and hybrid genetic algorithms encounter difficulties when presented with a function which has multiple values. Similarly, changing environments or functions which change rapidly present other problems. This paper presents an algorithm that is capable of coping with both of these scenarios: it can accommodate multiple solutions simultaneously and can track changes in optima efficiently. The proposed B-cell algorithm is inspired by the natural immune system, which itself displays similar capabilities of tracking multiple, moving targets in the form of infectious agents. This paper employs two nonlinear mappings which display chaotic behaviour to demonstrate the effectiveness of the B-cell algorithm in tracking multiple, moving targets. A number of experiments are conducted and results reported from the B-cell algorithm and standard hybrid genetic algorithm approaches. These results show the benefit of the B-cell algorithm approach when compared against these heuristic approaches.

[1]  Phillip D. Stroud,et al.  Kalman-extended genetic algorithm for search in nonstationary environments with noisy fitness evaluations , 2001, IEEE Trans. Evol. Comput..

[2]  R. K. Ursem.  When sharing fails , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[3]  Kalmanje Krishnakumar,et al.  Micro-Genetic Algorithms For Stationary And Non-Stationary Function Optimization , 1990, Other Conferences.

[4]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[5]  Jonathan Timmis,et al.  Immune Inspired Somatic Contiguous Hypermutation for Function Optimisation , 2003, GECCO.

[6]  Dipankar Dasgupta,et al.  Nonstationary Function Optimization using the Structured Genetic Algorithm , 1992, PPSN.

[7]  Terence C. Fogarty,et al.  Load Balancing Application of the Genetic Algorithm in a Nonstationary Environment , 1995, Evolutionary Computing, AISB Workshop.

[8]  Kenneth A. De Jong,et al.  Are Genetic Algorithms Function Optimizers? , 1992, PPSN.

[9]  Philippe Collard,et al.  From GAs to artificial immune systems: improving adaptation in time dependent optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Helen G. Cobb,et al.  An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .

[11]  M. Feigenbaum.  Quantitative universality for a class of nonlinear transformations , 1978 .

[12]  Joanne H. Walker,et al.  Dynamic Function Optimisation: Comparing the Performance of Clonal Selection and Evolution Strategies , 2003, ICARIS.

[13]  Anabela Simões,et al.  Using GAs To Deal With Dynamic Environments: A Comparative Study Of Several Approaches Based On Promoting Diversity , 2002, GECCO.

[14]  Mariann Bienz,et al.  The APC tumour suppressor has a nuclear export function , 2000, Nature.

[15]  M. Feigenbaum.  The universal metric properties of nonlinear transformations , 1979 .

[16]  Robert M. May,et al.  Simple mathematical models with very complicated dynamics , 1976, Nature.

[17]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[18]  Ian Tomlinson,et al.  The type of somatic mutation at APC in familial adenomatous polyposis is determined by the site of the germline mutation: a new facet to Knudson's 'two-hit' hypothesis , 1999, Nature Medicine.

[19]  Robert M. May,et al.  Stability and Complexity in Model Ecosystems , 2019, IEEE Transactions on Systems, Man, and Cybernetics.

[20]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[21]  Jonathan Timmis,et al.  Artificial Immune Systems: A New Computational Intelligence Approach , 2003 .