Parametric Analysis with OpenStudio

  • Larry Brackney
  • Andrew Parker
  • Daniel Macumber
  • Kyle Benne


The previous chapter introduced the concept of OpenStudio Measures and how they can be applied individually and in combination to a Model to create and compare different Design Alternatives. While an improvement from modifying models by hand, generating results, and comparing them; the manual analysis workflow is still labor intensive, non-scalable, and will not necessarily yield the best solution for a given problem. In this chapter, we will discuss how OpenStudio enables automated creation and search of large building parameter spaces. We’ll also look at how these same approaches may be used to “tune” models of existing buildings to best match measured energy consumption data.

Supplementary material (16.3 mb)
Calibration Real Solution (ZIP 16695 kb) (17.8 mb)
MyPatSchoolCalibrationProject (ZIP 18247 kb)


  1. Barricelli N (1957) Symbiogenetic evolution processes realized by artificial methods. Methodos 9:143–182Google Scholar
  2. Belding T (1995) The distributed genetic algorithm revisited. In: Eshelman LJ (ed) Proceedings of the sixth international conference on genetic algorithms. Morgan Kaufmann, San Francisco, CA, pp 114–121Google Scholar
  3. Deb K, Pratap A, Agarwal S (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197CrossRefGoogle Scholar
  4. Ephramac (2017) 2D-Partikelschwarm sucht globales Minimum, 12 Jan 2017.
  5. Fraser A (1957) Simulation of genetic systems by automatic digital computers. Aust J Biol Sci 10:484–491CrossRefGoogle Scholar
  6. Kennedy J, Eberhart R (1995) Particle swarm optimization. Proc IEEE Int Conf Neural Netw IV:1942–1948CrossRefGoogle Scholar
  7. King R, Deb K, Rughooputh H (2010) Comparison of NSGA-II and SPEA2 on the multi-objective environmental/economic dispatch problem. Univ Mauritius Res J 16:485–511Google Scholar
  8. McKay M, Beckman R, Conover W (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21:239–245MathSciNetzbMATHGoogle Scholar
  9. Mebane W Jr, Sekhon J (2011) Genetic optimization using derivatives: the RGenOUD package for R. J Stat Softw 42(11):1–26.
  10. Morris M (1991) Factorial sampling plans for preliminary computational experiments. Technometrics 33:161–174CrossRefGoogle Scholar
  11. Nelder J, Mead R (1965) A simplex algorithm for function minimization. Comput J 7:308–313MathSciNetCrossRefGoogle Scholar
  12. Saltelli A, Tarantola S, Chan K (1999) A quantitative, model independent method for global sensitivity analysis of model output. Technometrics 41:39–56CrossRefGoogle Scholar
  13. Sobol I (2001) Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates. Math Comput Simul 55:271–280MathSciNetCrossRefGoogle Scholar
  14. Zitzler E, Thiele L (1998) An evolutionary algorithm for multi-objective optimization: the strength Pareto approach. Technical report 43, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) ZurichGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Larry Brackney
    • 1
  • Andrew Parker
    • 1
  • Daniel Macumber
    • 1
  • Kyle Benne
    • 1
  1. 1.National Renewable Energy LaboratoryGoldenUSA

Personalised recommendations