Vol.64, No.3, 2020, pp.1579-1586, doi:10.32604/cmc.2020.010881
OPEN ACCESS
ARTICLE
A Genetic Algorithm to Solve Capacity Assignment Problem in a Flow Network
  • Ahmed Y. Hamed1, Monagi H. Alkinani2, M. R. Hassan3, *
1 Department of Computer Science, Faculty of Computers and Information, Sohag University, Sohag, 82524, Egypt.
2 Department of Computer Science and Artificial Intelligence, College of Computer Science and Engineering, University of Jeddah, Jeddah, 21959, Saudi Arabia.
3 Department of Mathematics and Computer Science, Faculty of Science, Aswan University, Aswan, 81528, Egypt.
* Corresponding Author: M. R. Hassan. Email: mr.hassan@sci.aswu.edu.eg.
Received 03 April 2020; Accepted 06 May 2020; Issue published 30 June 2020
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 capacity constraints is studied in this paper. The problem is formulated mathematically, and a genetic algorithm is proposed to determine the optimal solution. The optimal solution found by the proposed algorithm is characterized by maximum reliability and minimum total capacity. Some numerical examples are presented to illustrate the efficiency of the proposed approach.
Keywords
Flow network, capacity assignment, network reliability, genetic algorithms.
Cite This Article
Hamed, A. Y., Alkinani, M. H., Hassan, M. R. (2020). A Genetic Algorithm to Solve Capacity Assignment Problem in a Flow Network. CMC-Computers, Materials & Continua, 64(3), 1579–1586.