基于N条最短路径的成品油管道优化设计  

Based on N Shortest Path Optimal Design the Products Pipeline

作　　者：初飞雪[1] 吴先策[1] 张宗伟[1] 

机构地区：[1]中国民航大学交通工程学院,天津300300

出　　处：《石油化工高等学校学报》2008年第2期84-88,共5页Journal of Petrochemical Universities

基　　金：中国民航大学资助项目(06QD04s)

摘　　要：采用了赋权有向图来表示成品油管道工艺方案优化设计问题,若干个泵站位置候选点对应图的顶点,两顶点间管段的总费用现值对应弧的权值,通过循环调用Dijkstra算法,求解出了前N条最短路径作为最优和次优方案,以备多方案比选。该方法既兼顾了工程实际的要求,又可以给出最优、次优工艺方案。实际算例表明该方法切实可行。所提出的方法可以推广应用到其它油气管道工艺方案优化设计或其它工程应用。Under condition of the possible locations of the pump station were determined. And applied directed edge-weight graph to describe the optimization problem of the products pipeline, and graph theory was used to analyze the problem. The candidate pump station locations were taken as the vertices and the total cost of the pipeline system between the two vertices were looked as the edge-weighted. Then algorithm recursively calling the Dijkstra algorithm was designed and analyzed to obtain N shortest paths, so the optimal alternative and the quasi-optimal alternatives were obtained at the same time, these alternatives can be used to compare by the designer. Moreover, the algorithm was tested by a real example; it can meet the need of real application. Applied this method can avoid adjustment the locations of the pump station, and more fit the need of the engineering, It also can be extended to the other long-distance oil or gas pipeline optimal design.

关 键 词：赋权有向图 N条最短路径 成品油管道 优化设计 

分 类 号：TE732[石油与天然气工程]