By Topic

Evolutionary algorithms for solving routing and wavelength assignment problem in optical networks: A comparative study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rashedi, A. ; Iran Telecom Co., Ahvaz, Iran ; Kavian, Y.S. ; Mahani, A. ; Strobel, O.

Evolutionary algorithms (EAs) are mainly considered for modelling and solving practical complex and NP-hard problems in large-scale search spaces. The aim of this paper is to apply some well-known intelligent optimization algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms for solving routing and wavelength assignment (RWA) problem in optical networks which is also known to be an NP-hard problem. The performance of proposed optimization algorithms is compared for convergence speed and solution accuracy. The NSFNET network is considered as test-bench topology and randomly generated connection requests are introduced into network demand matrix. Simulation results demonstrate that the convergence speed of ABC algorithm is much better than other two algorithms to reach near-optimum solution in acceptable processing time. Furthermore, the PSO algorithm has better performance than GA in term of convergence speed.

Published in:

Transparent Optical Networks (ICTON), 2012 14th International Conference on

Date of Conference:

2-5 July 2012