Abstract
In recent years we have witnessed a tremendous growth of communication networks resulted in a large variety of combinatorial optimization problems. One of these problems is the terminal assignment problem. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators for solving the well-known terminal assignment problem. Two sets of available crossover and mutation operators are established initially. In each generation a crossover method is selected for recombination and a mutation method is selected for mutation based on the amount fitness improvements achieved over a number of previous operations (recombinations/mutations). We use tournament selection for this purpose. Simulation results with the different methods implemented are compared.
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
Salcedo-Sanz, S., Yao, X.: A Hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. In: IEEE Transaction On Systems, Man and Cybernetics, vol. 34, pp. 2343–2353. IEEE Press, USA (2004)
Yao, X., Wang, F., Padmanabhan, K., Salcedo-Sanz, S.: Hybrid evolutionary approaches to terminal assignment in communications networks. In: Hart, W.E., Krasnogor, N., Smith, J.E. (eds.) Recent Advances in Memetic Algorithms and related search technologies, pp. 129–159. Springer, New York (2004)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Berlin (2003)
Abuali, F., Schoenefeld, D., Wainwright, R.: Terminal assignment in a Communications Network Using Genetic Algorithms. In: 22nd Annual ACM Computer Science Conference, pp. 74–81. ACM Press, New York (2004)
Khuri, S., Chiu, T.: Heuristic Algorithms for the Terminal Assignment Problem. In: ACM Symposium on Applied Computing, pp. 247–251. ACM Press, New York (1997)
Atiqullah, M., Rao, S.: Reliability optimization of communication networks using simulated annealing. Microelectronics and Reliability 33, 1303–1319 (1993)
Pierre, S., Hyppolite, M.A., Bourjolly, J.M., Dioume, O.: Topological design of computer communication networks using simulated annealing. Engineering Applications of Artificial Intelligence 8, 61–69 (1995)
Glover, F., Lee, M., Ryan, J.: Least-cost network topology design for a new service: and application of a tabu search. Annals of Operations Research 33, 351–362 (1991)
Koh, S.J., Lee, C.Y.: A tabu search for the survivable fiber optic communication network design. Computers and Industrial Engineering 28, 689–700 (1995)
Xu, Y., Salcedo-Sanz, S., Yao, X.: Non-standard cost terminal assignment problems using tabu search approach. In: IEEE Conference in Evolutionary Computation, vol. 2, pp. 2302–2306. IEEE Press, Portland (2004)
Salcedo-Sanz, S., Portilla-Figueras, J.A., García-Vázquez, F., Jiménez-Fernández, S.: Solving terminal assignment problems with groups encoding: the wedding banquet problem. Engineering Applications of Artificial Intelligence 19, 569–578 (2006)
Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press (1975)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Boston (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bernardino, E.M., Bernardino, A.M., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2008). A Genetic Algorithm with Multiple Operators for Solving the Terminal Assignment Problem. In: Nguyen, N.T., Katarzyniak, R. (eds) New Challenges in Applied Intelligence Technologies. Studies in Computational Intelligence, vol 134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79355-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-79355-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79354-0
Online ISBN: 978-3-540-79355-7
eBook Packages: EngineeringEngineering (R0)