Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access


    A Genetic Algorithm to Solve Capacity Assignment Problem in a Flow Network

    Ahmed Y. Hamed1, Monagi H. Alkinani2, M. R. Hassan3, *

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1579-1586, 2020, DOI:10.32604/cmc.2020.010881

    Abstract Computer networks and power transmission networks are treated as capacitated flow networks. A capacitated flow network may partially fail due to maintenance. Therefore, the capacity of each edge should be optimally assigned to face critical situations—i.e., to keep the network functioning normally in the case of failure at one or more edges. 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. The RDP is known as NP-hard. Thus, capacity assignment problem subject to system reliability and total… More >

Displaying 1-10 on page 1 of 1. Per Page