Abstract
A new adaptive genetic algorithm using mutation matrix is introduced and implemented in a single computer using the quasi-parallel time sharing algorithm for the solution of the zero/one knapsack problem. The mutation matrix M(t) is constructed using the locus statistics and the fitness distribution in a population A(t) with N rows and L columns, where N is the size of the population and L is the length of the encoded chromosomes. The mutation matrix is parameter free and adaptive as it is time dependent and captures the accumulated information in the past generation. Two strategies of evolution, mutation by row (chromosome), and mutation by column (locus) are discussed. Time sharing experiment on these two strategies is performed on a single computer for solving the knapsack problem. Based on the investment frontier of time allocation, the optimal configuration for solving the knapsack problem is found.
This is a preview of subscription content, log in via an institution to check access.
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, 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, Hong Kong, IDEAL 1998, 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, August 21-25, pp. 478–485. ishing House of Electronic Industry, Beijing (2000)URL, 478
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)
Szeto, K.Y., Lo, M.H.: An application of adaptive genetic algorithm in financial knapsack problem. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS (LNAI), vol. 3029, pp. 1220–1228. Springer, Heidelberg (2004)
Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(3), 51–54 (1997)
Szeto, K.Y., Jiang, R.: 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)
Markowitz, H.: J. of Finance, vol. 7, p. 77 (1952)
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, RASC2004, Nottingham, UK, pp. 410–415 (2004)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szeto, K.Y., Zhang, J. (2006). Adaptive Genetic Algorithm and Quasi-parallel Genetic Algorithm: Application to Knapsack Problem. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_20
Download citation
DOI: https://doi.org/10.1007/11666806_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)