Solving ring loading problems using bio-inspired algorithms

In the last years, several combinatorial optimisation problems have arisen in the communication networks field. In many cases, to solve these problems it is necessary the use of emergent optimisation algorithms. The Weighted Ring Loading Problem (WRLP) is an important optimisation problem in the communication optical network field. When managed properly, the ring networks are uniquely suited to deliver a large amount of bandwidth in a reliable and inexpensive way. An optimal load balancing is very important, as it increases the system's capacity and improves the overall ring performance. The WRLP consists on the design, in a communication network of a transmission route (direct path) for each request, such that high load on the arcs/edges is avoided, where an arc is an edge endowed with a direction. In this paper we study this problem in two different ring types: Synchronous Optical NETworking (SONET) rings and Resilient Packet Ring (RPR). In RPR the purpose is to minimise the maximum load on the ring Arcs (WRALP). In SONET rings the purpose is to minimise the maximum load on the ring Edges (WRELP). The load of an arc is defined as the total weight of those requests that are routed through the arc in its direction and the load of an edge is the total weight of the routes traversing the edge in either direction. In this paper we study both problems without demand splitting and we propose three bio-inspired algorithms: Genetic Algorithm with multiple operators, Hybrid Differential Evolution with a multiple strategy and Hybrid Discrete Particle Swarm Optimisation. We also perform comparisons with other algorithms from literature. Simulation results verify the effectiveness of the proposed algorithms.

[1]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[2]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[3]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[4]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[5]  Mauro Dell'Amico,et al.  Exact solution of the SONET Ring Loading Problem , 1999, Oper. Res. Lett..

[6]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[8]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

[9]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[10]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[11]  Miguel A. Vega-Rodríguez,et al.  Solving the weighted ring edge-loading problem without demand splitting using a Hybrid Differential Evolution Algorithm , 2009, 2009 IEEE 34th Conference on Local Computer Networks.

[12]  Hu-Gon Kim,et al.  On the ring loading problem with demand splitting , 2004, Oper. Res. Lett..

[13]  Peter Winkler,et al.  The Ring Loading Problem , 1998, SIAM Rev..

[14]  D. E. Goldberg,et al.  Optimization and Machine Learning , 2022 .

[15]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[16]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[17]  Sung-Soo Kim,et al.  Ant Colony Optimization for SONET Ring Loading Problem , 2008 .

[18]  Miguel A. Vega-Rodríguez,et al.  Solving the Non-split Weighted Ring Arc-Loading Problem in a Resilient Packet Ring using Particle Swarm Optimization , 2016, IJCCI.

[19]  Miguel A. Vega-Rodríguez,et al.  Efficient Load Balancing for a Resilient Packet Ring Using Artificial Bee Colony , 2010, EvoApplications.

[20]  Eli V. Olinick,et al.  SONET/SDH Ring Assignment with Capacity Constraints , 2003, Discret. Appl. Math..

[21]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[22]  Biing-Feng Wang,et al.  Linear time algorithms for the ring loading problem with demand splitting , 2005, J. Algorithms.

[23]  Kwang Soo Cho,et al.  Efficient Load Balancing Algorithms for a Resilient Packet Ring , 2005 .

[24]  Stein Gjessing,et al.  IEEE 802.17 resilient packet ring tutorial , 2004, IEEE Communications Magazine.

[25]  Edward W. Knightly,et al.  Media Access Protocol for Hig h-Speed Mefropolitan-Area Resilient Packet Rings , 2004 .

[26]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the generalized traveling salesman problem , 2007, GECCO '07.

[27]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[28]  Miguel A. Vega-Rodríguez,et al.  Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators , 2008, DCAI.

[29]  Nachimuthu Karunanithi,et al.  A ring loading application of genetic algorithms , 1994, SAC '94.

[30]  Chae Y. Lee,et al.  Balancing loads on sonet rings with integer demand splitting , 1997, Comput. Oper. Res..

[31]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[32]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[33]  Ali R. Guner,et al.  ADiscrete Particle SwarmOptimization Algorithm for Uncapacitated Facility Location Problem , 2008 .

[34]  Dong-Wan Tcha,et al.  Optimal Load Balancing on Sonet Bidirectional Rings , 1997, Oper. Res..

[35]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[36]  Peter Kubat,et al.  Balancing Traffic Flows in Resilient Packet Rings , 2005 .

[37]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[38]  Alessandro Corsini,et al.  Inverse parameter identification technique using PSO algorithm applied to geotechnical modeling , 2008 .

[39]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[40]  Jingqi Fu,et al.  A Novel Probability Binary Particle Swarm Optimization Algorithm and Its Application , 2008, J. Softw..

[41]  Miguel A. Vega-Rodríguez,et al.  A Hybrid Ant Colony Optimization Algorithm for Solving the Ring Arc-Loading Problem , 2010, SETN.

[42]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[43]  C.P.M. van Hoesel Optimization in telecommunication networks , 2005 .

[44]  Miguel A. Vega-Rodríguez,et al.  A Discrete Differential Evolution Algorithm for Solving the Weighted Ring Arc Loading Problem , 2010, IEA/AIE.

[45]  Mehmet Sevkli,et al.  A discrete particle swarm optimization algorithm for uncapacitated facility location problem , 2008 .

[46]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[47]  Sanming Zhou,et al.  Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting , 2004, J. Interconnect. Networks.

[48]  Iraj Saniee,et al.  An optimization problem related to balancing loads on SONET rings , 1994, Telecommun. Syst..