Skip to main content

Open Packing for Facade-Layout Synthesis Under a General Purpose Solver

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

Abstract

Facade-layout synthesis occurs when renovating buildings to improve their thermal insulation and reduce the impact of heating on the environment. This interesting problem involves to cover a facade with a set of disjoint and configurable insulating panels. Therefore, it can be seen as a constrained rectangle packing problem, but for which the number of rectangles to be used and their size are not known a priori. This paper proposes an efficient way of solving this problem using constraint programming. The model is based on an open variant of the DiffN global constraint in order to deal with an unfixed number of rectangles, as well as a simple but efficient search procedure to solve this problem. An empirical evaluation shows the practical impact of every choice in the design of our model. A prototype implemented in the general purpose solver Choco is intended to assist architect decision-making in the context of building thermal retrofit.

The authors wish to acknowledge the TBC Générateur d’Innovation company, the Millet and SyBois companies and all partners in the CRIBA project, for their involvement in the construction of the CSP model.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barták, R.: Dynamic global constraints in backtracking based environments. Annals of Operations Research 118(1–4), 101–119 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 180–194. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Beldiceanu, N., Carlsson, M., Demassey, S., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping rectangles. Annals of Operations Research 184(1), 27–50 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  4. The Energy Conservation Center: Energy Conservation Handbook. The Energy Conservation Center, Japan (2011)

    Google Scholar 

  5. Charman, P.: Solving space planning problems using constraint technology (1993)

    Google Scholar 

  6. U.S. Green Building Council: New Construction Reference Guide (2013)

    Google Scholar 

  7. Falcon, M., Fontanili, F.: Process modelling of industrialized thermal renovation of apartment buildings. In: eWork and eBusiness in Architecture, Engineering and Construction, pp. 363–368 (2010)

    Google Scholar 

  8. Imahori, S., Yagiura, M., Nagamochi, H.: Practical algorithms for two-dimensional packing. Chapter 36 of Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series) (2007)

    Google Scholar 

  9. Jelle, B.P.: Traditional, state-of-the-art and future thermal building insulation materials and solutions - properties, requirements and possibilities. Energy and Buildings 43(10), 2549–2563 (2011)

    Article  Google Scholar 

  10. Juan, Y.-K., Gao, P., Wang, J.: A hybrid decision support system for sustainable office building renovation and energy performance improvement. Energy and Buildings 42(3), 290–297 (2010)

    Article  Google Scholar 

  11. Laborie, P.: IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 148–162. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Lee, K.J., Hyun, W.K., Lee, J.K., Kim, T.H.: Case- and constraint-based project planning for apartment construction. AI Magazine 19(1), 13–24 (1998)

    MATH  Google Scholar 

  13. Robin, S.: Liggett. Automated facilities layout: past, present and future. Automation in Construction 9(2), 197–215 (2000)

    Article  MathSciNet  Google Scholar 

  14. Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7, 95–132 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  15. Olarte, C., Rueda, C., Valencia, F.D.: Models and emerging trends of concurrent constraint programming. Constraints 18(4), 535–578 (2013)

    Article  MathSciNet  Google Scholar 

  16. Pérez-Lombard, L., Ortiz, J., Pout, C.: A review on buildings energy consumption information. Energy and Buildings 40(3), 394–398 (2008)

    Article  Google Scholar 

  17. Prud’homme, C., Fages, J.G.: An introduction to Choco 3.0, an open source java constraint programming library. In: International workshop on CP Solvers: Modeling, Applications, Integration, and Standardization, Uppsala, Sweden (2013)

    Google Scholar 

  18. Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and programming with Gecode (2010)

    Google Scholar 

  19. Schutt, A., Feydy, T., Stuckey, P.J.: Scheduling optional tasks with explanation. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 628–644. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  20. Smith, B.M.: Modelling for constraint programming (2005)

    Google Scholar 

  21. van Hoeve, W.-J., Hooker, J.N. (eds.): CPAIOR 2009. LNCS, vol. 5547. Springer, Heidelberg (2009)

    Google Scholar 

  22. van Hoeve, W.-J., Régin, J.-C.: Open constraints in a closed world. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol. 3990, pp. 244–257. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Vareilles, E., Barco Santa, A.F., Falcon, M., Aldanondo, M., Gaborit, P.: Configuration of high performance apartment buildings renovation: a constraint based approach. In: 2013 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 684–688, December 2013

    Google Scholar 

  24. Zawidzki, M., Tateyama, K., Nishikawa, I.: The constraints satisfaction problem approach in the design of an architectural functional layout. Engineering Optimization 43(9), 943–966 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrés Felipe Barco .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Barco, A.F., Fages, JG., Vareilles, E., Aldanondo, M., Gaborit, P. (2015). Open Packing for Facade-Layout Synthesis Under a General Purpose Solver. In: Pesant, G. (eds) Principles and Practice of Constraint Programming. CP 2015. Lecture Notes in Computer Science(), vol 9255. Springer, Cham. https://doi.org/10.1007/978-3-319-23219-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23219-5_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23218-8

  • Online ISBN: 978-3-319-23219-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics