A Practical Investment Optimization Tool by Means of Certainty-Uncertainty Searches A Presentation for the Transportation Data Palooza: A Showcase of Innovative.

Slides:



Advertisements
Similar presentations
Dynamic Programming Rahul Mohare Faculty Datta Meghe Institute of Management Studies.
Advertisements

Linear Programming.
Experimental Design, Response Surface Analysis, and Optimization
Chapter 1 Introduction to Modeling DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall Publishers and Ardith E. Baker.
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Robust Multi-Kernel Classification of Uncertain and Imbalanced Data
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Computational Methods for Management and Economics Carla Gomes
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
Operations Research I Lecture 1-3 Chapter 1
Chapter 14 Risk and Uncertainty Managerial Economics: Economic Tools for Today’s Decision Makers, 4/e By Paul Keat and Philip Young.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Helsinki University of Technology Systems Analysis Laboratory 1 London Business School Management Science and Operations 1 London Business School Management.
LINEAR PROGRAMMING SIMPLEX METHOD.
Attention Deficit Hyperactivity Disorder (ADHD) Student Classification Using Genetic Algorithm and Artificial Neural Network S. Yenaeng 1, S. Saelee 2.
Operations Research Models
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Quality Function Deployment
Chapter 2 The process Process, Methods, and Tools
DSS Modeling Current trends – Multidimensional analysis (modeling) A modeling method that involves data analysis in several dimensions – Influence diagram.
Modeling.
Mathematics Numbers: Exponents Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund Department.
Systems Engineering for the Transportation Critical Infrastructure The Development of a Methodology and Mathematical Model for Assessing the Impacts of.
Some Key Facts About Optimal Solutions (Section 14.1) 14.2–14.16
ITGD4207 Operations Research
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Linear Programming An Example. Problem The dairy "Fior di Latte" produces two types of cheese: cheese A and B. The dairy company must decide how many.
Analysis of Algorithms
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Chapter 4 MODELING AND ANALYSIS. Model component Data component provides input data User interface displays solution It is the model component of a DSS.
Highway Risk Mitigation through Systems Engineering.
Simulation is the process of studying the behavior of a real system by using a model that replicates the behavior of the system under different scenarios.
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
Mysoltani.ir سایت فیلم روشهای مشارکتی Technology Foresight Foresight is about preparing for the future. It is about deploying resources in the best.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
GREG CAPPS [ ASUG INSTALLATION MEMBER MEMBER SINCE:1998 ISRAEL OLIVKOVICH [ SAP EMPLOYEE MEMBER SINCE: 2004 GRETCHEN LINDQUIST [ ASUG INSTALLATION MEMBER.
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
Information System Project Management Lecture three Chapter one
15.053Tuesday, April 9 Branch and Bound Handouts: Lecture Notes.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents CD Chapter 14 (Solution Concepts for Linear Programming) Some Key Facts.
MODELING AND ANALYSIS Pertemuan-4
A local search algorithm with repair procedure for the Roadef 2010 challenge Lauri Ahlroth, André Schumacher, Henri Tokola
1 BA 555 Practical Business Analysis Linear Programming (LP) Sensitivity Analysis Simulation Agenda.
Monte-Carlo based Expertise A powerful Tool for System Evaluation & Optimization  Introduction  Features  System Performance.
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Operations Research Models and Methods Advanced Operations Research Reference: Operations Research Models and Methods, Operations Research Models and Methods,
Highway Risk Mitigation through Systems Engineering.
‘Real Options’ Framework to Assess Public Research Investments Nicholas S. Vonortas Center for International Science and Technology Policy & Department.
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
Introduction It had its early roots in World War II and is flourishing in business and industry with the aid of computer.
Henry M. Sondheimer, MD Association of American Medical Colleges 7 August 2013 A Common Taxonomy of Competency Domains for the Health Professions and Competencies.
Approaches to quantifying uncertainty-related risk There are three approaches to dealing with financial and economic risk in benefit-cost analysis: = expected.
Part I Project Initiation.
Computer Simulation Henry C. Co Technology and Operations Management,
Quality Function Deployment
Water Resources Development and Management Optimization (Integer and Mixed Integer Programming) CVEN 5393 Mar 28, 2011.
OPERATING SYSTEMS CS 3502 Fall 2017
ENGM 742: Engineering Management and Labor Relations
Table 1. Advantages and Disadvantages of Traditional DM/ML Methods
Linear programming Simplex method.
CPU Scheduling G.Anuradha
Microsoft Project Past, Present and Future
Linear programming Simplex method.
Optimization and Some Traditional Methods
Goldratt Research Labs
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

A Practical Investment Optimization Tool by Means of Certainty-Uncertainty Searches A Presentation for the Transportation Data Palooza: A Showcase of Innovative Technology Solutions at the United States Department of Transportation Headquarters, Washington DC Brian G Chow May 9, 2013

Chow -May 2013 #2 DOT Has Long Used Benefit-Cost Methodology for its Investment Analysis and Optimization For project selection and optimization, DOT performs standardized investment/performance analysis, e.g. −Highway Economic Requirement System (HERS) −National Bridge Investment Analysis System (NBIAS) −Transit Economics Requirements Model (TERM) The foundation of these analytical tools is a benefit-cost methodology

Chow -May 2013 #3 Benefit-Cost Methodology Can be Enhanced by Casting in a Portfolio Framework Methods currently used by DOT can be improved by adding features to better deal with the post-9/11 environment and a stressful budget −Need to express results in confidence level in order to address uncertainties in input data, future outcomes, and risk Current DOT methods based on expected values and supplemented by sensitivity analysis can be inadequate −Need to allow the selected projects to meet multiple requirements individually Current DOT methods tend to score and sum a potential project’s contributions to various requirements in “oranges,” “applies,” etc., risking that selected projects are all great in providing “oranges” but together still providing too few “apples”

Chow -May 2013 #4 The Essential Difficulty of Portfolio Optimization Under Uncertainty Difficult to find the optimal portfolio among so many possible portfolios −Number of possible portfolios grows exponentially as the number of projects grows merely linearly −Computers in the foreseeable future cannot search for the optimal portfolio by brute force Number of Projects (binary choices) Number of Possible Portfolios Search Time (10,000 runs for 0.1 sec/run) hours 101.0x days 338.6x x10 5 years x x10 18 years x x10 55 years

Chow -May 2013 #5 Approximations Used in Traditional Methods Are Problematic for Real-World Investment Optimization While traditional methods work well in a certainty world, they are ill-equipped to perform investment selection and optimization in a real-world, which is rife with uncertainties −A popular traditional method: Expected Value with Sensitivity Analysis Pre-select about 10 possible portfolios; go through uncertain scenarios to find the most robust portfolio; and finally check it with sensitivity analysis and what- if analysis Since there are typically billions or trillions of possible portfolios, the chance that the optimal portfolio is among the chosen ten is practically nil −Other traditional methods place unrealistic limitation on the numbers of decision variables, uncertain parameters and uncertain scenarios

Chow -May 2013 #6 RAND’s PortMan Has a New Approach to Perform Investment Optimization under Uncertainties 1. Simulate 10,000 future states of the world (FSW) by making random combination of the uncertain parameters a.Each generated FSW is a certainty state 2. Use a mixed-integer linear programming model to automatically identify the local optimal solution or portfolio among trillions of possible solution for a given certainty state 3. Use multiple straightforward search rules, one at a time, to iteratively going through Steps 1 and 2 to arrive at the global optimal portfolio

Chow -May 2013 #7 One of the Search Rules Used 1. Select the project that is most frequently chosen among the 10,000 local optimal solutions as the first project (P1) in the global optimal solution a.This is like forming a team for a job that is full of uncertainties as to what actual tasks will have to be performed b.The idea behind forming an optimal team is to start by picking the most valuable player first 2. Generate another 10,000 FSWs but insisting that P1 is in the global optimal solution and select the most frequently chosen project among these 10,000 FSWs (each with P1) as the second project (P2) for the global optimal solution a.The idea is to select the second team member to best complement the first team member 3. Repeating Step 2 for additional projects until the budget for developing and/or implementing selected projects is fully committed

Chow -May 2013 #8 Total remaining lifecycle budget ($35B) is the sum of the total remaining S&T budget ($2B) and the total implementation budget ($33B) If a given portfolio meets all requirements and constraints within budgets in 9100 out of 10,000 FSWs, the feasible percentage is 91% Note: RLCC is the remaining lifecycle cost; S&T is science and technology; Feasible percentage is a proxy for confidence level Source: Chow et al., Toward Affordable Systems II, MG- 979-A, 2011 Optimal Investment Portfolio with PortMan Running in Uncertainty Mode (based on 10,000 future-state-of-the-world runs for each data point)

Chow -May 2013 #9 Comparison of PortMan with Two Traditional Methods-I Benefit/Cost Ratio −For each project, divide the total contributions to all requirements by the remaining S&T budget −Optimal portfolio is composed of projects with the highest ratios until the total remaining S&T budget is fully committed −This optimal portfolio is run to determine its feasible percentage under uncertainty (i.e. among 10,000 FSWs)

Chow -May 2013 #10 Comparison of PortMan with Two Traditional Methods-II Certainty Model −A mixed-integer programming model is used with expected parameters as inputs, subject to a given total remaining R&D budget and a total remaining lifecycle budget (R&D plus implementation) −The optimal portfolio for this certainty case is obtained with an objective function for maximizing the total project values (i.e. contributions) −This optimal portfolio is run to determine its feasible percentage under uncertainty (i.e. among 10,000 future-state-of-the-world runs)

Chow -May 2013 #11 Note: ATO=Army Technology Objective, Army’s highest priority S&T projects The selection cannot be derived from an analysis of benefit- cost ratios—a PortMan-type model is essential The Best ATOs to Select Are Not Necessarily the Ones with High Benefit-Cost Ratios

Chow -May 2013 #12 At Equal Cost, PortMan Does No Worse and Often Does Better Than Traditional Methods under Uncertainty At equal confidence level, PortMan does not cost more and often costs less than traditional methods to meet all requirements under uncertainty

Chow -May 2013 #13 Advantages of This New Approach 1. This new approach allows DOT to incorporate real-world situations (uncertainties) into its investment analysis, selection and optimization a.It tells under what situations, i. current benefit-cost based methods can continue to be used as good approximations ii. current methods needed to be revised and how 2. Relative to highly mathematical search algorithms, the straightforward search rules used in this approach a.Are much easier to implement b.Are much easier to understand why such a rule can find the (global) optimal portfolio c.Are much easier to see the flaw of a rule so as enabling the design of complementary rule(s) to mitigate the flaw PortMan has been used on past RAND projects and currently is being used for three ongoing projects sponsored by the Army, the National Institute of Justice, and the Centers for Disease Control and Prevention. Perhaps, it would be of interest to DOT as well

Chow -May 2013 #14 Free Reports: Downloaded at Links below or Requested from Chow, Brian, Portfolio Optimization by Means of Multiple Tandem Certainty- Uncertainty Searches: A Technical Description, RR270-A/OSD, 2013 ( Chow, Brian, Richard Silberglitt, Caroline Reilly, Scott Hiromoto, and Christina Panis, Choosing Defense Project Portfolios: A New Tool for Making Optimal Choices in a World of Constraint and Uncertainty, RB-9678-A, 2012 ( Chow, Brian G., Richard Silberglitt, Caroline Reilly, Scott Hiromoto, and Christina Panis, Toward Affordable Systems III: Portfolio Management for Army Engineering and Manufacturing Development Programs, MG-1187-A, 2012 ( Chow, Brian, Richard Silberglitt, Scott Hiromoto, Caroline Reilly, and Christina Panis, Toward Affordable Systems II: Portfolio Management for Army Science and Technology Programs Under Uncertainties, MG-979-A, 2011 ( Chow, Brian, Richard Silberglitt, and Scott Hiromoto, Toward Affordable Systems: Portfolio Analysis and Management for Army Science and Technology Programs, MG-761-A, 2009 (