Reducing Search Space in the Topological Network Design Problem with a Reliability Constraint  
Author Natsumi Takahashi


Co-Author(s) Tetsushi Yuge


Abstract We concern the minimization problem of the total construction/maintenance cost subject to the condition that the all-terminal reliability is not less than a reliability threshold. Although decomposing algorithm for solving this problem has been proposed based on the so-called branch and bound method, it is known that the implement of the existing algorithm requires a large amount of time, especially in the case that the number of edges is quite greater than the number of nodes. To reduce the computational time, we apply the distance between nodes and edge reliability. Numerical experiments show the effectiveness of the search space reduction based on the distance for all other nodes and the edge reliability.


Keywords Network system, optimization algorithm, maximum all-terminal reliability, network topology design
    Article #:  RQD28-167

Proceedings of 28th ISSAT International Conference on Reliability & Quality in Design
August 3-5, 2023