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

Authors:
Thiago F. Noronha;Mauricio G. Resende;Celso C. Ribeiro
Affiliations:
Department of Computer Science, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil 31270-010;Algorithms and Optimization Research Department, AT & T Labs Research, Florham Park, USA 07932;Department of Computer Science, Universidade Federal Fluminense, Niterói, Brazil 24210-240
Venue:
Journal of Global Optimization
Year:
2011

Citing 13
Cited 3

Using tabu search techniques for graph coloring

Computing
A More Portable Fortran Random Number Generator

ACM Transactions on Mathematical Software (TOMS)
The complexity of path coloring and call scheduling

Theoretical Computer Science
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
An evolutionary algorithm for manufacturing cell formation

Computers and Industrial Engineering
A hybrid genetic algorithm for the weight setting problem in OSPF-IS-IS routing

Networks
Survivable IP network design with OSPF routing

Networks - Special Issue on Multicommodity Flows and Network Design
A random key based genetic algorithm for the resource constrained project scheduling problem

Computers and Operations Research
On column generation formulations for the RWA problem

Discrete Applied Mathematics
A branch-and-cut algorithm for partition coloring

Networks - Network Optimization (INOC 2007)
Efficient implementations of heuristics for routing and wavelength assignment

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications

A VND-ILS heuristic to solve the RWA problem

INOC'11 Proceedings of the 5th international conference on Network optimization
Variable neighborhood descent with iterated local search for routing and wavelength assignment

Computers and Operations Research
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.