IDEAS home Printed from https://ideas.repec.org/a/ids/ijbpsc/v3y2011i1p3-19.html
   My bibliography  Save this article

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

Author

Listed:
  • Ali Balma
  • Nejib Ben Hadj-Alouane
  • Atidel Boubaker Hadj-Alouane

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.

Suggested Citation

  • Ali Balma & Nejib Ben Hadj-Alouane & Atidel Boubaker Hadj-Alouane, 2011. "A branch-and-price approach for an integrated capacity dimensioning and demand routing in SDH/WDM networks," International Journal of Business Performance and Supply Chain Modelling, Inderscience Enterprises Ltd, vol. 3(1), pages 3-19.
    • Handle: RePEc:ids:ijbpsc:v:3:y:2011:i:1:p:3-19
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=39970
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijbpsc:v:3:y:2011:i:1:p:3-19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=341 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.