A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM

被引:0
|
作者
Bernardino, Eugenia Moreira [1 ]
Bernardino, Anabela Moreira [1 ]
Manuel Sanchez-Perez, Juan
Antonio Gomez-Pulido, Juan
Angel Vega-Rodriguez, Miguel
机构
[1] Polytech Inst Leiria, Dept Comp Sci, Sch Technol & Management, Leiria, Portugal
来源
IJCCI 2009: PROCEEDINGS OF THE INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL INTELLIGENCE | 2009年
关键词
Communication networks; Optimization algorithms; Ant colony optimization algorithm; Terminal assignment 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 Terminal Assignment Problem. This problem involves determining minimum cost links to form a network by connecting a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Ant Colony Optimization Algorithm to solve the Terminal Assignment Problem. We compare our results with the results obtained by the standard Genetic Algorithm, the Tabu Search Algorithm and the Hybrid Differential Evolution Algorithm, used in literature.
引用
收藏
页码:144 / +
页数:2
相关论文
共 50 条
  • [1] A Novel Hybrid Ant Colony Optimization Approach to Terminal Assignment Problem
    Prasad, Mahendra
    Singh, Alok
    INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION COMMUNICATION TECHNOLOGY & COMPUTING, 2016, 2016,
  • [2] Ant colony optimization for solving the cuadratic assignment problem
    Reyes Montero, Alfredo
    Sanchez Lopez, Abraham
    2015 FOURTEENTH MEXICAN INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (MICAI), 2015, : 182 - 187
  • [3] Ant colony optimization algorithm for expert assignment problem
    Li, Na-Na
    Zhao, Zheng
    Gu, Jun-Hua
    Liu, Bo-Ying
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 660 - +
  • [4] Solving assignment problem based on a hybrid ant algorithm
    Xu Chaoren
    Li Yongmei
    ICCSE'2006: PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION: ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, 2006, : 84 - 86
  • [5] Solving clustering problem by hybrid ant colony algorithm
    Gao, Shang
    Zhang, Zaiyue
    Zhang, Xiaoru
    Cao, Cungen
    Journal of Information and Computational Science, 2009, 6 (04): : 1839 - 1846
  • [6] On ant colony algorithm for solving continuous optimization problem
    Li Hong
    Xiong Shibo
    2008 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2008, : 1450 - 1453
  • [7] Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem
    Ren Z.-G.
    Zhao S.-Y.
    Huang S.-S.
    Liang Y.-S.
    Ren, Zhi-Gang (renzg@mail.xjtu.edu.cn), 1600, Northeast University (31): : 1178 - 1184
  • [8] Improving the Ant Colony Optimization Algorithm for the Quadratic Assignment Problem
    Mouhoub, Malek
    Wang, Zhijie
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 250 - 257
  • [9] Optimization of the quadratic assignment problem using an ant colony algorithm
    Demirel, Nihan Cetin
    Toksari, M. Duran
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (01) : 427 - 435
  • [10] An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem
    D'Acierno, Luca
    Gallo, Mariano
    Montella, Bruno
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 217 (02) : 459 - 469