On application of ant algorithms to non-bifurcated multicommodity flow problem

被引：0
|
作者：
Walkowiak, K [1 ]
机构：
[1] Wroclaw Univ Technol, Fac Elect, Chair Syst & Comp Networks, PL-50370 Wroclaw, Poland
来源：
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004 | 2004年 / 3070卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that can be applied to the design of static flows in connection-oriented computer networks. Next, through numerical simulation, we study the influence of algorithm's parameters setting on the quality of solutions. We compare and discuss two variants of the algorithm: without and with feasible initial solution.
引用
收藏
页码：922 / 927
页数：6
相关论文
共 50 条
  • [1] Algorithms for the non-bifurcated network design problem
    Enrico Bartolini
    Aristide Mingozzi
    [J]. Journal of Heuristics, 2009, 15
  • [2] Algorithms for the non-bifurcated network design problem
    Bartolini, Enrico
    Mingozzi, Aristide
    [J]. JOURNAL OF HEURISTICS, 2009, 15 (03) : 259 - 281
  • [3] OPTIMAL CAPACITY AND NON-BIFURCATED FLOW ASSIGNMENT IN A COMPUTER COMMUNICATION NETWORK.
    Kasprzak, Andrzej
    [J]. Systems Science, 1985, 11 (01): : 47 - 58
  • [4] Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations
    Bita Tadayon
    J. Cole Smith
    [J]. Journal of Optimization Theory and Applications, 2014, 161 : 506 - 532
  • [5] GRAPH-THEORETIC CONSIDERATION AND ALGORITHMS FOR A MULTICOMMODITY FLOW ASSIGNMENT PROBLEM
    NAKAHORI, I
    NAKAZAKI, K
    NISHIKAWA, Y
    [J]. ELECTRONICS & COMMUNICATIONS IN JAPAN, 1977, 60 (02): : 17 - 25
  • [6] Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations
    Tadayon, Bita
    Smith, J. Cole
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 161 (02) : 506 - 532
  • [7] AN ALGORITHM FOR THE OPTIMIZATION OF NON-BIFURCATED FLOWS IN COMPUTER-COMMUNICATION NETWORKS
    COURTOIS, PJ
    SEMAL, P
    [J]. PERFORMANCE EVALUATION, 1981, 1 (02) : 139 - 152
  • [8] Routing and wavelength assignment for scheduled and random lightpath demands: Bifurcated routing versus non-bifurcated routing
    Koubaa, M
    Puech, N
    Gagnaire, M
    [J]. OPTICAL NETWORKS AND TECHNOLOGIES, 2005, 164 : 137 - 144
  • [9] THE STOCHASTIC MULTICOMMODITY FLOW PROBLEM
    SOROUSH, H
    MIRCHANDANI, PB
    [J]. NETWORKS, 1990, 20 (02) : 121 - 155
  • [10] Algorithms for multiplayer multicommodity flow problems
    Attila Bernáth
    Tamás Király
    Erika Renáta Kovács
    Gergely Mádi-Nagy
    Gyula Pap
    Júlia Pap
    Jácint Szabó
    László Végh
    [J]. Central European Journal of Operations Research, 2013, 21 : 699 - 712
12345