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.
Similar content being viewed by others
References
E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Math. 1 (1959) 269–271.
J. Freidenfelds,Capacity Expansion: Analysis of Simple Models With Applications (Elsevier North-Holland, 1981).
H. Luss, Operations research and capacity expansion problems: a survey, Oper. Res. 30 (1982) 907–947.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/BF02094336