Skip to main content
Springer Nature Link
Log in

Efficient heuristics for the design of ring networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In telecommunications, the Ring Design Problem (RDP) lies at the heart ofmetropolitan area network design. We propose an integer programming formulation for the RDP, as well as several ring construction and post-optimization heuristics. These heuristics are tested and compared on a series of test problems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. E. Balas, The prize collecting traveling salesman problem, Networks 19(1989)621–636.

    Google Scholar 

  2. J. Beardwood, J.H. Halton and J.M. Hammersley, The shortest path through many points, Proc. Cambridge Philosophical Soc. 55(1959)299–327.

    Google Scholar 

  3. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, Solution of a large-scale traveling salesman problem, Oper. Res. 2(1954)393–410.

    Google Scholar 

  4. M. Gendreau, A. Hertz and G. Laporte, New insertion and post-optimization procedures for the traveling salesman problem, Oper. Res. 40(1992)1086–1094.

    MathSciNet  Google Scholar 

  5. B.L. Golden, L.D. Bodin, T. Doyle and W.R. Stewart, Jr., Approximate traveling salesman algorithms, Oper. Res. 28(1980)694–711.

    Google Scholar 

  6. G. Laporte and S. Martello, The selective traveling salesman problem, Disc. Appl. Math. 26(1990)193–207.

    Article  Google Scholar 

  7. L.J. LeBlanc and S. Narasimhan, Topological design of metropolitan area networks, Working Paper, Owen Graduate School of Management, Vanderbilt University (1991).

  8. P.T. Morreale and G.M. Campbell, Metropolitan area networks, IEEE Spectrum (1990) 40–42.

  9. D.J. Rosenkrantz, R.E. Stearns and P.M. Lewis II, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comp. 6(1977)563–581.

    Article  Google Scholar 

  10. R.E. Ross, FDDI — A tutorial, IEEE Commun. Mag. 24(1986)10–17.

    Article  Google Scholar 

  11. F.E. Ross, An overview of FDDI: The fiber optic distributed data interface, IEEE J. Select. Areas Commun. 7(1989)1043–1051.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de recherche sur les transports, Université de Montréal, succursale A, C.P. 6128, H3C 3J7, Montréal, Canada

    Michel Gendreau & Gilbert Laporte

  2. Service de Mathématiques de la Gestion, Université Libre de Bruxelles, Boulevard du Triomphe, CP 210/01, 3-1050, Brussels, Belgium

    Martine Labbé

Authors
  1. Michel Gendreau
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Martine Labbé
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Gilbert Laporte
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gendreau, M., Labbé, M. & Laporte, G. Efficient heuristics for the design of ring networks. Telecommunication Systems 4, 177–188 (1995). https://doi.org/10.1007/BF02110085

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02110085

Keywords