Abstract
A new approach to evolutionary computation with mutation only is developed by the introduction of the mutation matrix. The method of construction of the mutation matrix is problem independent and the selection mechanism is achieved implicitly by individualized and locus specific mutation probability based on the information on locus statistics and fitness of the population, and traditional genetic algorithm with selection and mutation can be treated a special case. The mutation matrix is parameter free and adaptive as the mutation probability is time dependent, and captures the accumulated information in the past generations. Three methodologies, mutation by row, mutation by column, and mutation by mixing row and column are introduced and tested on the resource allocation problem of the zero/one knapsack problem, showing high efficiency in speed and high quality of solution compared to other traditional methods.
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.: Adaptation in natural and artificial systems. University of Michigan, Ann Arbor
Goldberg, D.E.: Genetic algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Szeto, K.Y., Lo, M.H.: An Application of Adaptive Genetic Algorithm in Financial Knapsack Problem. In: Orchard, B., Yang, C., Ali, M. (eds.) The 17th International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, May 17-20. LNCS (LNAI), vol. 3029, pp. 1220–1227. Springer, Heidelberg (2004)
Ma, C.W., Szeto, K.Y.: Locus Oriented Adaptive Genetic Algorithm: Application to 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)
Brinkmann, B., et al.: Mutation Rate in Human Microsatellites: Influence of the Structure and Length of the Tandem Repeat. Am. J. Hum. Genet. 62, 1408–1415 (1998)
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)
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), Phoenix, Az. Genetic Algorithms and Combinatorial Optimization, pp. 194–195 (1994)
Kellerer, H.: Ulrich Pferschy and David Pisinger: Knapsack Problem, pp. 22–26. Springer, Heidelberg
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Szeto, K.Y. (2005). Mutation Matrix in Evolutionary Computation: An Application to Resource Allocation Problem. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_13
Download citation
DOI: https://doi.org/10.1007/11539902_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)