Skip to main content

Process Plant Layout Optimization: Equipment Allocation

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (CP 2018)

Abstract

Designing the layout of a chemical plant is a complex and important task. Its main objective is to find a most economical spatial arrangement of the equipment and associated pipes that satisfies construction, operation, maintenance and safety constraints. The problem is so complex it is still solved manually, taking multiple engineers many months (or even years) to complete. This paper provides (a) the most comprehensive model ever reported in the literature for spatially arranging the equipment, and (b) a Large Neighbourhood Search framework that enables complete solvers explore much larger neighbourhoods than previous approaches to this problem. The two contributions are part of a system being developed in collaboration with Woodside Energy Ltd. for arranging their Liquefied Natural Gas plants. The results are indeed so promising that Woodside are actively exploring its commercialisation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. AMEC Paragon launches optimized FEED design process. Zeus Technology Magazine, 4(2), 1–3 (2009)

    Google Scholar 

  2. Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Global constraint catalogue: Past, present and future. Constraints 12(1), 21–62 (2007)

    Article  MathSciNet  Google Scholar 

  3. Belov, G., et al.: An optimization model for 3D pipe routing with flexibility constraints. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 321–337. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66158-2_21

    Chapter  Google Scholar 

  4. Belov, G., Stuckey, P.J., Tack, G., Wallace, M.: Improved linearization of constraint programming models. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 49–65. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44953-1_4

    Chapter  Google Scholar 

  5. Chu, G.G.: Improving combinatorial optimization. Ph.D. thesis (2011)

    Google Scholar 

  6. Guirardello, R., Swaney, R.E.: Optimization of process plant layout with pipe routing. Comput. Chem. Eng. 30(1), 99–114 (2005)

    Article  Google Scholar 

  7. Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual Version 7.5. Gurobi Optimization, Houston, Texas (2017)

    Google Scholar 

  8. IBM: IBM ILOG CPLEX Optimization Studio. CPLEX User’s Manual (2017)

    Google Scholar 

  9. Kar, Y.T., Shi, G.L.: A hierarchical approach to the facility layout problem. Int. J. Prod. Res. 29(1), 165–184 (1991)

    Article  Google Scholar 

  10. Mecklenburgh, J.C.: Process Plant Layout. Halsted Press; Wiley, New York (1985)

    Google Scholar 

  11. Nethercote, N., et al.: MiniZinc: Towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74970-7_38

    Chapter  Google Scholar 

  12. Peters, M.S., Timmerhaus, K.D.: Plant Design and Economics for Chemical Engineers, 5th edn. McGraw-Hill Book Company, New York (2004)

    Google Scholar 

  13. Pisinger, D., Sigurd, M.M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J. Comput. 19(1), 36–51 (2007)

    Article  MathSciNet  Google Scholar 

  14. Sakti, A., Zeidner, L., Hadzic, T., Rock, B.S., Quartarone, G.: Constraint programming approach for spatial packaging problem. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 319–328. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-33954-2_23

    Chapter  MATH  Google Scholar 

  15. Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and programming with Gecode (2017). www.gecode.org

  16. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49481-2_30

    Chapter  Google Scholar 

  17. Xu, G., Papageorgiou, L.G.: A construction-based approach to process plant layout using mixed-integer optimization. Ind. Eng. Chem. Res. 46(1), 351–358 (2007)

    Article  Google Scholar 

  18. Xu, G., Papageorgiou, L.G.: Process plant layout using an improvement-type algorithm. Chem. Eng. Res. Des. 87(6), 780–788 (2009)

    Article  Google Scholar 

Download references

Acknowledgements

Funded by Woodside Energy Ltd. and the Australian Research Council grant DP180100151. We thank our Woodside collaborators, particularly Solomon Faka and Michelle Frayne, for the many useful discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gleb Belov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Belov, G. et al. (2018). Process Plant Layout Optimization: Equipment Allocation. In: Hooker, J. (eds) Principles and Practice of Constraint Programming. CP 2018. Lecture Notes in Computer Science(), vol 11008. Springer, Cham. https://doi.org/10.1007/978-3-319-98334-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98334-9_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98333-2

  • Online ISBN: 978-3-319-98334-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics