Optimization of process plant layout with pipe routing

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.