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

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

0.00 Avg rating0 Votes
Article ID: iaor20116098
Volume: 50
Issue: 3
Start Page Number: 503
End Page Number: 518
Publication Date: Jul 2011
Journal: Journal of Global Optimization
Authors: , ,
Keywords: networks, networks: flow, networks: scheduling, programming: network, optimization, heuristics, heuristics: genetic algorithms
Abstract:

The problem of routing and wavelength assignment in wavelength division multiplexing 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.

Reviews

Required fields are marked *. Your email address will not be published.