Résumé en anglais

In this paper we consider the traffic Grooming, Routing and Wavelength Assignment problem in optical WDM mesh networks. This is a network design problem which consists in grooming the demands in lightpaths, assigning a wavelength to each lightpath and routing the traffic on these with minimum cost. We first give an Integer Linear Programming formulation for the problem. Then we discuss some pre-processing procedure and propose a fast heuristic which shows to be very efficient for solving large real instances of. We finally provide an illustrative application of the proposed heuristic for a real backhaul network instance.