Control Structure Selection for a Methanol Plant using Hysys/Unisim

Slides:

Advertisements

Similar presentations

Zhen Lu CPACT University of Newcastle MDC Technology Reduced Hessian Sequential Quadratic Programming(SQP)

Advertisements

Engineering Optimization

P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.

P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2014 – 35148: Continuous Solution for Boundary Value Problems.

Optimization of thermal processes

Optimization Introduction & 1-D Unconstrained Optimization

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.

PROCESS INTEGRATED DESIGN WITHIN A MODEL PREDICTIVE CONTROL FRAMEWORK Mario Francisco, Pastora Vega, Omar Pérez University of Salamanca – Spain University.

Numerical Optimization

Function Optimization Newton’s Method. Conjugate Gradients

INTEGRATED DESIGN OF WASTEWATER TREATMENT PROCESSES USING MODEL PREDICTIVE CONTROL Mario Francisco, Pastora Vega University of Salamanca – Spain European.

Tutorial 12 Unconstrained optimization Conjugate gradients.

1 Chapter 8: Linearization Methods for Constrained Problems Book Review Presented by Kartik Pandit July 23, 2010 ENGINEERING OPTIMIZATION Methods and Applications.

NORM BASED APPROACHES FOR AUTOMATIC TUNING OF MODEL BASED PREDICTIVE CONTROL Pastora Vega, Mario Francisco, Eladio Sanz University of Salamanca – Spain.

MAE 552 – Heuristic Optimization Lecture 3 January 28, 2002.

Chapter 10: Iterative Improvement

Optimization Mechanics of the Simplex Method

Efficient Methodologies for Reliability Based Design Optimization

Unconstrained Optimization Problem

Design of Curves and Surfaces by Multi Objective Optimization Rony Goldenthal Michel Bercovier School of Computer Science and Engineering The Hebrew University.

Advanced Topics in Optimization

Nonlinear Algebraic Systems 1.Iterative solution methods 2.Fixed-point iteration 3.Newton-Raphson method 4.Secant method 5.Matlab tutorial 6.Matlab exercise.

Why Function Optimization ?

Ch. 9: Direction Generation Method Based on Linearization Generalized Reduced Gradient Method Mohammad Farhan Habib NetLab, CS, UC Davis July 30, 2010.

Tier I: Mathematical Methods of Optimization

ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.

UNCONSTRAINED MULTIVARIABLE

Operations Research Models

Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.

1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.

Optimization for Operation of Power Systems with Performance Guarantee

Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal February 12, 2007 Inexact Methods for PDE-Constrained Optimization.

ENCI 303 Lecture PS-19 Optimization 2

Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,

Optimization of Process Flowsheets S,S&L Chapter 24 T&S Chapter 12 Terry A. Ring CHEN 5253.

1 Department of Chemical Engineering Faculty of Engineering, Chulalongkorn University Bangkok 10330, Thailand Plantwide control structure design for an.

Chapter 7 Handling Constraints

Practical Dynamic Programming in Ljungqvist – Sargent (2004) Presented by Edson Silveira Sobrinho for Dynamic Macro class University of Houston Economics.

Frank Edward Curtis Northwestern University Joint work with Richard Byrd and Jorge Nocedal January 31, 2007 Inexact Methods for PDE-Constrained Optimization.

Mathematical Models & Optimization?

THE LAPLACE TRANSFORM LEARNING GOALS Definition

A comparison between PROC NLP and PROC OPTMODEL Optimization Algorithm Chin Hwa Tan December 3, 2008.

