IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i1d10.1057_palgrave.jors.2601479.html
   My bibliography  Save this article

Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network

Author

Listed:
  • C S Sung

    (Korea Advanced Institute of Science and Technology)

  • S H Song

    (Korea Advanced Institute of Science and Technology)

Abstract

This paper considers a combined problem of establishing virtual paths (VPs) and routing traffic (packet) demands through the virtual paths in a layered communication network where each physical link is subject to its capacity constraints. The problem is modeled as a path-based formulation for which a branch-and-price solution algorithm is derived. The solution algorithm is composed of an efficient pricing algorithm, and also a branching rule based on a variable dichotomy, which does not destroy the structure of the associated pricing problems. Computational experiments are performed to test the efficiency of the algorithm, which show that the algorithm works quite well in finding optimal solutions (for the test instances) within reasonable time. Its immediate application may be made to a centralized network management on mid-term global reconfiguration and long-term VP planning.

Suggested Citation

  • C S Sung & S H Song, 2003. "Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 72-82, January.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:1:d:10.1057_palgrave.jors.2601479
    DOI: 10.1057/palgrave.jors.2601479
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601479
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601479?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    2. Kyungchul Park & Seokhoon Kang & Sungsoo Park, 1996. "An Integer Programming Approach to the Bandwidth Packing Problem," Management Science, INFORMS, vol. 42(9), pages 1277-1291, September.
    3. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    4. C S Sung & J M Hong, 1999. "Branch-and-price algorithm for a multicast routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(11), pages 1168-1175, November.
    5. Geir Dahl & Alexander Martin & Mechthild Stoer, 1999. "Routing Through Virtual Paths in Layered Telecommunication Networks," Operations Research, INFORMS, vol. 47(5), pages 693-702, October.
    6. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    7. Shyur, Ching-Chir & Wen, Ue-Pyng, 2001. "Optimizing the system of virtual paths by tabu search," European Journal of Operational Research, Elsevier, vol. 129(3), pages 650-662, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S. Raghavan & Daliborka Stanojević, 2011. "Branch and Price for WDM Optical Networks with No Bifurcation of Flow," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 56-74, February.
    2. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    3. M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.
    4. Markus Leitner & Ivana Ljubić & Martin Riedler & Mario Ruthmair, 2019. "Exact Approaches for Network Design Problems with Relays," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 171-192, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    2. Louwerse, I. & Mijnarends, J. & Meuffels, I. & Huisman, D. & Fleuren, H.A., 2012. "Scheduling Movements in the Network of an Express Service Provider," Econometric Institute Research Papers EI 2012-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    4. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    5. Jinil Han & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2013. "Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 585-596, August.
    6. Jardar Andersen & Marielle Christiansen & Teodor Gabriel Crainic & Roar Grønhaug, 2011. "Branch and Price for Service Network Design with Asset Management Constraints," Transportation Science, INFORMS, vol. 45(1), pages 33-49, February.
    7. Cohn, Amy & Davey, Melinda & Schkade, Lisa & Siegel, Amanda & Wong, Caris, 2008. "Network design and flow problems with cross-arc costs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 890-901, September.
    8. Ada Alvarez & José González-Velarde & Karim De-Alba, 2005. "Scatter Search for Network Design Problem," Annals of Operations Research, Springer, vol. 138(1), pages 159-178, September.
    9. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    10. Kaj Holmberg & Di Yuan, 2000. "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem," Operations Research, INFORMS, vol. 48(3), pages 461-481, June.
    11. Alberto Caprara & Enrico Malaguti & Paolo Toth, 2011. "A Freight Service Design Problem for a Railway Corridor," Transportation Science, INFORMS, vol. 45(2), pages 147-162, May.
    12. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    13. Barış Yıldız & Oya Ekin Karaşan, 2017. "Regenerator Location Problem in Flexible Optical Networks," Operations Research, INFORMS, vol. 65(3), pages 595-620, June.
    14. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    15. Siqian Shen & Mingdi You & Yintai Ma, 2017. "Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 154-173, March.
    16. Cynthia Barnhart & Hong Jin & Pamela H. Vance, 2000. "Railroad Blocking: A Network Design Application," Operations Research, INFORMS, vol. 48(4), pages 603-614, August.
    17. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    18. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    19. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François, 2019. "Profit-oriented fixed-charge network design with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 1-19.
    20. Hamid Farvaresh & Mohammad Sepehri, 2013. "A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem," Networks and Spatial Economics, Springer, vol. 13(1), pages 67-106, March.

    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:pal:jorsoc:v:54:y:2003:i:1:d:10.1057_palgrave.jors.2601479. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.