Improved construction heuristics and iterated local search for the routing and wavelength assignment problem

Authors:
Kerstin Bauer;Thomas Fischer;Sven O. Krumke;Katharina Gerhardt;Stephan Westphal;Peter Merz
Affiliations:
Department of Computer Science, University of Kaiserslautern, Germany;Department of Computer Science, University of Kaiserslautern, Germany;Department of Mathematics, University of Kaiserslautern, Germany;Department of Mathematics, University of Kaiserslautern, Germany;Department of Mathematics, University of Kaiserslautern, Germany;Department of Computer Science, University of Kaiserslautern, Germany
Venue:
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Year:
2008

Citing 4
Cited 1

Routing and wavelength assignment in optical networks

IEEE/ACM Transactions on Networking (TON)
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Lightpath (wavelength) routing in large WDM networks

IEEE Journal on Selected Areas in Communications
Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks

IEEE Journal on Selected Areas in Communications

A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and a set of communication requests, the static RWA deals with the problem of assigning suitable paths and wavelengths to the requests. We introduce benchmark instances from the SND library to the RWA and argue that these instances are more challenging than previously used random instances. We analyze the properties of several instances in detail and propose an improved construction heuristic to handle 'problematic' instances. Our iterated local search finds the optimum for most instances.