运力约束下油气长输管道应急资源调运模型及算法

Dispatching Model and Algorithm for Emergency Resource of Oil & Gas Long-Distance Pipeline Under Transport-Power Constraint Condition

  • 摘要: 为提高油气长输管道应急救援活动中应急资源调运过程的整体可靠性,讨论了在各应急救援点运力约束条件及应急资源连续性消耗条件下,以应急开始时间最短、出动救援点数目最少为目标的应急资源组合调运问题. 加入应急救援点单程最大运力约束,给出了此约束条件下的连续性消耗两目标应急资源的调运模型,以单目标应急资源调运模型解算法为基础,研究得到了新模型的递推算法. 相应数值模拟算例的计算结果表明,与无运力约束的模型相比,运力约束条件下得到的应急资源调运方案出动的应急救援点数目多,但更符合应急救援实际情况,可指导制定更加准确可靠的油气长输管道应急资源调运方案.

     

    Abstract: To enhance the reliability of emergency resource dispatch for oil and gas long-distance pipeline accidents, it should be ensured to have the shortest starting time for rescue activity and the minimum emergency rescue stations. The optimizing combination problem of emergency resource dispatching is researched in this article, under transport-power constraint condition of rescue stations and continuous consumption condition of emergency resource. Considering the transport-power as a new constraint condition, the continuous consumption emergency resource dispatching model was established and the corresponding recursive algorithm for that model was gained. Further, the rationality of the model and the validity of the algorithm were proved by numerical simulation of an example. The results show that, compared with the plan without consideration of transport-power constraint condition, the emergency resource dispatching plan under transport-power constraint condition contains more emergency rescue stations, but it is more consistent with the real practice. The solution of this work could be used to work out emergency resource dispatching scheme accurately and reliably.

     

/

返回文章
返回
Baidu
map