Kim, Sung Soo and Kim, Il-Hwan and Mani, V and Kim, Hyung Jun (2008) Ant Colony Optimization for SONET Ring Loading Problem. In: International Journal of Innovative Computing, Information and Control, 4 (7). pp. 1617-1626.
Restricted to Registered users only
Download (93Kb) | Request a copy
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 ACS with only ranking, ACS 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.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to ICIC International.|
|Keywords:||Ant colony optimization;Load balancing;SONET ring;Routing.|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)|
|Date Deposited:||06 Aug 2008|
|Last Modified:||19 Sep 2010 04:48|
Actions (login required)