A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem

In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing and optimization aspect, combined with a finite domain constraint model for the wavelength assignment. If a solution to the constraint problem is found, it provides an optimal solution to the overall problem. If the constraint problem is infeasible, we use an extended explanation technique to find a good relaxation of the problem which leads to a near optimal solution. Extensive experiments show that proven optimality is achieved for more than 99.8% of all cases tested, while run-times are orders of magnitude smaller than the best known MIP solution.

• Type: Conference
• Year: 2009
• Where: CP
• Authors: Helmut Simonis
• Keywords: Constraint Problem, CP 2009, Programming Languages, Wavelength Assignment, Wavelength Assignment Problem