Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Li, S.P., Szeto, K.Y.: Crytoarithmetic problem using parallel Genetic Algorithms. In: Mendl 1999, Brno, Czech (1999)
Szeto, K.Y., Cheung, K.H.: Multiple time series prediction using genetic algorithms optimizer. In: Proceedings of the International Symposium on Intelligent Data Engineering and Learning, IDEAL 1998, Hong Kong, pp. 127–133 (1998)
Jiang, R., Szeto, K.Y., Luo, Y.P., Hu, D.C.: Distributed parallel genetic algorithm with path splitting scheme for the large traveling salesman problems. In: Shi, Z., Faltings, B., Musen, M. (eds.) Proceedings of Conference on Intelligent Information Processing, 16th World Computer Congress 2000, Beijing, August 21-25, pp. 478–485. Publishing House of Electronic Industry (2000)
Szeto, K.Y., Cheung, K.H., Li, S.P.: Effects of dimensionality on parallel genetic algorithms. In: Proceedings of the 4th International Conference on Information System, Analysis and Synthesis, Orlando, Florida, USA, vol. 2, pp. 322–325 (1998)
Szeto, K.Y., Fong, L.Y.: How adaptive agents in stock market perform in the presence of random news: a genetic algorithm approach. In: Leung, K.-S., Chan, L., Meng, H. (eds.) IDEAL 2000. LNCS(LNAI), vol. 1983, pp. 505–510. Springer, Heidelberg (2000)
Fong, A.L.Y., Szeto, K.Y.: Rule Extraction in Short Memory Time Series using Genetic Algorithms. European Physical Journal B 20, 569–572 (2001)
Shiu, K.L., Szeto, K.Y.: Self-adaptive Mutation Only Genetic Algorithm: An Application on the Optimization of Airport Capacity Utilization. In: Fyfe, C., Kim, D., Lee, S.-Y., Yin, H. (eds.) IDEAL 2008. LNCS, vol. 5326, pp. 428–435. Springer, Heidelberg (2008)
Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 523–528 (1998)
Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning (1994)
Pelikan, M., Goldberg, D.E., Cantu-Paz, E.: BOA: The Bayesian optimization algorithm. In: Proc. of the Genetic and Evolutionary Computation Conference GECCO, pp. 525–532 (1999)
Pelikan, M., Goldberg, D.E.: Scalable optimization via probabilistic modeling: From algorithms to applications, pp. 63–90 (2006)
Ma, C.W., Szeto, K.Y.: Locus Oriented Adaptive Genetic Algorithm: Application to the Zero/One Knapsack Problem. In: Proceeding of The 5th International Conference on Recent Advances in Soft Computing, RASC 2004, Nottingham, UK, pp. 410–415 (2004)
Szeto, K.Y., Zhang, J.: Adaptive genetic algorithm and quasi-parallel genetic algorithm: Application to knapsack problem. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2005. LNCS, vol. 3743, pp. 189–196. Springer, Heidelberg (2006)
Law, N.L., Szeto, K.Y.: Adaptive Genetic Algorithm with Mutation and Crossover Matrices. In: Proceeding of the 12th International Joint Conference on Artificial Intelligence (IJCAI 2007), January 6 - 12 (Volume II) Theme: Al and Its Benefits to Society, pp. 2330–2333. International Joint Conferences on Artificial Intelligence, Hyderabad (2007)
Gordon, V., Bohm, A., Whitley, D.: A Note on the Performance of Genetic Algorithms on Zero-One Knapsack Problems. In: Proceedings of the 9th Symposium on Applied Computing (SAC 1994), Genetic Algorithms and Combinatorial Optimization, Phoenix, Az, pp. 194–195 (1994)
Szeto, K.Y., Rui, J.: A quasi-parallel realization of the Investment Frontier in Computer Resource Allocation Using Simple Genetic Algorithm on a Single Computer. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds.) PARA 2002. LNCS, vol. 2367, pp. 116–126. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wang, G., Chen, C., Szeto, K.Y. (2010). Accelerated Genetic Algorithms with Markov Chains. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol 284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12538-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-12538-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12537-9
Online ISBN: 978-3-642-12538-6
eBook Packages: EngineeringEngineering (R0)