Interactive Layout Design Optimization Author: Jeremy J. Michalek Presented by: Hoda Homayouni.

Slides:



Advertisements
Similar presentations
Chapter 4 Partition I. Covering and Dominating.
Advertisements

13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
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)
Linear Programming Problem
Greedy Algorithms.
Linear Programming Simplex Method
Introduction to Algorithms
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Solving POMDPs Using Quadratically Constrained Linear Programs Christopher Amato.
Linear Constraint Graph for Floorplan Optimization with Soft Blocks Jia Wang Electrical and Computer Engineering Illinois Institute of Technology Chicago,
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Label Placement and graph drawing Imo Lieberwerth.
by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright
Operation Research Chapter 3 Simplex Method.
Algorithms for the leather nesting problem: application to a real automotive industry instance Pedro Brás Supervision: Cláudio Alves and José Valério de.
Automated Layout and Phase Assignment for Dark Field PSM Andrew B. Kahng, Huijuan Wang, Alex Zelikovsky UCLA Computer Science Department
Computational Approaches to Space Layout Planning Presented By Hoda Homayouni Final project for ARCH 588.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Introduction to Integrated Design of Low-Energy Buildings Professor Svend Svendsen Department of Civil Engineering Technical University of Denmark
Network Flow Models Chapter 7.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
LP formulation of Economic Dispatch
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.
Prologa Jan Vanthienen, K.U.Leuven Modeling decision tables PrologaProloga.
Computer-Aided Design and Manufacturing Laboratory: Rotational Drainability Sara McMains UC Berkeley.
Linear Programming: Basic Concepts
Benjamin Welle Stanford University Grant Soremekun Phoenix Integration
New method to optimize Force-directed layouts of large graphs Meva DODO, Fenohery ANDRIAMANAMPISOA, Patrice TORGUET, Jean Pierre JESSEL IRIT University.
Some Key Facts About Optimal Solutions (Section 14.1) 14.2–14.16
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
Efficient Multi-Layer Obstacle- Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu,Meng-Xiang Li, Yao-Wen Chang.
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
DELMIA DPM Assembly This is the Master “Presentation title” page. Type the title of your presentation in the "Presentation title” field. Cette page est.
Pajek – Program for Large Network Analysis Vladimir Batagelj and Andrej Mrvar.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Object-Oriented Design Simple Program Design Third Edition A Step-by-Step Approach 11.
Heuristic Optimization Methods Greedy algorithms, Approximation algorithms, and GRASP.
Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:
A MAPLE-MATLAB INTERFACE A CASE FOR THE OPTIMIZATION TOOLBOX Enrique Díaz de León * - René V. Mayorga ** - Graciano Dieck*** * ITESM - Guadalajara Campus,
Mathematical Models & Optimization?
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Rubber Ball Project By: Kasey Gray. TEKS § Mathematics, Grade 6. (a) Introduction. (1) Within a well-balanced mathematics curriculum, the primary.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents CD Chapter 14 (Solution Concepts for Linear Programming) Some Key Facts.
ADOBE INDESIGN CS3 Chapter 7 CREATING GRAPHICS. Chapter 72 Introduction InDesign allows you to create graphics using tools in InDesign The Pen Tool can.
Outline Introduction Research Project Findings / Results
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
Instructional Design Document Simplex Method - Optimization STAM Interactive Solutions.
Honors Track: Competitive Programming & Problem Solving Seminar Topics Kevin Verbeek.
COMPREHENSIVE Windows Tutorial 6 Searching for Information and Collaborating with Others.
Integrating Algorithms and Coding into the Mathematics Classroom
Linear Programming for Solving the DSS Problems
School of Computer Science & Engineering
Decision Support Systems
An Introduction to Linear Programming Pertemuan 4
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
6.5 Stochastic Prog. and Benders’ decomposition
ME 521 Computer Aided Design 15-Optimization
Constrained Optimization
Linear Programming Problem
Efficiently Estimating Travel Time
Part 4 Nonlinear Programming
6.5 Stochastic Prog. and Benders’ decomposition
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
What are optimization methods?
Presentation transcript:

Interactive Layout Design Optimization Author: Jeremy J. Michalek Presented by: Hoda Homayouni

Introduction o An interactive design tool that supports the designer by computationally optimizing aspects that can be modeled mathematically, while giving the designer control to make decisions influenced by subjective human judgment and intuition.

Design Tools o Interactive Design Tool: an object oriented representation with an interface that allows the designer to interact with the building layout optimization problem. o Automated Design Tool: uses a decomposition strategy to separate topological decisions from purely geometric decisions.

Topology optimization Constraints: o Overlap o Connectivity o Path o Planarity o Envelope

Geometric Optimization Toolbox of Constraints: o Force Inside o Prohibit Intersection o Force Minimum Intersection o Force to Edge o Bound Size o Bound Ratio o Feasible Window o Bound Build Cost o Bound Lighting

Design Objectives Minimizing: o Heating cost o Cooling cost o Lighting cost o Wasted space o Accessway size o Hallway Size

Procedure 1.Define Rooms & Halls 2.Move Rooms into Rough Location 3.Define Connections 4.Choose an Objective 5.Add Additional Constraints

Procedure 6.Optimize o Topology Constraints: Using GA o Geometry Constraints: Using SA and SQP

Procedure 7.Examine Results Estimate of: o performance cost o build cost o lifetime cost o natural lighting level o the living space

Procedure 8.Iterate Manipulating the design by: o Changing the weights of each individual objective. o Adding, deleting and modifying objectives, constraints and Units. o Changing variable formulation

Procedure o A Hallway is reduced

Procedure o Third bedroom is added

Procedure o Visualizing Options:

Procedure o Visualizing Options

Discussion Collaboration between the designer and optimization algorithms: o Designer experience+ efficiency of gradient algorithms o Avoiding computational traps o Exploring solutions and trade offs o Filling the gap in computer design support