✦ LIBER ✦

Optimal expansion of capacitated transshipment networks

✍ Scribed by R.K. Ahuja; J.L. Batra; S.K. Gupta; A.P. Punnen

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 712 KB
Volume: 89
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)90072-7

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we address the problem of allocating a given budget to increase the capacities of arcs in a transshipment network to minimize the cost of flow in the network. The capacity expansion costs of arcs are assumed to be piecewise linear convex functions. We use properties of the optimum solution to convert this problem into a parametric network flow problem. The concept of optimum basis structure is used which allows us to consider piecewise linear convex functions without introducing additional arcs. The resulting algorithm yields an optimum solution of the capacity expansion problem for all budget levels less than or equal to the given budget. For integer data, the algorithm performs almost all computations in integers. Detailed computational results are also presented.

📜 SIMILAR VOLUMES

Optimal pricing of capacitated networks

✍ Alexander Grigoriev; Joyce van Loon; René Sitters; Marc Uetz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Optimal design of capacitated production

Optimal design of capacitated production networks

✍ Agnes Dittel; Simone Göttlich; Ute Ziegler 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 814 KB

Optimal expansion of an existing network

✍ Nicos Christofides; P. Brooker 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 662 KB

Algorithm of capacity expansion on netwo

Algorithm of capacity expansion on networks optimization

✍ Shengsheng Yu; Yuhua Liu; Jingzhong Mao; Kaihua Xu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 324 KB

Design of capacitated networks with tree

Design of capacitated networks with tree configurations

✍ Kyungsik Lee; Kyungchul Park; Sungsoo Park 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 1023 KB

Managing the Topological Expansion of Co

Managing the Topological Expansion of Computer Networks in an Optimal Way

✍ Debashis Saha; Amitava Mukherjee 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 453 KB 👁 2 views

This article describes a subgradient-based near-optimal heuristic algorithm designed for minimizing the search of links that need to be added to an existing telecommunications network to enhance the survivability and routability of the network.