Abstract
Fitness based selection procedures leave majority of population individuals idle, that is, they don’t take place in any recombination operation although some of them have above average fitness values. Based on this observation, a two-phase two-strategy genetic algorithm using a conventional strategy with multiple mutation operators in the first phase is proposed. In the second phase, those individuals that are not sufficiently recombined in the first phase are reconsidered within a second strategy and recombined using multiple mutation operators only. In the second strategy, mutation operator probabilities are adaptively determined based on the cumulative fitness-gain achieved by each mutation operator over a number of generations. The proposed genetic algorithm paradigm is used for the solution of hard numerical and combinatorial optimization problems. The results demonstrate that the proposed approach performs much better than the conventional implementations in terms of solution quality and the convergence speed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Back, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, Oxford (1996)
Gen, M., Runwei, C.: Genetic Algorithms in Engineering Design. John Wiley & Sons. Inc., Chichester (1997)
Miettinen, K., Neitaanmaki, P., Makela, M.M., Periaux, J.: Evolutionary Algorithms in Engineering and Computer Science. John Wiley & Sons Ltd., Chichester (1999)
Russel, P.J.: Genetics, 5th edn. Addison-Wesley, Reading (1998)
Funabiki, N., Takefuji, Y.: A Neural network parallel algorithm for channel assignment problem in cellular radio networks. IEEE Trans. On Vehicular Technology 41(4), 430–437 (1992)
Beckmann, D., Killat, U.: A new strategy for the application genetic algorithms to the channel assignment problem. IEEE Trans. On Vehicular Technology 48(4), 1261–1269 (1999)
Ngo, C.Y., Li, V.O.K.: Fixed channel assignment in cellular networks using a modified genetic algorithm. IEEE Trans. On Vehicular Technology 47(1), 163–172 (1998)
Chakraborty, G.: An efficient heuristic algorithm for channel assignment problem in cellular radio networks. IEEE Trans. On Vehicular Technology 50(6), 1528–1539 (2001)
Battiti, R.: A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Trans. On Vehicular Technology 50(2), 364–374 (2001)
Wang, W., Rushforth, C.K.: An adaptive local search algorithm for the channel assignment problem. IEEE Trans. On Vehicular Technology 45(3), 459–466 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acan, A. (2004). Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive