Multiple ant-colony optimization for network routing

被引：0
作者：
Sim, KM [1 ]
Sun, WH [1 ]
机构：
[1] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China
来源：
FIRST INTERNATIONAL SYMPOSIUM ON CYBER WORLDS, PROCEEDINGS | 2002年
关键词：
autonomous agent; swarm intelligence; and network routing;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An ANT is a mobile agent that is capable of solving various kinds of routing and congestion problems in computer networking by continuously modifying routing tables in respond to congestion. In a distributed problem solving paradigm, a society of ANTs (each contributing some information) collaborate to solve a larger problem. In recent years, Ant-based algorithms were used to solve classical routing problems such as: Traveling Salesman Problem, Vehicle Routing Problem, Quadratic Assignment Problem, connection-oriented /connectionless routing, sequential ordering, graph coloring and shortest common supersequence. This paper introduces the general idea of Ant-based algorithms with a focus on Ant Colony Optimization (ACO), and their features, strengths, weaknesses and applications in network routing. The contribution of this paper is the proposal of a multiple ant-colony optimization (MACO) approach for network routing.
引用
收藏
页码：277 / 281
页数：5
相关论文
共 50 条
[31]   Fair Path Generation for Multiple Agents Using Ant Colony Optimization in Consecutive Pattern Formations [J].
Suzuki, Yoshie ;
Raharja, Stephen ;
Sugawara, Toshiharu .
JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2024, 28 (01) :159-168
[32]   A multiple pheromone ant colony optimization scheme for energy-efficient wireless sensor networks [J].
Arora, Vishal Kumar ;
Sharma, Vishal ;
Sachdeva, Monika .
SOFT COMPUTING, 2020, 24 (01) :543-553
[33]   A multiple pheromone ant colony optimization scheme for energy-efficient wireless sensor networks [J].
Vishal Kumar Arora ;
Vishal Sharma ;
Monika Sachdeva .
Soft Computing, 2020, 24 :543-553
[34]   A taxonomy on Ant Colony based routing algorithms for Wireless Sensor Networks [J].
Vishwas, C. G. M. ;
Kiran, M. .
PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON APPLIED AND THEORETICAL COMPUTING AND COMMUNICATION TECHNOLOGY (ICATCCT), 2015, :886-891
[35]   Exploration Strategies for Model Checking with Ant Colony Optimization [J].
Kumazawa, Tsutomu ;
Takimoto, Munehiro ;
Kambayashi, Yasushi .
COMPUTATIONAL COLLECTIVE INTELLIGENCE (ICCCI 2021), 2021, 12876 :264-276
[36]   An Ant Colony Optimization Approach for the Dominating Tree Problem [J].
Sundar, Shyam ;
Chaurasia, Sachchida Nand ;
Singh, Alok .
SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING (SEMCCO 2015), 2016, 9873 :143-153
[37]   A full process algebraic representation of Ant Colony Optimization [J].
Garcia, Maria ;
Lopez, Natalia ;
Rodriguez, Ismael .
INFORMATION SCIENCES, 2024, 658
[38]   Effects of Different Dynamics in an Ant Colony Optimization Algorithm [J].
Crespi, Carolina ;
Scollo, Rocco A. ;
Pavone, Mario .
2020 7TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE (ISCMI 2020), 2020, :8-11
[39]   Reconfiguration of Electrical Networks by an Ant Colony Optimization Algorithm [J].
Scenna, F. ;
Anaut, D. ;
Passoni, L. ;
Meschino, G. .
IEEE LATIN AMERICA TRANSACTIONS, 2013, 11 (01) :538-544
[40]   An Ant Colony Optimization Approach to Optimize Biblical Sermons [J].
Lima, Bruno C. S. ;
Frango, Ismar S. ;
de Castro, Leandro N. .
DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 21ST INTERNATIONAL CONFERENCE, 2025, 1259 :109-118
12345