Solving the Robust Design Problem for a Two-Commodity Flow Network with Node Failure

Abstract

The robust design in a flow network is one of the most important problems. It is defined as searching the optimal capacity that can be assigned to the nodes such that the network still survived even under the node’s failure. This problem is considered NP-hard. So, this study presents a genetic-based algorithm to determine the maximum node capacity for a two-commodity flow network with node failure. I.e., searching the minimum sum of the assigned capacities and the maximum network reliability. The obtained results show that The proposed GA-based algorithm succeeded to solve the robust problem for the two-commodity flow network considering the node’s failure.