Accelerated Genetic Algorithms with Markov Chains

Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for complex problem optimization. The important input for this guided search is the ranking scheme of the chromosomes. It is found that the effect of mutation using the transition matrix yields faster convergence as well as overall higher fitness in the search for optimal solutions for the 0-1 Knapsack problem, when compared with the mutation-only-genetic-algorithm,which include the traditional genetic algorithm as a special case. The accelerated genetic algorithm with Markov Chain provides a theoretical basis for further mathematical analysis of evolutionary computation, specifically in the context of adaptive parameter control.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[3]  L. Darrell Whitley,et al.  A note on the performance of genetic algorithms on zero-one knapsack problems , 1994, SAC '94.

[4]  Rui Jiang,et al.  A Quasi-Parallel Realization of the Investment Frontier in Computer Resource Allocation Using Simple Genetic Algorithm on a Single Computer , 2002, PARA.

[5]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling , 2006, Studies in Computational Intelligence.

[6]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[7]  Kwok Yip Szeto,et al.  Rules extraction in short memory time series using genetic algorithms , 2001 .

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

[9]  Kwok Yip Szeto,et al.  Self-adaptive Mutation Only Genetic Algorithm: An Application on the Optimization of Airport Capacity Utilization , 2008, IDEAL.

[10]  Kwok Yip Szeto,et al.  Adaptive Genetic Algorithm with Mutation and Crossover Matrices , 2007, IJCAI.

[11]  Jian Zhang,et al.  Adaptive Genetic Algorithm and Quasi-parallel Genetic Algorithm: Application to Knapsack Problem , 2005, LSSC.

[12]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[13]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[14]  Emilio Corchado,et al.  Intelligent Data Engineering and Automated Learning - IDEAL 2006, 7th International Conference, Burgos, Spain, September 20-23, 2006, Proceedings , 2006, IDEAL.

[15]  Kwok Yip Szeto,et al.  How Adaptive Agents in Stock Market Perform in the Presence of Random News: A Genetic Algorithm Approach , 2000, IDEAL.

[16]  K. Szeto,et al.  Locus Oriented Adaptive Genetic Algorithm: Application to the Zero/One Knapsack Problem , 2004 .

[17]  P. Deuflhard,et al.  Large Scale Scientific Computing , 1987 .

[18]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[19]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .