Skip to main content
Log in

Planning for optimal expansion of leased line communication networks

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We report a new heuristic algorithm useful for developing least-cost expansion plans for leased telecommunications networks in which there is a hierarchy of possible transmission facilities. The problem combines network topology design and capacity expansion problems. Implemented on a PC, the algorithm has successfully developed topology growth plans for twenty periods on networks with up to 31 nodes.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Math. 1 (1959) 269–271.

    Google Scholar 

  2. J. Freidenfelds,Capacity Expansion: Analysis of Simple Models With Applications (Elsevier North-Holland, 1981).

    Google Scholar 

  3. H. Luss, Operations research and capacity expansion problems: a survey, Oper. Res. 30 (1982) 907–947.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Parrish, S.H., Cox, T., Kuehner, W. et al. Planning for optimal expansion of leased line communication networks. Ann Oper Res 36, 347–364 (1992). https://doi.org/10.1007/BF02094336

Download citation

  • Issue Date:

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

Keywords

Navigation