Repository logo

Browsing by Issue Date, starting with "2011-10-26"

Filter results by year or month
Now showing 1 - 2 of 2
  • Genetic and local search algorithms applied to balanced communication networks
    Publication . Bernardino, Eugénia; Moreira Bernardino, Anabela; Sánchez-Pérez, Juan M.; Gómez-Pulido, Juan A.; Vega-Rodríguez, Miguel A.
    In this paper we describe the application of different heuristics to optimise large communication networks. We use Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithm (GA) to minimise the link cost to form balanced communication networks. This paper makes a comparison among the effectiveness of ILS, TS, SA and GA on solving large communication networks. Simulation results verify the effectiveness of these algorithms.
    2011-10-26Conference paper Open access Show more
  • Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems
    Publication . Moreira Bernardino, Anabela; Bernardino, Eugénia; Sánchez-Pérez, Juan M.; Gómez-Pulido, Juan A.; Vega-Rodríguez, Miguel A.
    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.
    2011-10-26Conference paper Open access Show more