An optimal capacity assignment for the robust design problem in capacitated flow networks

作者：Chen Shin Guang^*

来源：Applied Mathematical Modelling, 2012, 36(11): 5272-5282.

DOI：10.1016/j.apm.2011.12.034

• Capacitated-flow network
• Capacity assignment
• Robustness
• Critical analysis
• Structural analysis
• Network reliability

This paper proposes an exact algorithm to solve the robust design problem in a capacitated flow network in which each edge has several possible capacities. A capacitated flow network is popular in our daily life. For example, the computer network, the power transmission network, or even the supply chain network are capacitated flow networks. In practice, such network may suffer failure, partial failure or maintenance. Therefore, each edge in the network should be assigned sufficient capacity to keep the network functioning normally. The robust design problem (RDP) in a capacitated flow network is to search for the minimum capacity assignment of each edge such that the network still survived even under the edge's failure. However, how to optimally assign the capacity to each edge is not an easy task. Although this kind of problem was known of NP-hard, this paper proposes an efficient exact algorithm to search for the optimal solutions for such a network and illustrates the efficiency of the proposed algorithm by numerical examples.

• 出版日期2012-11