THE BATTLE OF THE WATER NETWORKS (BWN-II): PADDS BASED SOLUTION APPROACH Bryan A. Tolson, Ayman Khedr, Masoud Asadzadeh.

Slides:



Advertisements
Similar presentations
Lazy Paired Hyper-Parameter Tuning
Advertisements

Integer Linear Programming
Optimizing Expression Selection for Lookup Table Program Transformation Chris Wilcox, Michelle Mills Strout, James M. Bieman Computer Science Department.
Chapter 3 Workforce scheduling.
1 Chapter 11 Here we see cases where the basic LP model can not be used.
SkewReduce YongChul Kwon Magdalena Balazinska, Bill Howe, Jerome Rolia* University of Washington, *HP Labs Skew-Resistant Parallel Processing of Feature-Extracting.
Pure, Mixed-Integer, Zero-One Models
Linear Programming Problem
Electrical and Computer Engineering Mississippi State University
Modern pipe network models
Algorithms + L. Grewe.
Progress in Linear Programming Based Branch-and-Bound Algorithms
Multi-scale Planning and Scheduling Under Uncertain and Varying Demand Conditions in the Pharmaceutical Industry Hierarchically Structured Integrated Multi-scale.
Applications of Stochastic Programming in the Energy Industry Chonawee Supatgiat Research Group Enron Corp. INFORMS Houston Chapter Meeting August 2, 2001.
Efficient Autoscaling in the Cloud using Predictive Models for Workload Forecasting Roy, N., A. Dubey, and A. Gokhale 4th IEEE International Conference.
1 Statistical Tests of Returns to Scale Using DEA Rajiv D. Banker Hsihui Chang Shih-Chi Chang.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Requirements - Why What and How? Sriram Mohan. Outline Why ? What ? How ?
NORM BASED APPROACHES FOR AUTOMATIC TUNING OF MODEL BASED PREDICTIVE CONTROL Pastora Vega, Mario Francisco, Eladio Sanz University of Salamanca – Spain.
Lecture 19: Optical flow CS6670: Computer Vision Noah Snavely
Branch and Bound Algorithm for Solving Integer Linear Programming
Linear Programming Example 2 Alternate Optimal Solutions.
On the convergence of SDDP and related algorithms Speaker: Ziming Guan Supervisor: A. B. Philpott Sponsor: Fonterra New Zealand.
New Mexico Computer Science For All More Looping in NetLogo Maureen Psaila-Dombrowski.
Linear Programming Models: Graphical and Computer Methods
RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Mixed-integer Programming Based Approaches for.
Introduction to Systems Analysis and Design Trisha Cummings.
A Multi-Start Approach for Optimizing Routing Networks with Vehicle Loading Constraints Angel Juan Oscar Domínguez Department.
Optimization for Operation of Power Systems with Performance Guarantee
Masoud Asadzadeh, Bryan A. Tolson, A. J. MacLean. Dept. of Civil & Environmental Engineering, University of Waterloo Hydrologic model calibration aims.
Comparison of Two ICT Solutions DESKTOP PC VERSUS THIN CLIENT COMPUTING 1.
Archer: A History-Driven Global Routing Algorithm Mustafa Ozdal Intel Corporation Martin D. F. Wong Univ. of Illinois at Urbana-Champaign Mustafa Ozdal.
Quasi-static Channel Assignment Algorithms for Wireless Communications Networks Frank Yeong-Sung Lin Department of Information Management National Taiwan.
Curriculum Optimization Project CURRICULUM REFORM MEETING California State University, Los Angeles Kevin Byrnes Dept. of Applied Math Johns Hopkins University.
1 Optimization Based Power Generation Scheduling Xiaohong Guan Tsinghua / Xian Jiaotong University.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
1 A New Algorithm for Water Distribution System Optimization: Discrete Dynamically Dimensioned Search (DDDS) EWRI 2008 May 12, 2008 Dr. Bryan Tolson 1.
Tao Lin Chris Chu TPL-Aware Displacement- driven Detailed Placement Refinement with Coloring Constraints ISPD ‘15.
Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
Design of a High-Throughput Low-Power IS95 Viterbi Decoder Xun Liu Marios C. Papaefthymiou Advanced Computer Architecture Laboratory Electrical Engineering.
CIT 470: Advanced Network and System AdministrationSlide #1 CIT 470: Advanced Network and System Administration Disaster Recovery.
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.
Active Sampling for Accelerated Learning of Performance Models Piyush Shivam, Shivnath Babu, Jeff Chase Duke University.
Assessing the Impact of Alternative Pipe Groupings on Multi-Objective Water Distribution Network Masoud Asadzadeh Bryan Tolson.
Lecture 1 – Operations Research
A local search algorithm with repair procedure for the Roadef 2010 challenge Lauri Ahlroth, André Schumacher, Henri Tokola
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
Target Releas e Component 1 Component 3 Baseline Flow Component 2 Design a regulation plan for Lake Superior that:  is easily interpretable (piecewise.
1 The Software Development Process ► Systems analysis ► Systems design ► Implementation ► Testing ► Documentation ► Evaluation ► Maintenance.
Canny Edge Detection Using an NVIDIA GPU and CUDA Alex Wade CAP6938 Final Project.
Chapter 6 Optimization Models with Integer Variables.
SQL Server Statistics DEMO SQL Server Statistics SREENI JULAKANTI,MCTS.MCITP,MCP. SQL SERVER Database Administration.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms Reference: Chapter.
) Recherche & Innovation Multi-Objectives, Multi-Period Optimization of district networks Using Evolutionary Algorithms and MILP: Daily thermal storage.
Introduction to genetic algorithm
6.5 Stochastic Prog. and Benders’ decomposition
Masoud Asadzadeh Bryan Tolson Robert McKillop
Masoud Asadzadeh Bryan A. Tolson University of Waterloo
Integer Linear Programming
Systems Development Life Cycle
A New multi-objective algorithm: Pareto archived dds
Department of Information Management National Taiwan University
Linear Programming.
Facilities Planning and Design Course code:
Integer Linear Programming
6.5 Stochastic Prog. and Benders’ decomposition
Intersection Cuts from Bilinear Disjunctions
Presentation transcript:

