Ant colony optimization for SONET ring loading problem

被引：0

作者：

Kim, Sung Soo ^{[1
]}

Kim, Il-Hwan ^{[2
]}

Mani, V. ^{[3
]}

Kim, Hyung Jun ^{[1
]}

机构：

[1] Kangwon Natl Univ, Dept Ind Engn, Chunchon 200701, South Korea

[2] Kangwon Natl Univ, Dept Elect & Telecommun Engn, Chunchon 200701, South Korea

[3] Indian Inst Sci, Dept Aerosp Engn, Bangalore 560012, Karnataka, India

来源：

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2008年 / 4卷 / 07期

关键词：

ant colony optimization; load balancing; SONET ring; routing;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The SONET ring loading problem is a combinatorial optimization problem and is known to be NP-hard. The meta-heuristic method of ant colony optimization is a method of obtaining best/optimal solution, to NP-hard optimization problems. Hence, in this paper, we present, an ant colony system (ACS) for an effective search of the best/optimal routing of demands under a dynamic environment. Our simulation results show that this methodology is successful in finding the best/optimal routing of demands in a SONET ring. Three strategies A CS with only ranking, A CS with only MMAS, and ACS with both ranking and MMAS are considered. A comparison of these strategies are presented to show the performance of each strategy.

引用

页码：1617 / 1626

页数：10

共 21 条

[1]

[Anonymous], 1999, Swarm Intelligence

[2] An improved ant system algorithm for the vehicle routing problem [J].