The objective of this study is to investigate a network failure problem with a significant path, emerging from the context of crisis management, such as in the case of natural disasters. For a given tree with m failed...The objective of this study is to investigate a network failure problem with a significant path, emerging from the context of crisis management, such as in the case of natural disasters. For a given tree with m failed edges, we assume that we have sufficient resources to recover k edges of the m edges. Each node has a positive weight. In this situation, we consider which k edges should be fixed in order to maximize the sum of the weights of the nodes reachable from the significant path. In this paper, we formulate such a problem as a combinatorial problem. Further, we show that a part of our problem may be solved by translating it into the terms of the so-called tree knapsack problem.展开更多
This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide...This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide demands. The optimal recovery solution was achieved through the application of so-called network design problems （NDPs）, which are a form of combinatorial optimization problem. However, a conventional NDP is not suitable for addressing urgent situations because （1） it does not utilize the non-failure arcs in the network, and （2） it is solely concerned with stable costs such as flow costs. Therefore, to adapt the technique to such urgent situations, the conventional NDP is here modified to deal with the specified water supply problem. In addition, a numerical illustration using the Sendai water network is presented.展开更多
文摘The objective of this study is to investigate a network failure problem with a significant path, emerging from the context of crisis management, such as in the case of natural disasters. For a given tree with m failed edges, we assume that we have sufficient resources to recover k edges of the m edges. Each node has a positive weight. In this situation, we consider which k edges should be fixed in order to maximize the sum of the weights of the nodes reachable from the significant path. In this paper, we formulate such a problem as a combinatorial problem. Further, we show that a part of our problem may be solved by translating it into the terms of the so-called tree knapsack problem.
文摘This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide demands. The optimal recovery solution was achieved through the application of so-called network design problems （NDPs）, which are a form of combinatorial optimization problem. However, a conventional NDP is not suitable for addressing urgent situations because （1） it does not utilize the non-failure arcs in the network, and （2） it is solely concerned with stable costs such as flow costs. Therefore, to adapt the technique to such urgent situations, the conventional NDP is here modified to deal with the specified water supply problem. In addition, a numerical illustration using the Sendai water network is presented.
