Scholarlink

<p>In recent years, heavy precipitation events have occurred frequently and caused urban waterlogging disasters in many cities. Though multiple measures should be taken to deal with the urban waterlog problem, the urban drainage network capacity expansion (DNCE) should not be disregarded and deserves studying. Unfortunately, currently a practical algorithm for the DNCE is rare. In this paper, we presented an algorithm for the DNCE of a city. The algorithm is to expand the capacity of some bottleneck arcs in a network to maximize the minimum cost maximum flow to meet the demand of the rainwater displacement at the water gathering points at the lowest cost. The algorithm is based on the augmented chains and the arc reserve capacity. The augmented chains with the minimum unit capacity expansion cost is selected to expand at each iteration of the algorithm. The capacity of the network is the sum of the updated capacities on all the augmented chains. The capacity is expanded to meet the demand to avoid waterlog. The application of the algorithm to a network shows its validity. It is useful in urban drainage network planning in a city.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Capacity Expansion for Urban Drainage Network To Avoid Waterlogging in Cities

  • 期刊论文

  • 发表日期：

    2025年12月22日

查看全文
  • Tianze Xu,
  • Xiaoguo Zhang,
  • Baoshun Song,
  • Lunrui Zhang

摘要

In recent years, heavy precipitation events have occurred frequently and caused urban waterlogging disasters in many cities. Though multiple measures should be taken to deal with the urban waterlog problem, the urban drainage network capacity expansion (DNCE) should not be disregarded and deserves studying. Unfortunately, currently a practical algorithm for the DNCE is rare. In this paper, we presented an algorithm for the DNCE of a city. The algorithm is to expand the capacity of some bottleneck arcs in a network to maximize the minimum cost maximum flow to meet the demand of the rainwater displacement at the water gathering points at the lowest cost. The algorithm is based on the augmented chains and the arc reserve capacity. The augmented chains with the minimum unit capacity expansion cost is selected to expand at each iteration of the algorithm. The capacity of the network is the sum of the updated capacities on all the augmented chains. The capacity is expanded to meet the demand to avoid waterlog. The application of the algorithm to a network shows its validity. It is useful in urban drainage network planning in a city.