By Topic

Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation

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

2 Author(s)
Varela, G.N. ; Dept. of Electron. Syst. Eng., Essex Univ., Colchester, UK ; Sinclair, M.C.

Ant Colony Optimisation (ACO) is applied to the problem of routing and wavelength allocation in a multi-wavelength all-optical virtual-wavelength-path routed transport network. Three variants of our ACO algorithm are proposed: local update (LU), global update/distance (GU/D) and global update/occupancy (GU/O). All three extend the usual practice that ants are attracted by the pheromone trail of ants from their own colony: in our work, the artificial ants are also repelled by the pheromone of other colonies. Overall, the best ACO variant, GU/O, provides results that approach those of an earlier problem-specific heuristic on small- and medium-sized networks

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference: