Solving ring loading problems using bio-inspired algorithms

被引:7
|
作者
Bernardino, Anabela Moreira [1 ]
Bernardino, Eugenia Moreira [1 ]
Manuel Sanchez-Perez, Juan [2 ]
Antonio Gomez-Pulido, Juan [2 ]
Angel Vega-Rodriguez, Miguel [2 ]
机构
[1] Polytech Inst Leiria, Sch Technol & Management, Dept Comp Sci, Res Ctr Informat & Commun, P-2400 Leiria, Portugal
[2] Univ Extremadura, Polytech Sch, Dept Technol Comp & Commun, Caceres 10071, Spain
关键词
Communication networks; Bio-inspired algorithms; Optimisation algorithms; Swarm Intelligence; Weighted Ring Arc-Loading Problem; Weighted Ring Edge-Loading Problem; DIFFERENTIAL EVOLUTION; BALANCING LOADS; OPTIMIZATION; ASSIGNMENT; COLONY;
D O I
10.1016/j.jnca.2010.11.003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:668 / 685
页数:18
相关论文
共 50 条
  • [21] Serval Optimization Algorithm: A New Bio-Inspired Approach for Solving Optimization Problems
    Dehghani, Mohammad
    Trojovsky, Pavel
    [J]. BIOMIMETICS, 2022, 7 (04)
  • [22] Chameleon Swarm Algorithm: A bio-inspired optimizer for solving engineering design problems
    Braik, Malik Shehadeh
    [J]. Expert Systems with Applications, 2021, 174
  • [23] Chameleon Swarm Algorithm: A bio-inspired optimizer for solving engineering design problems
    Braik, Malik Shehadeh
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 174
  • [24] Combining Apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem
    Djenouri, Youcef
    Comuzzi, Marco
    [J]. INFORMATION SCIENCES, 2017, 420 : 1 - 15
  • [25] Special Issue on: New Challenges in Bio-Inspired Algorithms in Complex and Distributed Problems
    Braubach, Lars
    Badica, Costin
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2017, 10 (02) : 67 - 68
  • [26] Bio-inspired search algorithms to solve robotic assembly line balancing problems
    Nilakantan, J. Mukund
    Ponnambalam, S. G.
    Jawahar, N.
    Kanagaraj, G.
    [J]. NEURAL COMPUTING & APPLICATIONS, 2015, 26 (06): : 1379 - 1393
  • [27] Bio-inspired multi-objective algorithms applied on production scheduling problems
    Azevedo, Beatriz Flamia
    Montano-Vega, Ruben
    Varela, M. Leonilde R.
    Pereira, Ana, I
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, : 415 - 436
  • [28] Bio-inspired search algorithms to solve robotic assembly line balancing problems
    J. Mukund Nilakantan
    S. G. Ponnambalam
    N. Jawahar
    G. Kanagaraj
    [J]. Neural Computing and Applications, 2015, 26 : 1379 - 1393
  • [29] A survey on dynamic populations in bio-inspired algorithms
    Farinati, Davide
    Vanneschi, Leonardo
    [J]. GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2024, 25 (02)
  • [30] Bio-inspired algorithms for multilevel image thresholding
    Ouadfel, Salima
    Meshoul, Souham
    [J]. INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2014, 49 (3-4) : 207 - 226