Evolutionary Tuning of Building Model Parameters Aaron Garrett Jacksonville State University.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Logical and Artificial Intelligence in Games Lecture 14
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
10/01/2014 DMI - Università di Catania 1 Combinatorial Landscapes & Evolutionary Algorithms Prof. Giuseppe Nicosia University of Catania Department of.
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
Generative Design in Civil Engineering Using Cellular Automata Rafal Kicinger June 16, 2006.
An Investigation on FPGA Placement Using Mixed Genetic Algorithm with Simulated Annealing Meng Yang Napier University Edinburgh, UK.
Solve Multi-step Equations
Particle Swarm Optimization (PSO)
Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.
Von Karman Institute for Fluid Dynamics RTO, AVT 167, October, R.A. Van den Braembussche von Karman Institute for Fluid Dynamics Tuning of Optimization.
ABC Technology Project
5-1 Chapter 5 Theory & Problems of Probability & Statistics Murray R. Spiegel Sampling Theory.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Computational Intelligence Winter Term 2009/10 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Chapter 4 Inference About Process Quality
Solve by Substitution: Isolate one variable in an equation
CHAPTER 2 – DISCRETE DISTRIBUTIONS HÜSEYIN GÜLER MATHEMATICAL STATISTICS Discrete Distributions 1.
Optimization 1/33 Radford, A D and Gero J S (1988). Design by Optimization in Architecture, Building, and Construction, Van Nostrand Reinhold, New York.
© 2012 National Heart Foundation of Australia. Slide 2.
Artificial Intelligence
A First Course in Genetic Algorithms
PSSA Preparation.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Commonly Used Distributions
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Derivative-Free Optimization: Biogeography-Based Optimization Dan Simon Cleveland State University 1.
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
CHAPTER 9 E VOLUTIONARY C OMPUTATION I : G ENETIC A LGORITHMS Organization of chapter in ISSO –Introduction and history –Coding of  –Standard GA operations.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Hybridization of Search Meta-Heuristics Bob Buehler.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Heuristics for Adaptive Temperature-Aware SoC Test Scheduling Considering Process Variation Nima Aghaee, Zebo Peng, and Petru Eles Embedded Systems Laboratory.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Khaled Rasheed Computer Science Dept. University of Georgia
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Genetic Algorithm.
Multimodal Optimization (Niching) A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms Czech Technical University in Prague, Faculty of Electrical Engineering Ondřej Vaněk, Agent Technology Center ZUI 2011.
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
Edge Assembly Crossover
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Evolutionary Algorithms Jim Whitehead
Differential Evolution (DE) and its Variant Enhanced DE (EDE)
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
C.-S. Shieh, EC, KUAS, Taiwan
Who cares about implementation and precision?
Multi-Objective Optimization
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
M. Kezunovic (P.I.) S. S. Luo D. Ristanovic Texas A&M University
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Presentation transcript:

Evolutionary Tuning of Building Model Parameters Aaron Garrett Jacksonville State University

Conclusion Evolutionary approach reduces electrical… monthly SAE by almost 20% (250 kWh) hourly SAE by over 10% (700 kWh) hourly RMSE by over 7%

Evolution is a search algorithm Type of beam search Less vulnerable to local optima Optimizes based on environment

Evolutionary computation Simulates evolution by natural selection Genetic algorithms Evolution strategies Genetic programs Particle swarm optimization Ant colony optimization Problem domain information is invaluable

An evolutionary approach Individual: Building parameters Fitness: Error between E+ output and sensor data

What is an individual? Defined by 108 real-valued parameters Material Thickness Conductivity Density Specific Heat Thermal Absorptance Solar Absorptance Visible Absorptance WindowMaterial:SimpleGlazingSystem U-Factor Solar Heat ZoneInfiltration:FlowCoefficient Shadow Calculation Frequency

What is the fitness? Individual Model Actual Building Data Error Fitness

How do they evolve? MomDadBrotherSister

How are offspring produced? ThicknessConductivityDensitySpecific Heat Mom Dad Brother Sister Average each component Add Gaussian noise

EC parameters Population size 16 Tournament selection (tournament size 4) Generational replacement with weak elitism (1 elite) Gaussian mutation (mutation rate 10% of variable range) Heuristic crossover

Building model search space 108 dimensions Effectively infinite because continuous-valued Limit here is 1024 simulations per search Approximately what could be done in a weekend on single-core processor 1024 is incredibly small number of samples

How do we get more for less? EnergyPlus is slow Full-year schedule 8 – 10 minutes per simulation Use abbreviated 4-day schedule instead Jan 1, Apr 1, Aug 1, Nov 1 15 – 30 seconds per simulation

Will that even work? 4 independent random trials 1024 simulations per trial Samples taken from high to low error Monthly Electrical Usage r = 0.94 Hourly Electrical Usage r = 0.96

The less expensive approach Individual Model Actual Building Data Error Fitness

About that actual data… 2% of the 15-minute measurements failed Monthly electrical usage Just ignore missing data (treat as 0) Hourly electrical usage Any hour containing a single failure was counted as a failure (8%) Failures were not counted in error measure

How good are the existing models? ModelMonthly SAEHourly SAEHourly RMSE V7-A July

Evolve using 4-day schedule 8 independent trials 1024 simulations per trial Monthly SAE 15%13% 60% Hourly SAE 9%8% 35% Hourly RMSE 6%7% 26%

And the full year schedule? Only run on hourly usage 8 independent trials 1024 simulations per trial Hourly SAE 9%8%11%12% Hourly RMSE 6%7% 10%

Combining the two… Evolve

Serial evolution 8 independent trials 1024 simulations per trial 768 simulations for abbreviated; 256 simulations for full 11%12%11%9% Hourly SAE 7%10%7%8% Hourly RMSE

On-deck Circle Combining a different way…

Parallel evolution 8 independent trials 256 simulations for full year schedule 768 simulations for abbreviated schedule Hourly SAE 11%9%10% Hourly RMSE 7%8%7%9%

A bit surprising… 25%

Conclusion Evolutionary approach reduces electrical… monthly SAE by almost 20% (250 kWh) hourly SAE by over 10% (700 kWh) hourly RMSE by over 7%

What’s next? Incorporate machine learning as fast island Include temperature errors in fitness How should this be combined with electrical usage error? Should the be optimized separately with EMO approach?