检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]三峡大学水利与环境学院,湖北宜昌443002 [2]中国水电顾问集团贵阳勘测设计研究院,贵州贵阳550000
出 处:《水电能源科学》2015年第2期108-110,共3页Water Resources and Power
基 金:湖北省教育厅重点项目(D20131301);三峡大学启动人才基金项目(KJ2009B068);湖北省自然科学基金(2014CFB690)
摘 要:针对山区等复杂地表不能用数学函数表达导致管网长度优化工作中点对间最短线程无法采用解析法求解的问题,通过计算点间距离,建立Delaunay三角网离散化地面模型,构建赋权的无向网络图,并采用提高计算效率的改进Dijkstra优化算法计算点对间最短线程,使得管线布置在满足工程条件下线程最短,以降低工程成本,为山区管网优化布置提供依据。金蟾水库纳雍供水管网部分总干线的计算表明,该方法能有效缩短管线线程,具有较强的工程可行性和推广价值。For the problem that mountains and other complex surface can not be expressed by mathematical functions,which led to the shortest thread between two points in the pipe network length optimization work can not be solved by using the analytical method,Deluanay triangulation discrete terrain model is established by calculating the distance between the points.Building weight undirected network graph,improved Dijkstra optimization algorithm is used to calculate the shortest thread between two points so that the pipeline arrangement has the shortest thread under meeting the project conditions for reducing project cost,which provides the basis for mountain network optimize arrangement.The calculation results of the total route of Nayong water supply network in Jinchan reservoir show that the proposed method can effectively shorten the pipeline thread and have strong engineering feasibility and promotional value.
关 键 词:供水管网 离散化 Delaunay三角划分 最短线程 改进的Dijkstra算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.136.226