A hybrid ant colony optimization algorithm for solving the ring arc-loading problem

Authors:
Anabela Moreira Bernardino;Eugénia Moreira Bernardino;Juan Manuel Sánchez-Pérez;Juan Antonio Gómez-Pulido;Miguel Angel Vega-Rodríguez
Affiliations:
Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain
Venue:
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Year:
2010

Citing 6
Cited 1

The Ring Loading Problem

SIAM Journal on Discrete Mathematics
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Linear time algorithms for the ring loading problem with demand splitting

Journal of Algorithms
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Exact solution of the SONET Ring Loading Problem

Operations Research Letters
On the ring loading problem with demand splitting

Operations Research Letters

Solving ring loading problems using bio-inspired algorithms

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.