SONET/SDH ring assignment with capacity constraints
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Comparing Metaheuristic Algorithms for Sonet Network Design Problems
Journal of Heuristics
GRASP with Path-Relinking for the SONET Ring Assignment Problem
HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
Hi-index | 0.00 |
In this paper we propose a hybrid Honey Bees Mating Optimisation (HBMO) algorithm to solve two problems that arise in the design of optical telecommunication networks known as SONET/SDH Ring Assignment Problem (SRAP) and Intraring Synchronous Optical Network Design Problem (IDP). In SRAP the objective is to minimise the number of rings. In IDP the objective is to minimise the number of Add-Drop Multiplexers (ADMs). Both problems are subject to a ring capacity constraint. HBMO algorithm simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve these two combinatorial optimisation problems. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature.