Sciweavers

Share
JGO
2011

A biased random-key genetic algorithm for routing and wavelength assignment

7 years 6 months ago
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to minimize the total number of wavelengths used. We propose a genetic algorithm with random keys for routing and wavelength assignment with the goal of minimizing the number of different wavelengths used in the assignment. This algorithm extends the best heuristic in the literature by embedding it into an evolutionary framework. Computational results show that the new heuristic improves the state-of-the-art algorithms in the literature.
Thiago F. Noronha, Mauricio G. C. Resende, Celso C
Added 15 Sep 2011
Updated 15 Sep 2011
Type Journal
Year 2011
Where JGO
Authors Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
Comments (0)
books