Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A branch-and-price approach for an integrated capacity dimensioning and demand routing in SDH/WDM networks

A branch-and-price approach for an integrated capacity dimensioning and demand routing in SDH/WDM... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Business Performance and Supply Chain Modelling Inderscience Publishers

A branch-and-price approach for an integrated capacity dimensioning and demand routing in SDH/WDM networks

Loading next page...
 
/lp/inderscience-publishers/a-branch-and-price-approach-for-an-integrated-capacity-dimensioning-8LmNaeem9T
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1758-9401
eISSN
1758-941X
DOI
10.1504/IJBPSCM.2011.03997
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Business Performance and Supply Chain ModellingInderscience Publishers

Published: Jan 1, 2011

There are no references for this article.