Abstract
For the planning of telecommunication transmission networks, a cost-optimal network structure must be calculated under reliability constraints. The situation can be modelled by a multicommodity network with (fixed charge) concave cost functions, where (some) traffic loads must be split up and routed over more than one independent (edge disjoint) path. For the resulting concave cost minimization problem a heuristic procedure is proposed, to find a sequence of local minima with decreasing value of the objective function; the procedure is based on an improved marginal pricing technique and a multirouting extension of Yaged’s method to find minimum cost routing for static network models.
References
K-D Hackbarth, “Ein Verfahren zur Optimierung von Nachrichten-übertragungsnetzen”. Zeitschrift für Operations Research 27 (1983) 21–49.
B. Yaged, “Minimum cost routing for static network models”, Networks 1 (1971) 139–172.
N. Zadeh, “On building minimum cost communication networks”, Networks 3 (1973) 315–331.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Hackbarth, KD. (1986). A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121097
Download citation
DOI: https://doi.org/10.1007/BFb0121097
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00922-8
Online ISBN: 978-3-642-00923-5
eBook Packages: Springer Book Archive