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

被引:0
|
作者
Bernardino, Anabela Moreira [1 ]
Bernardino, Eugenia Moreira [1 ]
Sanchez-Perez, Juan Manuel [2 ]
Gomez-Pulido, Juan Antonio [2 ]
Vega-Rodriguez, Miguel Angel [2 ]
机构
[1] Polytech Inst Leiria, Res Ctr Informat & Commun, Sch Technol & Management, Dept Comp Sci, P-2411 Leiria, Portugal
[2] Univ Extremadura, Sch Polytech, Dept Technol Comp & Commun, Caceres 10071, Spain
关键词
Communication Networks; Optimization Algorithms; Ant Colony Optimization Algorithm; Weighted Ring Arc-Loading Problem;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:49 / +
页数:3
相关论文
共 50 条
  • [21] Solving the open vehicle routing problem by a hybrid ant colony optimization
    Sedighpour, Mohammad
    Ahmadi, Vahid.
    Yousefikhoshbakht, Majid
    Didehvar, Farzad
    Rahmati, Farhad
    KUWAIT JOURNAL OF SCIENCE, 2014, 41 (03) : 139 - 162
  • [22] An Adaptive Hybrid Ant Colony Optimization Algorithm for the Classification Problem
    Ma, Anxiang
    Zhang, Xiaohong
    Zhang, Changsheng
    Zhang, Bin
    INFORMATION TECHNOLOGY AND CONTROL, 2019, 48 (04): : 590 - 601
  • [23] Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem
    Fidanova, Stefka
    2020 5TH IEEE INTERNATIONAL CONFERENCE ON RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (IEEE - ICRAIE-2020), 2020,
  • [24] Ant colony algorithm based on solving continuous space optimization problem
    Business College of Shanxi University, Shanxi, China
    Metall. Min. Ind., 8 (463-467): : 463 - 467
  • [25] Improved ant colony optimization algorithm for solving constraint satisfaction problem
    Zhang, Yong-Gang
    Zhang, Si-Bo
    Xue, Qiu-Shi
    Tongxin Xuebao/Journal on Communications, 2015, 36 (05):
  • [26] Solving the Capacitated Location Routing Problem by Ant Colony Optimization Algorithm
    Ting, Ching-Jung
    Chen, Chia-Ho
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON OPERATIONS AND SUPPLY CHAIN MANAGEMENT, 2008, : 227 - 234
  • [27] Solving Traveling Salesman Problem by Genetic Ant Colony Optimization Algorithm
    Gao, Shang
    DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, : 597 - 602
  • [28] Solving railroad blocking problem using ant colony optimization algorithm
    Yaghini, Masoud
    Foroughi, Amir
    Nadjari, Behnam
    APPLIED MATHEMATICAL MODELLING, 2011, 35 (12) : 5579 - 5591
  • [29] A method for solving continuous optimization problem using ant colony algorithm
    Li, H
    Xiong, SB
    Sun, ZY
    WAVELET ANALYSIS AND ACTIVE MEDIA TECHNOLOGY VOLS 1-3, 2005, : 182 - 187
  • [30] Ant colony algorithm based on solving strongly heterogeneous container loading problem
    Business College of Shanxi University, Shanxi, China
    Metall. Min. Ind., 5 (331-338):