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

• Published in: Computers, materials & continua Vol. 64; no. 3; pp. 1579 - 1586
• Main Authors: Hamed, Ahmed Y, Alkinani, Monagi H, Hassan, M R
• Format: Journal Article
• Language: English
• Published: Henderson Tech Science Press 01.01.2020
• Subjects: Computer networks; Genetic algorithms; Network computers; Operations research; Optimization; Robust design; System reliability
• ISSN: 1546-2226; 1546-2218; 1546-2226
• DOI: 10.32604/cmc.2020.010881

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.