A branch-and-price approach for an integrated capacity dimensioning and demand routing in SDH/WDM networks Online publication date: Tue, 30-Sep-2014
by Ali Balma, Nejib Ben Hadj-Alouane, Atidel Boubaker Hadj-Alouane
International Journal of Business Performance and Supply Chain Modelling (IJBPSCM), Vol. 3, No. 1, 2011
Abstract: In this paper, we consider the problem of integrated capacity dimensioning and demand routing in SDH/WDM networks, well-known in the telecommunication community as the traffic grooming problem. This problem is generally formulated as an integer linear programme that is typically hard to solve due to the unsplittable nature of channels and their non-uniform sizes. We transform the problem into mixed integer linear programme by relaxing the unsplittability constraints on flow variables. Then, we propose a branch-and-price approach that branches only on capacity variables and generates basic solutions for pricing sub-problems, having a non-zero variable for each separate channel. We also provide expressions for generating basic solutions. We show that the pricing process is polynomial. Since the 'complexity' of the problem depends only on the number of edges, the solution approach is expected to be computationally effective.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Performance and Supply Chain Modelling (IJBPSCM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook