Efficient implementations of heuristics for routing and wavelength assignment

Authors:
Thiago F. Noronha;Mauricio G. C. Resende;Celso C. Ribeiro
Affiliations:
Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil;Algorithms and Optimization Research Department, AT&T Labs Research, Florham Park, NJ;Department of Computer Science, Universidade Federal Fluminense, Niterói, RJ, Brazil
Venue:
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Year:
2008

Citing 5
Cited 3

An incremental algorithm for a generalization of the shortest-path problem

Journal of Algorithms
A More Portable Fortran Random Number Generator

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

Theoretical Computer Science
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Journal of Heuristics
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications

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

Journal of Global Optimization
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of Routing and Wavelength Assignment 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 to different wavelengths. When the objective is to minimize the total number of wavelengths used, this problem is NP-hard. The current state-of-the-art heuristics were proposed in 2007 by Skorin-Kapov. The solutions provided by these heuristics were near-optimal. However, the associated running times reported were high. In this paper, we propose efficient implementations of these heuristics and reevaluate them on a broader set of testbed instances.