A VND-ILS heuristic to solve the RWA problem

Authors:
Alexandre Xavier Martins;Christophe Duhamel;Mauricio Cardoso De Souza;Rodney Rezende Saldanha;Philippe Mahey
Affiliations:
Programa de Pós-Graduação em Engenharia Elétrica, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brasil;Laboratoire LIMOS, CNRS, UMR, Université Blaise Pascal, Aubiere Cedex, France;Departamento de Engenharia de Produção, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brasil;Departamento de Engenharia Elétrica, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brasil;Laboratoire LIMOS, CNRS, UMR, Université Blaise Pascal, Aubiere Cedex, France
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 5
Cited 0

Variable neighborhood search

Computers and Operations Research
The complexity of path coloring and call scheduling

Theoretical Computer Science
Efficient implementations of heuristics for routing and wavelength assignment

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A biased random-key genetic algorithm for routing and wavelength assignment

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

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Routing and Wavelength Assignment problem occurs in optical networks where communication requests fulfilled without inducing wavelength conflicts. We propose a VND-ILS algorithm which is a hybridization of both the ILS metaheuristic and the VND local search. Three neighborhood structures are defined for the VND as well as a perturbation step in the ILS. The efficiency of our approach is illustrated on classical realistic RWA instances. The computational results show our method outperforms some of the best existing methods in the literature.