A Hybrid Ant Colony Optimization Algorithm for Solving the Ring Arc-Loading Problem

The past two decades have witnessed tremendous research activities in optimization methods for communication networks One important problem in communication networks is the Weighted Ring Arc-Loading Problem (combinatorial optimization NP-complete problem) This problem arises in engineering and planning of the Resilient Packet Ring (RPR) systems Specifically, for a given set of non-split and uni-directional point-to-point demands (weights), the objective is to find the routing for each demand (i.e., assignment of the demand to either clockwise or counter-clockwise ring) so that the maximum arc load is minimised In this paper, we propose a Hybrid Ant Colony Optimization Algorithm to solve this problem We compare our results with the results obtained by the standard Genetic Algorithm and Particle Swarm Optimization, used in literature.

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

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

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

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

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

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

[7]  Juan M. Corchado,et al.  International symposium on distributed computing and artificial intelligence 2008 (DCAI 2008) , 2008 .

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

[9]  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.

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

[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]  Miguel A. Vega-Rodríguez,et al.  Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators , 2008, DCAI.

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

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

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