Robust Design Problem for Multi-Source Multi-Sink Flow Networks Based on Genetic Algorithm Approach
Sahbi Boubaker, Noha Hamdy Radwan, Moatamad Refaat Hassan, Faisal S. Alsubaei, Ahmed Younes, Hameda A. Sennary
Source abstract
Robust design problems in flow networks involve determining the optimal capacity assignments that enable the network to operate effectively even in the case of events’ occurrence such as arcs or nodes’ failures. Multi-source multi-sink flow networks (MMSFNs) are frequent in many real-life systems such as computer and telecommunication, logistics and supply-chain, and urban traffic. Although numerous studies on the design of MMSFNs have been conducted, the robust design problem for multi-source multi-sink stochastic-flow networks (MMSFNs) remains unexplored. To contribute to this field, this study addresses the robust design problem for MMSFNs using an approach of two steps. First, the problem is mathematically formulated as an optimization problem and second, a sub-optimal solution is proposed based on a genetic algorithm (GA) involving two components. The first component, an outer genetic algorithm, is employed to search the optimal capacity assigned to the network components with minimum sum. The second component, an inner genetic algorithm, is used to find the optimal flow vectors that maximize the system’s reliability. Through extensive experimentation on three different networks with different topologies, the proposed solution has been found to be efficient.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.