Skip to main navigation Skip to search Skip to main content

A hybrid constraint model for the routing and wavelength assignment problem

  • Helmut Simonis

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2009 - 15th International Conference, CP 2009, Proceedings
Pages104-118
Number of pages15
DOIs
Publication statusPublished - 2009
Event15th International Conference on Principles and Practice of Constraint Programming, CP 2009 - Lisbon, Portugal
Duration: 20 Sept 200924 Sept 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5732 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Principles and Practice of Constraint Programming, CP 2009
Country/TerritoryPortugal
CityLisbon
Period20/09/0924/09/09

Fingerprint

Dive into the research topics of 'A hybrid constraint model for the routing and wavelength assignment problem'. Together they form a unique fingerprint.

Cite this