Abstract
Planning optical communication networks suggests a number of new optimization problems, most of them in the field of combinatorial optimization. We address here the Ring Loading Problem. The objective of the problem is to find a routing scheme such that the maximum weighted load on the ring is minimized. In this paper we consider two variants: (i) demands can be split into two parts, and then each part is sent in a different direction; (ii) each demand must be entirely routed in either of the two directions, clockwise or counterclockwise. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators. 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 achieve 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
Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM Journal of Discrete Mathematics 11, 1–14 (1998)
Myung, Y.S., Kim, H.G.: On the ring loading problem with demand splitting. Operations Research Letters 32(2), 167–173 (2004)
Wang, B.F.: Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms 54(1), 45–57 (2005)
Cosares, S., Saniee, I.: An optimization problem related to balancing loads on SONET rings. Telecommunication Systems 3(2), 165–181 (1994)
Goldschmidt, O., Laugier, A., Olinick, E.V.: SONET/SDH ring assignment with capacity constraints. Discrete Applied Mathematics. Elsevier 129(1), 99–128 (2003)
Karunanithi, N., Carpenter, T.: A Ring Loading Application of Genetic Algorithms. In: Proceedings of the ACM Symposium on Applied Computing, pp. 227–231. ACM, New York (1994)
Lee, C.Y., Chang, S.G.: Balancing loads on SONET rings with integer demand splitting. Computers and Operations Research 24(3), 221–229 (1997)
Myung, Y.-S., Kim, H.-G., Tcha, D.-W.: Optimal load balancing on SONET bidirectional rings. Operations Research 45(1), 148–152 (1997)
van Hoesel, S.P.M.: Optimization in telecommunication networks. Statistica Neerlandica 59(2), 180–205 (2005)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)
Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Springer, Berlin (2003)
Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A.: A Genetic Algorithm with multiple operators for solving the Ring Loading Problem. In: IADIS International Conference Applied Computing (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2009). Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators. In: Corchado, J.M., Rodríguez, S., Llinas, J., Molina, J.M. (eds) International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008). Advances in Soft Computing, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85863-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-85863-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85862-1
Online ISBN: 978-3-540-85863-8
eBook Packages: EngineeringEngineering (R0)