Skip to main content
SpringerLink
Log in

Ring Network Design by Lagrangean Based Column Generation

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We discuss the problem of designing a telecommunication network with the survivability requirement that the network should be composed of connected rings of links. The network design problem is then to choose links from a given network, and compose them into a number of rings. Furthermore, the rings should be connected at certain transit nodes. The traffic between rings may pass through other rings. Each ring is associated with a certain fixed cost depending on the length of the ring. We describe the problem, modeled as a linear integer programming problem, and a heuristic solution method, based on column generation and Lagrangean relaxation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. DellAmico, F. Maffioli and P. Värbrand, On prize-collecting tours and the asymmetric traveling salesman problem, International Transactions in Operational Research 2 (1995) 297–308.

    Google Scholar 

  2. M. Fischetti and P. Toth, An additive approach for the optimal solution of the prize-collecting travelling salesman problem, Vehicle Routing: Methods and Studies (1988) 319–343.

  3. M. Gendreau, M. Labbé and G. Laporte, Efficient heuristics for the design of ring networks, Technical Report, Institut de Statistique, Université Libre De Bruxelles (1994).

  4. D. Gensch, An industrial application of the traveling salesmans subtour problem, AIIE Transactions 10(4) (1978) 362–370.

    Google Scholar 

  5. M. Henningsson, K. Holmberg, M. Rönnqvist and P. Värbrand, A ring network design problem, Working paper, LiTH-MAT-OPT-WP-98-03, Department of Mathematics, Linköping Institute of Technology, Sweden (1998).

    Google Scholar 

  6. R.V. Kulkarni and P.R. Bhave, Integer programming formulations of vehicle routing problems, European Journal of Operational Research 20 (1985) 58–67.

    Google Scholar 

  7. M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533–1541.

    Google Scholar 

  8. V. Sridhar, J.S. Park and B. Gavish, Optimal interconnection of token ring networks using source routing bridges, Research Report, Ohio University, USA (1994).

    Google Scholar 

  9. O.J. Wasem, An algorithm for designing rings for survivable fiber networks, IEEE Transactions on Reliability 40 (1991) 428–432.

    Google Scholar 

  10. J. Xu, S.Y. Chiu and F. Glover, Optimizing a ring-based private line telecommunication network using tabu search, Working paper (1998).

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Linköping University, SE-581 83, Linköping, Sweden

    M. Henningsson, K. Holmberg, M. Rönnqvist & P. Värbrand

Authors
  1. M. Henningsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Holmberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Rönnqvist
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. Värbrand
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Henningsson, M., Holmberg, K., Rönnqvist, M. et al. Ring Network Design by Lagrangean Based Column Generation. Telecommunication Systems 21, 301–318 (2002). https://doi.org/10.1023/A:1020954800383

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020954800383

Search

Navigation