©GoldSim Technology Group LLC., 2012 Optimization in GoldSim Jason Lillywhite and Ryan Roper June 2012 Webinar.

Slides:



Advertisements
Similar presentations
Denise Sakai Troxell (2000) Handling Some of the Problems Encountered When Using Excel Solver for Microsoft Excel 2000.
Advertisements

CSCI 347 / CS 4206: Data Mining Module 07: Implementations Topic 03: Linear Models.
Experimental Design, Response Surface Analysis, and Optimization
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”
Engineering Economic Analysis Canadian Edition
GoldSim 2006 User Conference Slide 1 Vancouver, B.C. The Submodel Element.
©GoldSim Technology Group LLC., 2004 Probabilistic Simulation “Uncertainty is a sign of humility, and humility is just the ability or the willingness to.
19 Linear Programming CHAPTER
GoldSim Technology Group LLC, 2007 Slide 1 GoldSim User Conference San Francisco, CA October 25-26, 2007 GoldSim Tutorial and Discussion: Techniques for.
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
Infinite Horizon Problems
1 Simulation Modeling and Analysis Session 13 Simulation Optimization.
1 SIMULATION – PART I Introduction to Simulation and Its Application to Yield Management For this portion of the session, the learning objectives are:
Lecture 5: Learning models using EM
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 1 Ryan Kinworthy CSCE Advanced Constraint Processing.
Reduced Support Vector Machine
CS 104 Introduction to Computer Science and Graphics Problems
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
6s-1Linear Programming CHAPTER 6s Linear Programming.
Testing an individual module
Linear-Programming Applications
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Introduction to Quantitative Techniques
©GoldSim Technology Group LLC., 2012 Making Better Decisions in an Uncertain World Pump Station Simulation.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Collaborative Filtering Matrix Factorization Approach
Fundamentals of Python: From First Programs Through Data Structures
LINEAR PROGRAMMING SIMPLEX METHOD.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Model Based DSS Creating Information Under Conditions of Uncertainty and Complexity Interface MODEL BASE DATA BASE MBMSDBMS DATA WAREHOUSING ON LINE ANALYTICAL.
Approximation Algorithms Pages ADVANCED TOPICS IN COMPLEXITY THEORY.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
GoldSim 2006 User Conference Slide 1 Vancouver, B.C. Event-Driven Models.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Chapter 6 Supplement Linear Programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
ENM 503 Lesson 1 – Methods and Models The why’s, how’s, and what’s of mathematical modeling A model is a representation in mathematical terms of some real.
MBA7025_01.ppt/Jan 13, 2015/Page 1 Georgia State University - Confidential MBA 7025 Statistical Business Analysis Introduction - Why Business Analysis.
MBA7020_01.ppt/June 13, 2005/Page 1 Georgia State University - Confidential MBA 7020 Business Analysis Foundations Introduction - Why Business Analysis.
Heuristic Optimization Methods Greedy algorithms, Approximation algorithms, and GRASP.
1 Prune-and-Search Method 2012/10/30. A simple example: Binary search sorted sequence : (search 9) step 1  step 2  step 3  Binary search.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
Monte Carlo Process Risk Analysis for Water Resources Planning and Management Institute for Water Resources 2008.
GoldSim Technology Group LLC, 2006 Slide 1 Sensitivity and Uncertainty Analysis and Optimization in GoldSim.
GoldSim Technology Group LLC, 2006 Slide 1 Introduction to the New Features in the Upcoming Glacier Release Glacier Peak, Washington 3,213 Meters (10,541.
ETM 607 – Output Analysis: Estimation of Relative Performance Output comparison between two or more alternative systems Common Random Numbers (CRN) Comparison.
1 Sensitivity Analysis (II). 2 Sensitivity Report.
MANAGEMENT SCIENCE The Art of Modeling with Spreadsheets STEPHEN G. POWELL KENNETH R. BAKER Compatible with Analytic Solver Platform FOURTH EDITION OPTIMIZATION.
DAY 9: MICROSOFT EXCEL – CHAPTER 6 Sravanthi Lakkimsetty Sept 16, 2015.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
1 Implicant Expansion Methods Used in The BOOM Minimizer Petr Fišer, Jan Hlavička Czech Technical University, Karlovo nám. 13, Prague 2
Different Local Search Algorithms in STAGE for Solving Bin Packing Problem Gholamreza Haffari Sharif University of Technology
Introduction to Computer Programming - Project 2 Intro to Digital Technology.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 13, 2013.
Chapter 14 EXPLORATORY FACTOR ANALYSIS. Exploratory Factor Analysis  Statistical technique for dealing with multiple variables  Many variables are reduced.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
GoldSim Monthly Webinar Series. Goals  Learn the basics of simple scripts  Learn the basics of the GoldSim Script Element  Not a lesson on numerical.
Optimization via Search
Boosting and Additive Trees (2)
Effective Test Design Using Covering Arrays
Chapter 17: Optimization In Simulation
Microsoft Office Illustrated
Collaborative Filtering Matrix Factorization Approach
More on Search: A* and Optimization
Design Of Experiment Eng. Ibrahim Kuhail.
Discrete Mathematics CS 2610
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

©GoldSim Technology Group LLC., 2012 Optimization in GoldSim Jason Lillywhite and Ryan Roper June 2012 Webinar

©GoldSim Technology Group LLC., 2012 Agenda Intro – Jason - 15 minutes Simple examples – Ryan – 30 minutes Submodel examples – Jason – 10 minutes Questions – 5 minutes

©GoldSim Technology Group LLC., 2012 Why Optimization? Finding best input values for a model Selecting best option among alternatives –Safest, cheapest, most reliable, etc Optimizing the timing of actions

©GoldSim Technology Group LLC., 2012 GoldSim’s Optimization Feature Box’s complex method –Box, M. J. (1965) “A new method of constrained optimization and comparison with other methods” Start with initial “complex” (valid solutions) Search the solution space iteratively Replace least optimal solutions with more optimal ones Iterate until convergence

©GoldSim Technology Group LLC., 2012 Setting up an Optimization Minimize/Maximize Precision Randomize optimization sequence? Define your objective function Required condition Optimization variables

©GoldSim Technology Group LLC., 2012 Precision Low: 2N; F < 0.01 Ri or 100 solutions Medium: 4N; F < Ri or 1000 solutions High: 10N; F < Ri or 1E4 solutions Maximum: 10N; no longer improve result or 1E6 solutions N = number of optimization variables to generate the initial complex F = objective function Ri = initial range

©GoldSim Technology Group LLC., 2012 Objective Function Define your objective function –Minimize or maximize? –Model output –Final values only! Examples: –Cumulative cost –Total number of events –Peak value during simulation

©GoldSim Technology Group LLC., 2012 Objective Function

©GoldSim Technology Group LLC., 2012 Required Condition Add another boundary to the optimization search space Examples: –Regulatory limit –Financial budget –Restrict unacceptable combination of variables

©GoldSim Technology Group LLC., 2012 Optimization Variables Data or Stochastic elements Represent decision variables –Have direct control Examples: –Pipe size –How much to spend? –When something occurs Objective function dependent on ALL optimization variables!

©GoldSim Technology Group LLC., 2012 Optimization Variables

©GoldSim Technology Group LLC., 2012 Running an Optimization Best Function Value vs. Iterations –Plot the optimal value per iteration Top results –Table showing objective function and variables from the 10 most optimal iterations Interrupts are ignored during optimization runs if continue or skip options are selected

©GoldSim Technology Group LLC., 2012 Running the Optimization

©GoldSim Technology Group LLC., 2012 Optimization of Complex Models Multiple optima Choice of bounds may be important Convergence may not be possible May converge on a local optimum Randomize optimization helps search through multiple optimal outcomes

©GoldSim Technology Group LLC., 2012 Potential Warnings Unable to create a valid complex –Cannot find 2N valid solutions (N=opt. vars.) Cannot improve the solution –Found a number of valid solutions but can’t find any better ones (stuck) –Convergence might be too strict –Examine the top results Failure to converge –No convergence after many iterations –100 for low, 1000 for medium, 10,000 for high precision

©GoldSim Technology Group LLC., 2012 Optimization of a Probabilistic Model Objective function must be a statistic –i.e. Minimize the mean or value at 95% Must use a submodel

©GoldSim Technology Group LLC., 2012 Applications…