THE BATTLE OF THE WATER NETWORKS (BWN-II): PADDS BASED SOLUTION APPROACH Bryan A. Tolson, Ayman Khedr, Masoud Asadzadeh

Multi-Stage Solution Methodology Stage 1: trial and error analyst testing to identify a feasible solution to the problem under nominal conditions (no power failure) –Fix pump configuration, identify candidate decision variables (DVs), set bounds on DVs Stage 2: optimize with MO PADDS algorithm (Asadzadeh & Tolson, 2012) –23 DVs governing various tank and pipe sizes (discrete DVs) as well as pump control thresholds (continuous DVs) Stage 3: polish non-dominated solutions from Stage 2 with more PADDS optimization using 49 new DVs (discrete) to refine the pumping schedule –Turn off pumps if possible during periods when unit electricity cost is maximum –Turn on pumps if helpful during periods when unit electricity cost is maximum Stage 4: for each non-dominated solution from Stage 3, optimize diesel generator configuration required to maintain feasibility in a power outage: –Optimize by implicit enumeration, consider 8 possible generator configurations –Perform final non-dominated sort Stage 5: selecting one of the final non-dominated feasible solutions by minimizing the BWN-II evaluation metric given by contest organizers: 2

Results 3 Cost, $ GHG 10 6 kg CO 2 /yr WA - Stage 0: Estimate original network performance before expansion/demand increase (combined C-Town (2010 WDSA BWCN) and D-Town info. Time: not counted* Stage 1: analyst manual optimize, fix pump sizes –one initial solution, feasible (all pumps backed up) Time: hrs Stage 2: PADDS mixed integer optimization –1 trial of default algorithm configuration –10,000 solutions evaluated by 168-hr EPS in EPANET2 –Found 124 candidate ND solutions PC Time: 48 hrs Stage 3: PADDS to tune pumping schedule –1 trial of default algorithm configuration –10,000 solutions evaluated by 168-hr EPS in EPANET2 –Found 232 candidate ND solutions PC Time: 47 hrs Stage 4: Generator configuration for all ND sols –Evaluate up to hr power outages  up to 8 configs –Found 159 feasible candidate ND solutions PC Time: 10 hrs Stage 5: Select final solution Time: < 1 hr Pumping: 145,000 NA , ,638 (221,687) most improvements here Small cost improvements

Key Points 4 Multi-stage approach important: –easy way to combine analyst knowledge/intuition with opt. algorithm –Broke problem into solvable subproblems (not sizing pumps and tanks simultaneously) Final solution required: –4-5 weeks of analyst* time (coding for EPANET toolkit mainly) –Only 20,000 total solutions evaluated by PADDS MO algorithm –105 hours of serial computing time on an Intel® Core(TM) 2 Quad CPU 2.50GHz and 8 MB RAM desktop PC Results repeatable (re-solved after paper submitted): The 5-stage procedure can be iterated based on alternative initial designs proposed by analyst in Stage 1 Cost, $ GHG 10 6 kg CO 2 /yr WA - Submitted356, Re-solved358,