Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
From Natural to Artificial Swarm Intelligence
From Natural to Artificial Swarm Intelligence
Routing and wavelength assignment in optical networks
IEEE/ACM Transactions on Networking (TON)
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
WDM optical communication networks: progress and challenges
IEEE Journal on Selected Areas in Communications
Instantiation of a Generic Model for Load Balancing with Intelligent Algorithms
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
A survey: algorithms simulating bee swarm intelligence
Artificial Intelligence Review
Bee colony optimization for the p-center problem
Computers and Operations Research
Bee colony intelligence in zone constrained two-sided assembly line balancing problem
Expert Systems with Applications: An International Journal
A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks
Photonic Network Communications
Expert Systems with Applications: An International Journal
Empirical study of the Bee Colony Optimization (BCO) algorithm
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Routing and Wavelength Assignment (RWA) problem in all-optical networks assumes determining the routes and wavelengths to be used to create the lightpaths for connection requests. The RWA problem belongs to a class of difficult combinatorial optimization problems. We propose the Bee Colony Optimization (BCO) heuristic algorithm tailored for the RWA problem (BCO-RWA) in all-optical networks without wavelength conversion in intermediate nodes. The BCO represents a new metaheuristic capable to solve difficult combinatorial optimization problems. The artificial bee colony behaves partially alike, and partially differently from bee colonies in nature. The proposed BCO-RWA algorithm has been performed for static case in which lightpath requests are known in advance. We proved that BCO-RWA is able to produce optimal or near-optimal solutions in a reasonable amount of computer time.