In a network topology design problem, it is important to analyze the reliability and construction cost of complex network systems. This paper addresses a topological optimization problem of minimizing the total cost of a network system with separate subsystems under a reliability constraint. To solve this problem, we develop three algorithms. The first algorithm finds an exact solution. The second one finds an exact solution, specialized for a system with identical subsystems. The third one is a heuristic algorithm, which finds an approximate solution when a network system has several identical subsystems. We also conduct numerical experiments and demonstrate the efficacy and efficiency of the developed algorithms.
Yoshihiro MURASHIMA
Tokyo Metropolitan University
Taishin NAKAMURA
Tokai University
Hisashi YAMAMOTO
Tokyo Metropolitan University
Xiao XIAO
Tokyo Metropolitan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yoshihiro MURASHIMA, Taishin NAKAMURA, Hisashi YAMAMOTO, Xiao XIAO, "Topological Optimization Problem for a Network System with Separate Subsystems" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 5, pp. 797-804, May 2021, doi: 10.1587/transfun.2020EAP1066.
Abstract: In a network topology design problem, it is important to analyze the reliability and construction cost of complex network systems. This paper addresses a topological optimization problem of minimizing the total cost of a network system with separate subsystems under a reliability constraint. To solve this problem, we develop three algorithms. The first algorithm finds an exact solution. The second one finds an exact solution, specialized for a system with identical subsystems. The third one is a heuristic algorithm, which finds an approximate solution when a network system has several identical subsystems. We also conduct numerical experiments and demonstrate the efficacy and efficiency of the developed algorithms.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAP1066/_p
Copy
@ARTICLE{e104-a_5_797,
author={Yoshihiro MURASHIMA, Taishin NAKAMURA, Hisashi YAMAMOTO, Xiao XIAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Topological Optimization Problem for a Network System with Separate Subsystems},
year={2021},
volume={E104-A},
number={5},
pages={797-804},
abstract={In a network topology design problem, it is important to analyze the reliability and construction cost of complex network systems. This paper addresses a topological optimization problem of minimizing the total cost of a network system with separate subsystems under a reliability constraint. To solve this problem, we develop three algorithms. The first algorithm finds an exact solution. The second one finds an exact solution, specialized for a system with identical subsystems. The third one is a heuristic algorithm, which finds an approximate solution when a network system has several identical subsystems. We also conduct numerical experiments and demonstrate the efficacy and efficiency of the developed algorithms.},
keywords={},
doi={10.1587/transfun.2020EAP1066},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Topological Optimization Problem for a Network System with Separate Subsystems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 797
EP - 804
AU - Yoshihiro MURASHIMA
AU - Taishin NAKAMURA
AU - Hisashi YAMAMOTO
AU - Xiao XIAO
PY - 2021
DO - 10.1587/transfun.2020EAP1066
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2021
AB - In a network topology design problem, it is important to analyze the reliability and construction cost of complex network systems. This paper addresses a topological optimization problem of minimizing the total cost of a network system with separate subsystems under a reliability constraint. To solve this problem, we develop three algorithms. The first algorithm finds an exact solution. The second one finds an exact solution, specialized for a system with identical subsystems. The third one is a heuristic algorithm, which finds an approximate solution when a network system has several identical subsystems. We also conduct numerical experiments and demonstrate the efficacy and efficiency of the developed algorithms.
ER -