Optimization of process plant layout with pipe routing
Optimization of process plant layout with pipe routing
复制标题
DOI：
10.1016/j.compchemeng.2005.08.009
复制
发表时间：
2005-11
期刊：
影响因子：
--
通讯作者：
R. Guirardello;R. Swaney
中科院分区：
文献类型：
--
作者：
R. Guirardello;R. Swaney
提出了化工厂几何布局设计的优化方法。该任务被分解为一系列子问题，并使用混合整数线性规划模型来解决。具有非干扰约束的 3D 布局问题在计算上很困难，并且同时处理构成典型工厂的多个组件的设备放置和管道布线尚不切实际。在所提出的方法中，首先计算布局的优化，然后进行管道布局和布线。这些模型允许结合实际的设计约束。给出的示例表明最终的设计既合理又接近最佳。研究了不同的技术，以便对流程工厂布局进行自动路由。该过程基于对可以布线的节点位置的（部分任意）选择，尊重安全限制和与组件的最小距离。这些节点通过弧线连接，避免了组件的物理空间。由节点和弧定义的图形用于查找管道的最小成本。可以使用两种方法：用于全局最小化所有管道的成本的混合整数线性程序，或用于单独最小化每个管道的成本的最短路径算法。 MILP 方法可以包含容量约束，但它只能应用于小问题。最短路径方法更适合较大的问题，并且可以包括带有分支的管道和应力分析。
An optimization approach for the design of chemical plant geometric layout is presented. The task is decomposed into a sequence of subproblems that are solved using mixed integer linear programming models. The 3D layout problem with noninterference constraints is computationally difficult, and simultaneous treatment for placement of equipment and routing of pipes for the number of components comprising a typical plant is as yet impractical. In the approach presented, the optimization of the layout is computed first, and then is followed by the piping layout and routing. The models allow incorporation of practical design constraints. An example is presented that show the resulting design appear both reasonable and near-optimal. Different techniques are studied in order to do an automatic routing of a process plant layout. The procedure is based on a (partially arbitrary) selection of node positions where pipes can be routed, respecting restrictions of safety and minimum distances from components. These nodes are connected by arcs that avoid the physical space of components. The graph defined by the nodes and arcs are used to find the minimum cost for the pipes. Two methods may be used: a mixed integer linear program for the global minimization of the cost of all pipes, or a shortest path algorithm for the minimization of the cost of each pipe individually. The MILP approach can include capacity constraints, but it can be applied only for small problems. The shortest path approach is better for larger problems and can include pipes with branches and stress analysis.