流向图回溯法及传输网络From-To解算方法和技术研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Research on Transport Network From-To Calculation Based on Flow Graph
  • 作者:冯治东 ; 张培元
  • 英文作者:FENG Zhi-Dong;ZHANG Pei-Yuan;School of Information Engineering, Yulin University;Jinjie Colliery, Shenhua Shendong Coal Group Co.Ltd.;
  • 关键词:传输网络 ; 流向图 ; From-To解算 ; 回溯法 ; 矿井排水
  • 英文关键词:transport network;;flow graph;;From-To calculation;;backtracking;;mine drainage
  • 中文刊名:XTYY
  • 英文刊名:Computer Systems & Applications
  • 机构:榆林学院信息工程学院;中国神华神东锦界煤矿;
  • 出版日期:2018-06-15
  • 出版单位:计算机系统应用
  • 年:2018
  • 期:v.27
  • 基金:陕西省教育厅专项计划项目(16JK1896);; 榆林学院博士科研启动基金(16GK23)
  • 语种:中文;
  • 页:XTYY201806035
  • 页数:6
  • CN:06
  • ISSN:11-2854/TP
  • 分类号:227-232
摘要
针对传输网络中流体"从哪里来,到哪里去"的确定问题,基于图回溯法,提出了一种基于流向图的传输网络From-To解算方法.根据传输网络中的驱动点、管道、闸阀和出口各属性状态,将整个网络转化为初始流向图拓扑结构,根据图回溯原理,逐步累积计算管道中流体的来源和去向,直到全部管道回溯结束,得出最终流向图.在此基础上,研发了基于Observer设计模式的"From-To解算"通用组件接口,并被应用于某大型煤矿的复杂排水管网的计算机仿真平台中,应用效果较好.
        An approach called "From-To Calculation Algorithm Based on Flow Graph" is presented. It is used to calculate the "from-position" and "to-position" of flow in complex piping network. By representing the piping network with graph topology, using the principle of maze backtracking, the direction of all the aspects can be determined in the piping system.A general component of the algorithm is developed using C# computer language based on generic parameter, interface technology and delegated observer mode. The algorithm is then applied to a mine drainage system. By taking the water pumps & joints as nodes, and pipes as edges, all flow "From-To" can be automatically calculated with "flow graph algorithm". Application results show that it can be an effective solution to calculate where a flow is from and where it will go.
引文
1何杨,王建中,鲁仁全.基于两个节点排水管网水力学模型的新方法.化工学报,2010,61(8):1901–1904.
    2 王东云,徐艳平,瞿博阳.基于改进蜂群算法的机器人路径规划.计算机系统应用,2017,26(2):145–150.
    3Zhang JX,Liang MG,Wang ZW.Efficient algorithm for finding multi-paths in telecommunication networks.Key Engineering Materials,2011,474–476:2274–2278.[doi:10.4028/www.scientific.net/KEM.474-476]
    4Kumar CN,Satyanarayana N.Multipath Qo S routing for traffic splitting in MANETs.Procedia Computer Science,2015,48:414–426.[doi:10.1016/j.procs.2015.04.115]
    5 赵德群,段建英,陈鹏宇,等.基于A*算法的三维地图最优路径规划.计算机系统应用,2017,26(7):146–152.
    6Qureshi AH,Ayaz Y.Potential functions based sampling heuristic for optimal path planning.Autonomous Robots,2016,40(6):1079–1093.[doi:10.1007/s10514-015-9518-0]
    7 Feng RJ,Li TL,Wu YF,et al.Reliable routing in wireless sensor networks based on coalitional game theory.IET Communications,2016,10(9):1027–1034.[doi:10.1049/ietcom.2015.0884]
    8冯治东,卢才武,张培元.树形探测法及其在矿井排水智能流向计算中的应用.计算机工程与应用,2014,50(10):227 –232.[doi:10.3778/j.issn.1002-8331.1309-0288]
    9 胡运权.运筹学教程.4版.北京:清华大学出版社,2012.
    10Weiss MA.Data Structures and Algorithm Analysis in C++.3 rd ed.New Jersey:Addison Wesley,2007.
    11 Meier JD,Homer A,Hill D,et al.Application architecture guide 2.0.http://msdn.microsoft.com/en-us/library/dd673617.aspx,2009.
    12Stellman A,Greene J.Head First C#.New York:O’Reilly Media Inc.,2007.
    13 Pelikhan.Quick Graph,graph data structures and algorithms for.NET.http://quickgraph.codeplex.com/documentation,2009.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700