Lagrangean decomposition/relaxation for the routing and wavelength assignment problem

Authors:
Babacar Thiongane
Affiliations:
Kronos, 3535 Queen Mary Road, Suite 650, Montreal, Quebec, H3V 1H8, Canada
Venue:
Networks
Year:
2012

Citing 7
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use

IEEE/ACM Transactions on Networking (TON)
The complexity of path coloring and call scheduling

Theoretical Computer Science
Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers

IEEE/ACM Transactions on Networking (TON)
Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On column generation formulations for the RWA problem

Discrete Applied Mathematics
Review: Comparison of ILP formulations for the RWA problem

Optical Switching and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work deals with solving the Routing and Wavelength Assignment problem where the number of accepted connections is to be maximized. Lagrangean decomposition as well as Lagrangean relaxation are studied for both node-arc formulations and arc-path formulation. It is shown that relaxing the demand constraints yields an edge-disjoint path problem with profits that is NP-hard, while the Lagrangean problem obtained when the clash constraints are relaxed becomes a shortest path problem or a 0–1 linear knapsack problem, depending on the formulation used. Moreover, it is shown that the Lagrangean decomposition is not stronger than the Lagrangean relaxation of the demand constraints. We also propose a subgradient algorithm to solve the Lagrangean dual obtained by relaxing the clash constraints. Numerical results demonstrate a high quality of Lagrangean dual bounds with fast computation time. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.