论文部分内容阅读
本文讨论炼油厂输油管网调线的最优化与自动问题。建立了调线的织学模型与最优化算法，把调线最优化问题看作一个等效的最短路径问题，用动态规划中的“驿站马车”问题解法来进行调线优化计算。给出了两种情况下的算法与程序框图：（１）最大流量状态（适用于最快装运与调转）；（２）恒定流量状态（适用于油品调合）。最后讨论了使用计算机系统（单级或多级）实现的问题。给出了数字实例。
This article discusses refinery pipelines network optimization and automation problems. The dyadic model and optimization algorithm are established. The problem of line optimization is considered as an equivalent shortest path problem, and the optimization of line alignment is carried out by solving the “Station Coach” problem in dynamic programming. The algorithm and the block diagram are given in two cases: (1) the maximum flow state (for the fastest shipment and transfer); (2) the constant flow state (for oil blending). Finally, the issue of using computer systems (single-level or multi-level) is discussed. Give a numerical example.