An Optimization Model for 3D Pipe Routing with Flexibility Constraints

Optimizing the layout of the equipment and connecting pipes that form a chemical plant is an important problem, where the aim is to minimize the total cost of the plant while ensuring its safety and correct operation. The complexity of this problem is such that it is still solved manually, taking multiple engineers several years to complete. Most research in this area focuses on the simpler subproblem of placing the equipment, while the approaches that take pipe routing into account are either based on heuristics or do not consider sufficiently realistic scenarios. Our work presents a new model of the pipe routing subproblem that integrates realistic requirements, such as flexibility constraints, and aims for optimality while solving the largest problem instance considered in the literature. The model is being developed in collaboration with Woodside Energy Ltd. for their Liquefied Natural Gas plants, and is implemented in the high-level modeling language MiniZinc. The use of MiniZinc has both reduced the amount of time required to develop the model, and allowed us to easily experiment with different solvers.

[1]  Mats Carlsson,et al.  Global Constraint Catalogue: Past, Present and Future , 2007, Constraints.

[2]  Lazaros G. Papageorgiou,et al.  A Construction-Based Approach to Process Plant Layout Using Mixed-Integer Optimization , 2007 .

[3]  Manfred W. Padberg,et al.  Packing small boxes into a big box , 2000, Math. Methods Oper. Res..

[4]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[5]  Lazaros G. Papageorgiou,et al.  Process plant layout using an improvement-type algorithm , 2009 .

[6]  Peter J. Stuckey,et al.  Philosophy of the MiniZinc challenge , 2010, Constraints.

[7]  Lawrence Zeidner,et al.  Constraint Programming Approach for Spatial Packaging Problem , 2016, CPAIOR.

[8]  Ross E. Swaney,et al.  Optimization of process plant layout with pipe routing , 2005, Comput. Chem. Eng..

[9]  Jean-Claude Latombe,et al.  Pipe routing-path planning (with many constraints) , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[10]  Peter J. Stuckey,et al.  Improved Linearization of Constraint Programming Models , 2016, CP.

[11]  Barry O'Sullivan,et al.  Search Strategies for Rectangle Packing , 2008, CP.

[12]  Kyrre Glette,et al.  Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings , 2010, EvoCOP.

[13]  Mark de Berg,et al.  Shortest path queries in rectilinear worlds , 1992, Int. J. Comput. Geom. Appl..

[14]  Yan Lin,et al.  A co-evolutionary improved multi-ant colony optimization for ship multiple and branch pipe route design , 2015 .

[15]  Geoffrey Chu,et al.  Improving combinatorial optimization , 2011 .