Research Article Open Access

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

Noha Hamdy Radwan1, Moatamad Refaat Hassan1 and Mohamed Eid Hussein1
  • 1 Aswan University, Egypt

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.

American Journal of Engineering and Applied Sciences
Volume 13 No. 4, 2020, 837-845

DOI: https://doi.org/10.3844/ajeassp.2020.837.845

Submitted On: 13 October 2020 Published On: 28 December 2020

How to Cite: Radwan, N. H., Hassan, M. R. & Eid Hussein, M. (2020). Solving the Robust Design Problem for a Two-Commodity Flow Network with Node Failure. American Journal of Engineering and Applied Sciences, 13(4), 837-845. https://doi.org/10.3844/ajeassp.2020.837.845

  • 2,260 Views
  • 767 Downloads
  • 0 Citations

Download

Keywords

  • Flow Network
  • Robust Design
  • Two-Commodity
  • Node Failure
  • Genetic Algorithm