Computerized Layout Generation for Sanitary Sewers
Computerized Layout Generation for Sanitary Sewers
复制标题
下水道的计算机化布局生成
DOI：
10.1061/(asce)0733-9496(1986)112:4(500
复制
发表时间：
1986
影响因子：
3.1
通讯作者：
H. Belkaya
中科院分区：
文献类型：
--
作者：
S. Tekeli;H. Belkaya
一个布局生成算法，称为LGA，开发用于生成卫生下水道布局，使用标准的最短路径算法。为了选择从每个沙井到最终出口的最短路径，从沙井的下水道长度和表面高程的数据制定了三个下水道成本措施。EX措施要求根据最小覆盖深度和下水道坡度定义每个下水道的假设开挖量，当生成的布局进行水力设计时，产生最小开挖和仰拱深度。结果与建议的最多70个检修孔的网络布局一样好，甚至更好。由于计算机内存的限制，较大的网络必须被划分为子区域，以便随后进行叠加。通过对不同规模网络的LGA进行测试，为分区以及一般实施制定了指南。
A layout generation algorithm, called LGA, is developed for generation of sanitary sewer layouts, using a standard shortest path algorithm. For selection of the shortest path from each manhole to the final outlet, three sewer cost measures were formulated from the data on sewer lengths and surface elevations at the manholes. EX measure, which requires the definition of a hypothetical excavation volume for each sewer from the minimum cover depth and sewer slope, yielded the minimal excavations and invert depths when the generated layouts were hydraulically designed. The results were as good as, or better than, the layouts recommended for networks with up to 70 manholes. Due to computer memory restrictions, the larger networks must be subzoned for subsequent superposition. Guidelines are developed for subzoning as well as general implementation from testing of LGA with various‐sized networks.