Quasi-Newton Methods of Optimization Lecture 2. General Algorithm n A Baseline Scenario Algorithm U (Model algorithm for n- dimensional unconstrained.

1 Optimization of LNG plants: Challenges and strategies Magnus G. Jacobsen Sigurd Skogestad ESCAPE-21, May 31, 2011 Porto Carras, Chalkidiki, Greece.

Inexact SQP methods for equality constrained optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.

Gradient Methods In Optimization

Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.

Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.

Nonlinear Programming In this handout Gradient Search for Multivariable Unconstrained Optimization KKT Conditions for Optimality of Constrained Optimization.

Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.

INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.

Support Vector Machines Reading: Ben-Hur and Weston, “A User’s Guide to Support Vector Machines” (linked from class web page)

Linear Programming Chapter 9. Interior Point Methods  Three major variants  Affine scaling algorithm - easy concept, good performance  Potential.

Economic Plantwide Control using

Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.

An Introduction to Computational Fluids Dynamics Prapared by: Chudasama Gulambhai H ( ) Azhar Damani ( ) Dave Aman ( )

1 Chapter 6 Reformulation-Linearization Technique and Applications.

1 Chapter 5 Branch-and-bound Framework and Its Applications.

Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.

ECONOMIC PLANTWIDE CONTROL USING COMMERCIAL PROCESS SIMULATION SOFTWARE PROJECT STATUS ADRIANA REYES LÚA SUPERVISOR: SIGURD SKOGESTAD CO-SUPERVISOR: VLADIMIROS.

Bounded Nonlinear Optimization to Fit a Model of Acoustic Foams

Economic Plantwide Control:

Signal processing and Networking for Big Data Applications: Lecture 9 Mix Integer Programming: Benders decomposition And Branch & Bound NOTE: To change.

Computational Optimization

CS5321 Numerical Optimization

Chapter 10. Numerical Solutions of Nonlinear Systems of Equations

Operation and Control of Divided Wall (Petlyuk) Column

Presentation transcript:

Control Structure Selection for a Methanol Plant using Hysys/Unisim Supervisor: Sigurd Skogestad Co-supervisor: Vladimiros Minasidis Adriana Reyes Lúa Master Project Mid-Term Presentation Spring 2014 Mid-term Presentation

Outline Introduction Previous work Work in progress Future work Specialization Project Work in progress Future work

Plantwide Control “Control structure design for complete chemical plants” Systematic procedure for the design of an control structure, based on steady state plant economics. Top down Bottom up

Plantwide Control 1. Top-down Step 1: Define operational objectives (economics) and constraints. Step 2: Identify steady state degrees of freedom and determine steady state operation conditions. Step 3: Identify candidate measurements y and select CV1 =Hy Step 4: Select the location of the throughput manipulator.

Plantwide Control: The Challenge To be accepted and used in industry, the procedure: must result in processes with near optimal operation. should not employ complex control technology. simple to apply. Proposed solution: self-optimizing control. automate procedure and hide complexities. Can this be done using process simulators? Intuitive. Widely used. Pre-loaded information. Design mode vs. operation mode. Poor numerical properties. Not standardized.

Objective To investigate if commercial process simulators could be effectively used for the automation of the plantwide control procedure.

Case Study: Methanol Plant First of all, you need a model! Reactor, a separator, and a recycle stream with purge. Scheme of a methanol plant (Løvik,2001)

The Model The “operation mode” process simulation is the model. When using this type of model: The interactions among the variables are not explicit. We do not have equations to describe our model.

Plantwide Procedure: Step 1 Define: Operational objectives (economics) and constraints. Objective function for specialization project: Reviewed objective function: The purge is now treated as a product. The costs of the purge and electricity were also reviewed.

Plantwide Procedure: Step 1

Plantwide Procedure: Step 2 Identify steady state degrees of freedom.

Plantwide Procedure: Step 2 Identify steady state degrees of freedom. 4 steady state degrees of freedom. Identify important disturbances. Determine steady state operation conditions.  You need to optimize!

Optimizing the Simulation As done for the Specialization Project COM Matlab UniSim NLP Solver fmincon Interior point (satisfies bounds) NLP Model NLP model independent of NLP solver.

Plantwide Procedure: Step 2 Purge treated as waste (you pay for purging). Purge treated as product. Pressure (l), temperature (h), flow to compressor (l) Pressure (l), temperature (h), flow to compressor (l), UA slack (h)

Plantwide Procedure: Step 2 Pressure (l), temperature (h), flow to compressor (l) Pressure (l), temperature (h), flow to compressor (l), UA slack (h) Noisy model Crude area approximation Control structure for a single point.  step size issues.  finer grid.  single region-wide control structure.

Gradient-based approach to solve the problem: For each iteration step it does 2*n+1 function evaluations. Each iteration is expensive. Dependant on step size. Each function evaluation means running the simulation. For the case study (6 variables), at least abt. 300 function evaluations are required.  You want to reduce the number of function evaluations!

Derivative-free optimization Objective function values available. F is a “black box” that returns the value F(x) for any feasible x. Derivative information: unavailable, unreliable, unpractical. The function is expensive to evaluate or noisy. Some algorithms can handle bounds a ≤ x ≤ b  Same characteristics as our model.

Derivative-free optimization Classification of algorithms: Direct: search direction defined by computing values of the function directly. Model based: construct a surrogate model of the function to guide the search process. Local/Global: search domain definition. Stochastic/Deterministic: random search steps or not.

Derivative-free trust- region methods Surrogate and easy to evaluate model. Obtained by interpolation. Basic idea: Define a region in which the model is an adequate representation of the objective function. Choose the step (direction and length) to be the approximate minimizer of the model in this region.

Trust- region methods Contours of a nonlinear function in a trust region. linear model quadratic model Conn, Andrew R., Scheinberg, Katya, Vicente, Luis N. Introduction to Derivative-Free Optimization, 2009

Trust- region algorithm 0. Initialize Solve trust region problem: calculate step Acceptance of step. Update model. Update trust region. Stopping criterion Quadratic model Real function Taylor approximation

Derivative-free trust- region algorithm The objective function is approximated by quadratic models obtained by a 2nd order Taylor approximation. Solves bound constrained optimization problems. Considers bounds when calculating the trust region step. Obtains an approximate solution for the approximation mk (xk + s) The solution is in the intersection of the trust-region with the bound constraints.

Derivative-free trust- region algorithm The objective function is approximated by quadratic models obtained by a 2nd order Taylor approximation. Solves bound constrained optimization problems. The number of interpolation points can vary. In each iteration, only one interpolation point is replaced The objective function is evaluated once per iteration.

Derivative-free trust- region algorithm Initialize: generate interpolation points and model. Solve quadratic trust-region problem. Acceptance test for the step. Update trust-region radius Alternative iteration Re-calculate s in order to improve the geometry of the interpolation set. Update interpolation set and quadratic model. Stopping criterion.

Work to do Finish programming the DFO algorithm. Obtain more detailed active constraint regions. Find control structures for the identified regions. Investigate the posibility of finding a region-wide control structure.

Thank you for your attention!

Quadratic approximation At each iteration: Trust region: Interpolation points:

Derivative-free trust- region algorithm Uses quadratic model. Independent coefficients: The number of interpolation conditions can vary. Remaining degrees of freedom are calculated minimizing the Frobenius norm of the difference of two consecutive Hessian models. The Frobenius norm is strictly convex.

Derivative-free trust- region algorithm Linear independence on the interpolation condition is maintained. The trust-region quadratic minimization subproblem is solved using a truncated conjugate gradient method. Updates: If the trust-region minimization produces an acceptable step the function f is evaluated at xk + s and this new point becomes the next iterate, xk+1, If the step is not accepted, use “alternative iteration”. The model can also be updated.

Derivative-free trust- region algorithm Initialize: generate interpolation points and model. Solve quadratic trust-region problem. Acceptance test for the step. Update trust-region radius Alternative iteration Re-calculate s in order to improve the geometry of the interpolation set. Update interpolation set and quadratic model. Stopping criterion.