EUROPEAN SYMPOSIUM ON C O M P U T E R AIDED PROCESS ENGINEERING - 10
COMPUTER-AIDED CHEMICAL ENGINEERING Advisory Editor: L.M. Rose Volume Volume Volume Volume
1: 2: 3: 4:
Volume 5:
Volume 6: Volume 7: Volume 8:
Distillation Design in Practice (L.M. Rose) The Art of Chemical Process Design (G.L. Wells and L.M. Rose) Computer-Programming Examples for Chemical Engineers (G. Ross) Analysis and Synthesis of Chemical Process Systems (K. Hartmann and K. Kaplick) Studies in Computer-Aided Modelling, Design and Operation Part A: Unit Operations (1. Pallai and Z. Fony6, Editors) Part B: Systems (1. Pallai and G.E. Veress, Editors) Neural Networks for Chemical Engineers (A.B. Bulsari, Editor) Material and Energy Balancing in the Process Industries - From Microscopic Balances to Large Plants (V.V. Veverka and F. Madron) European Symposium on Computer Aided Process Engineering-10 (S. Pierucci, Editor)
COMPUTER-AIDED CHEMICAL ENGINEERING, 8
EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING- 10 33~aEuropean Symposium of the Working Party on Computer Aided Process Engineering 619 ~ Event of the European Federation of Chemical Engineering (EFCE) Organized by AIDIC, the Italian Association of Chemical Engineering ESCAPE-10, 7-10 May, 2000, Florence, Italy
Edited by
Sauro Pierucci CIIC, Politecnico di Milano, Piazza L. da Vinci, 32, 1-20133 Milan, Italy
2000 Elsevier Amsterdam
- Lausanne
- New York-
Oxford - Shannon
- Singapore-
Tokyo
E L S E V I E R S C I E N C E BN. S a r a B u r g e r h a r t s t r a a t 25 P.O. Box 211, 1000 A E A m s t e r d a m , T h e N e t h e r l a n d s
9 2000 Elsevier Science B.V. All rights reserved.
This work is protected under copyright by Elsevier Science, and the following terms and conditions apply to its use: Photocopying Single photocopies of single chapters may be made for personal use as allowed by national copyright laws. Permission of the Publisher and payment of a fee is required for all other photocopying, including multiple or systematic copying, copying for advertising or promotional purposes, resale, and all forms of document delivery. Special rates are available for educational institutions that wish to make photocopies for non-profit educational classroom use. Permissions may be sought directly from Elsevier Science Rights & Permissions Department, PO Box 800, Oxford OX5 1DX, UK; phone: (+44) 1865 843830, fax: (+44) 1865 853333, e-mail:
[email protected]. You may also contact Rights & Permissions directly through Elsevier's home page (http://www.elsevier.nl), selecting first 'Customer Support', then 'General Information', then 'Permissions Query Form'. In the USA, users may clear permissions and make payments through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA; phone: (978) 7508400, fax: (978) 7504744, and in the UK through the Copyright Licensing Agency Rapid Clearance Service (CLARCS), 90 Tottenham Court Road, London W1P 0LP, UK; phone: (+44) 171 631 5555; fax: (+44) 171 631 5500. Other countries may have a local reprographic rights agency for payments. Derivative Works Tables of contents may be reproduced for internal circulation, but permission of Elsevier Science is required for external resale or distribution of such material. Permission of the Publisher is required for all other derivative works, including compilations and translations. Electronic Storage or Usage Permission of the Publisher is required to store or use electronically any material contained in this work, including any chapter or part of a chapter. Except as outlined above, no part of this work may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without prior written permission of the Publisher. Address permissions requests to: Elsevier Science Rights & Permissions Department, at the mail, fax and e-mail addresses noted above. Notice No responsibility is assumed by the Publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. Because of rapid advances in the medical sciences, in particular, independent verification of diagnoses and drug dosages should be made.
First edition 2000 Library of Congress Cataloging in Publication Data A catalog record from the Library of Congress has been applied for.
ISBN: 0-444-50520-2
@ The paper used in this publication meets the requirements of ANSI/NISO Z39.48-1992 (Permanence of Paper). Printed in The Netherlands.
PREFACE This book includes papers presented at ESCAPE10, the 10th European Symposium on Computer Aided Process Engineering, held in Florence, Italy, from the 7th to the 10th May, 2000. ESCAPE 10 was the tenth event of a series, started in Elsinore Denmark in 1992, of annual Symposia promoted by the Working Party 'Computer Aided Process Engineering (CAPE)' established in 1966 by the 'European Federation of Chemical Engineering (EFCE)'. However, it must be acknowledged that the ESCAPE series emerged from a strong tradition of the Working Party dating back to 1968 when the first event on computer applications was organized in Tutzing, Germany. Twenty three such symposia were then organized in almost a dozen European countries before a new departure of the Working Party with the ESCAPE series. Therefore, ESCAPE-10 was the 33 rd event of the CAPE Working Party, and the 609 th event of the EFCE. The most recent symposia were organized in Hungary, Budapest 1999 (ESCAPE-9), Bruges, Belgium 1998 (ESCAPE-8), Trondheim, Norway 1997 (ESCAPE-7) and in Rhodes, Greece 1996 (ESCAPE-6). ESCAPE-10 was organized by AIDIC, the Italian Association of Chemical Engineering, a member society of the European Federation of Chemical Engineering. The ESCAPE-10 scientific program reflected two complementary strategic objectives of the CAPE Working Party: the former checked the status of historically consolidated topics by means of their industrial application and their emerging issues, while the latter was addressed to opening new windows to the CAPE audience by inviting adjacent Working Parties to co-operate in the creation of the technical program. The former CAPE strategic objective was covered by the topics:
Numerical Methods, Process Design and Synthesis, Dynamics & Control Process Modeling, Simulation and Optimization. The latter CAPE strategic objective derived from the EFCE promotion of scientific activities which autonomously and transversely work across the Working Parties terms of references. These activities should enhance the exchange of the know-how and knowledge acquired by different Working Parties in homologous fields. They also aim to discover complementary facets useful to the dissemination of WP's tools and of their novel procedures. As a consequence the WP's 'Environmental Protection', 'Loss Prevention and Safety Promotion' and 'Multiphase Fluid Flow' were invited to assist in the organization of sessions in the area of:
A Process Integrated approach for." Environmental Benefit, Loss Prevention and Safety, Computational Fluid Dynamics. A total of 473 abstracts from all over the World were evaluated by the International Scientific Committee. Out of them 197 have been finally selected for the presentation and reported into this book. Their Authors come from 30 different Countries. The Selection of the papers was carried out by 28 international reviewers. We hope that these proceedings will be a reference document to the scientific and industrial community and will contribute to the progress in Computer Aided Process Engineering. Sauro Pierucci Guido Buzzi Ferraris
vi
SCIENTIFIC COMMITTEE PIERUCCI Sauro BUZZI FERRARIS Guido AZZOPARDI Barry BISTOLFI Marco BOGLE David BRIDGES Steven DONAT1 Gianni ESPUNA Antonio FRAGA Eric GANI Rafiqul GLAVIC Peter GREGERSEN Lars HEYEN George JORGENSEN John B. JOULIA Xavier KRAVANJA Zdravko Le LANN Jan Marc MACCHIETTO Sandro MEYER Michel MEYER Xuan-Mi PASMAN Hans J. PASTORINO Renato PERRIS Tony PUIGJANER-CORBELLA Luis ROVAGLIO Maurizio VENSELAAR Jan ZANELLI Severino ZULLO Luca ORGANIZING COMMITTEE Del ROSSO Renato BALLO Giuliana
BENINCORI Carlo POLI Giulio WOLF MACIEL Maria Regina
(Italy) co-Chairman (Italy) co-Chairman (England) (Italy) (England) (Denmark) (Italy) (Spain) (England) (Denmark) (Slovenia) (Denmark) (Belgium) (Denmark) (France) (Slovenia) (France) (England) (France) (France) (The Netherlands) (Italy) (England) (Spain) (Italy) (The Netherlands) (Italy) (U.S.A.) (Italy) Chairman (Italy) Secretary (Italy) (Italy) (Brasil)
SYMPOSIUM SECRETARIAT ESCAPE 10 c/o AIDIC Piazzalr Morandi 2 1-20100 Milano (Italy) Tel. +39-02-76021175 Fax +39-02-799644 e-mail: escape
[email protected] web : http://www.aidic.it/escape- 10/escape 10.html VENUE
Palazzo Congressi, Florence, Italy May 7-10, 2000
vii CONTENTS
Mixed Integer Non-Linear Programming Using Cutting Plane Techniques R. PSrn and T. Westerlund A Novel Interactive MINLP Solver for CAPE Applications J.P. Henriksen, S.F. Stoy, B.M. Russel and R. Gani An MILP-Based Reordering Algorithm for Complex Industrial Scheduling and Rescheduling J. Rosl6f I. Harjunkoski, J. BjSrkqvist, S. Karlsson and T. Westerlund Non-Linear Partial Least Squares through Data Transformations B. Li, E.B. Martin and A.J. Morris Optimisation of an Industrial Cogeneration System by means of a MultiObjective Genetic Algorithm G.A. Efthimeros, D.I. Photeinos, I.G. Katsipou, Z.G. Diamantis and D. T. Tsahalis Grid refinement in multiscale dynamic optimization T. Binder, L. Blank, W. Dahmen and W. Marquardt Numerical Strategies for Optimal Experimental Design for Parameter Identification of Non-Linear Dynamic (Bio-)Chemical Processes J.R. Banga, K.J. Versyck and J.F. Van Impe Solution of population balance equations for prediction of particle size distribution in emulsion polymerization: comparison and evaluation of different numerical methods A.H. Alexopoulos and C. Kiparissides Solution of the hyperbolic model for heat and mass transfer in packed bed reactors A.A. Iordanidi, A.E. Kronberg, J.A.M. Kuipers and K.R. Westerterp Moving finite difference method for tracking a shock or steep moving front Y.1. Lim, S.H. Jeong, J.M. Le Lann and X. Joulia Neural Network in Physical Equilibria Prediction S. Ore~ki, J. Zupan and P. Glavi( Novel Methods for the Efficient Evaluation of Stored Mathematical Expressions on Vector Computers B.R. Keeping and C.C. Pantelides Global Optimization of Nonconvex Problems with Differential-Algebraic Constraints W.R. Esposito and C.A. Floudas Scheduling to Minimize Expected Completion Time in Flowshop Plants with Uncertain Processing Times J. Balasubramanian and I.E. Grossmann
13 19
25 31
37
43
49 55 61
67
73
79
viii
Automatic Re-Weighting of Maximum Likelihood Functions for Parameter Regression Y. Xin, V.R. Vasquez and W.B. Whiting Energy cost minimization in an energy intensive industrial plant: an MINLP approach J. Vin, M.G. Ierapetritou, P. Sweeney and M. Chigirinskiy Generic object-oriented modelling, simulation and optimization of dynamical systems T. Wack, G. Deerberg and S. Schlfiter Detecting outliers in multivariate process data by using convex hulls J.P. Barnard and C. Aldrich MINLP Optimization of Several Process Structures for the Separation of Azeotropic Ternary Mixtures D. Brusis, T. Frey, J. Stichlmair, L Wagner, R. Duessel and F.-F. Kuppinger MINLP Optimization of Reactive Distillation Columns T. Frey and J. Stichlmair Batch Distillation Optimization with a Multiple Time-Scale Sequential Approach for Strong Nonlinear Processes M. Wendt, P. Li and G. Wozny Non-Linear Constrained GRG Optimization under Parallel-Distributed Computing Environments G.E. Vazquez, R. Rainoldi and N.B. Brignole A Bi-Index Continuous Time MILP Model for Short-Term Scheduling of Single-Stage Multi-Product Batch Plants with Parallel Units C.- W. Hui and A. Gupta Importance of parameter selection in classification systems using neural networks J. Ordieres and F. Ortega A two dimensional conceptual model to support data integration in process plant operations A.D. Yang, H.-S. Li and M.-L. Lu Feedforward Control Based on Online Concentration Calculation of a Heatand Mass-Integrated Distillation System K. LSwe and G. Wozny Analysis of Input-Output Controllability in Reactive Distillation Using the Element model A.D. Estrada- Villagrana, L D.L. Bogle, E.S. Fraga and R. Gani Hybrid Simulation of Continuous Discrete Systems V. Bahl and A.A. Linninger Interaction between Design and Control of Heat-Integrated PFR C.S. Bildea, A.C. Dimian and P.D. Iedema
85
91
97 103
109 115
121
127
133
139
145
151
157 163
169
ix
Optimal control of batch reactors using Generic Model Control (GMC) and Neural Network N. Aziz, M.A. Hussain and I.M. Mujtaba Stability analysis of delayed chemical systems L. Pellegrini, M. Ratto and M. Schanz Nonlinear model based control of optimal temperature profiles in polystyrene polymerization reactor G. ~)zkan, S. Ozen, S. Erdogan, H. Hapoglu and M. Alpbaz Experimental Verification and Optimisation of a Detailed Dynamic High Performance Liquid Chromatographic Column Model H.K. Teoh, M. Turner, N. Titchener-Hooker and E. Sorensen Expert Control of DO in the Aerobic Reactor of an Activated Sludge Process M. Galluzzo, R. Ducato, V. Bartolozzi and A. Picciotto Dynamic Behavior of a Counter-Current Fixed-Bed Reactor with Sustained Oscillations M. Mangold, F. Klose and E.D. Gilles Use of Gap Metric for Model Selection in Multi-Model Based Control Design: An Experimental Case Study of pH Control O. Galdn, J. Romagnoli, Y. Arkun and A. Palazoglu Dynamic and Control of High Purity Heterogeneous Azeotropic Distillation Process C J. G. Vasconcelos and M. R. Wolf-Maciel Training a Recurrent Neural Network by the Extended Kalman Filter as an Identification Tool R. Scheffer and R. Maciel Filho An Algorithm for Efficient Specification Analysis in Large-Scale Dynamic Process Simulation J. R. Paloschi Adaptive Neural Network Model Based Nonlinear Predictive Control of a Fluid Catalytic Cracking Unit Z. Nagy, S. Agachi and L. Bodizs Computer Design of a System of Predictive Control for a Continuous Process Purification of Bioproducts A. Mattedi and R. Maciel Filho Knowledge Based Modular Networks for Process Modelling and Control J. Peres, R. Oliveira and S. Feyo De Azevedo Computer aided and control of a rotary kiln incinerator E.T.I. de Souza, R. Maciel Filho and E. Tomas The use of process dynamic simulation for learning to design digital controllers M.S. Basualdo, J. Salcedo B and D. Ruiz Model Based Control of Batch Chromatography G. Diinnebier and K.-U. Klatt
175 181
187
193 199
205
211
217
223
229
235
241 247 253 259 265
Model Predictive Control of an Industrial Dryer V.M. Cristea, M. Baldea and ~;.P. Agachi Approximate Dynamic Models Using Coarse Grid Parameter Relaxation V.J. Law Analysis of different control possibilities for the Divided Wall Column: feedback diagonal and Dynamic Matrix Control M. Serra, M. Perrier, A. Espuna and L. Puigjaner Control Strategies for Brine Electrolysis by Ion Exchange Membrane Cell Process S. P. A gachi and fl. Imre-Lucaci A new methodology for the active control of the heat transfer in Autoclave technology V. Antonucci, M. Giordano, S. Inserra and L. Nicolais Model Predictive Control: A Multi-Parametric Programming Approach A. Bemporad, N.A. Bozinis, V. Dua, M. Morari and E.N. Pistikopoulos Flowsheet Simulation for the Steel Industry- Using Experiences from Chemical Engineering and Modern Software Approaches H. Miiller, T. Peuker and G. Wozny Some aspects of rate-based modelling and simulation of three-phase distillation columns E. Eckert and T. VanOk Modeling and Simulation Tools for Supercritical Fluid Processes S. Diaz, S. Espinosa and E.A. Brignole A computer aided tool for heavy oil thermal cracking process simulation R. Maciel Filho and M.F. Sugaya Natural Gas Fired Power Plants with CO2-Capture- Process Integration for High Fuel-to-Electricity Conversion Efficiency H.M. Kvamsdal, T. Andersen and O. Bolland Simulation of convective drying of multicomponent moisture in a computer code MultidryPAK Z. Pakowski An Algorithm for Analysis of Eletrolytic Liquid-Liquid Extraction Process for Concentration of Organic Acids R.T.P. Pinto, L. Lintomen, A.J.A. Meirelles and M.R. Wolf-Maciel Estimation of the heat released by chemical reactions: Application to control of a simulated batch reactor F. Xaumier, M.-V. Le Lann, M. Cabassud and G. Casamatta Modelling and Simulation of Biotechnological Processes: BIOSIMA Package suitable for Integration in Process Engineering Tools U. Bergstedt, H.J. K6rner, S. Kabasci and G. Deerberg Simulation and Optimisation of Atmospheric and Vacuum Distillations of a Lube Plant F.G. Martins, M.A.N. Coelho, C.A.V. da Costa, M.A.S. Jer6nimo,
271 277
283
289
295 301
307
313 319 325
331
337
343
349
355
xi
C. Martins and A.S. Braga A coalescence and breakup module for implementation in CFD-codes L. Hagesaether, H.A. Jakobsen, K. Hjarbo and H.F. Svendsen Fluid Dynamics and Thermochemical Simulation of a Smelting Cyclone M. Modigell and M. Weng Computational Fluid Dynamics Modelling of Multiphase Reactors M. Bistolfi, N. Mancini and F. Podenzani Simulation of silica deposition in an Atmospheric Pressure Chemical Vapour Deposition reactor, using a modified CFD software J.P. Nieto, B. Caussat, J.P. Couderc, C. Artufel, S. Coletti, L. Jeannerot and O. Simonin Validation of a CFD model of a novel recycle axial flow cyclone for droplets removal from gas streams D. Stanbridge, R. Swanborn, C.P. Heijckers and Z. Olujic Simulating Flow and Heat Transfer in Tubes Using a Fast CFD Formulation E. R. L. Mercado, V. C. Souza, R. Guirardello and J. R. Nunhez Improving the Flow of Stirred Vessels with Anchor Type Impellers S. M. C. P. Pedrosa, C. G: Duarte and J.R. Nunhez Influence of turbulence modelling and grid discretization on the simulation of flow-forces on tubes in cross-flow K. SchrSder and H. Gelbe A CFD - Finite Volume Method to Generate Deterministic Model: Application to Stirred Tank Reactors R. Maciel Filho and V.M.F. Bezerra Simulation of Nox formation of glass melting furnaces by an integrated computational approach: CFD+Reactor Network Analysis D. Benedetto, M. Falcitelli, S. Pasini and L. Tognotti CFD-Analysis of Heat Transfer and Initiator Mixing Performance in LDPE High Pressure Tubular Reactors F.O. Miihling, A. Daifi, N. Kolhapure and R.O. Fox Dynamic Simulation of Complex Reaction Schemes and Biochemical Applications in Stirred Tank Reactors with Respect to Imperfect Mixing U. Boltersdorf G. Deerberg and S. Schliiter The steady state analysis of the twin helix heat exchanger E.D. Lavric and V. Lavric Simulation of the bubble formation dynamics in rheologically complex fluids H.Z. Li and Y. Mouline Coarse-grained formulation for the time evolution of intermaterial contact area density in mixing systems A. Adrover, M. Fidaleo and M. Giona Dynamic Optimization of Semicontinuous Emulsion Copolymerization Reactions: Composition and Molecular Weight Distribution C. Sayer, G. Arzamendi, J.M. Asua, E.L. Lima and J.C. Pinto
361 367 373 379
385
391 397 403
409
415
421
427
433 439 445
451
457
xii
Optimizing the Operation of a Sequential-Simulated Moving-Bed Separation Process Using MINLP S. Karlsson, F. Pettersson, H. Skrifvars and T. Westerlund Multiperiod Planning for a Utility System Considering Emergency Situation by New Approach J.H. Kim, S. Ju, C. Han and S.H. You Minimization of Natural Gas and Water Consumption in the Operation of Utility Plants S. M. Corvaldn and A. M. Eliceche Dynamic optimization of chemical and biochemical processes using restricted second order information E. Balsa-Canto, J.R. Banga, A.A. Alonso and V.S. Vassiliadis Interaction Between Process Plant Operation and Cracking Furnaces Maintenance Policy in an Ethylene Plant E. Schulz, S. Diaz and A. Bandoni Convergence Refinement of Stochastic Optimization by Coupling a Genetic Algorithm and a Simulated Annealing Procedure A. Davin, C. Azzaro-Pantel, P. Floquet, L. Pibouleau and S. Domenech Fuzzy Modeling of Catalytic Multi-phase Reactor B.B. Freitas Jr. and R. Maciel Filho Strategy and Mathematical Development for Scale-Up of Molecular Distillators for Recovering Carotenoids from Palm Oil C.B. Batistella, E.B. Moraes, M.R.W. Maciel and R. Maciel Filho Characterization and quantification of liquid distribution in a packed column on a pilot scale M.S. Kobayasi, M.R. Wolf-Maciel, F.A.N. Fernandes, D. Moraes Jr. and S. M. Pizzo Sensitivity in Optimization of a Reactor System with Deactivating Catalyst I. Lovik, M. Hillestad and T. Hertzberg Detailed Mathematical Modelling of Membrane Modules J.I. Marriott, E. Sorensen and I.D.L. Bogle A novel approach to the analysis of distillation columns for multicomponent mixtures A.R. Giona, M. Giona and L. L.M. Lombardi ROME: A Repository to Support the Integration of Models over the Lifecycle of Model-based Engineering Processes L. Von Wedel and W. Marquardt Increase business benefits by using on-line models. D. Dempf and T. List Symbolic Discretization of Population Models for Process Simulation M. Brahmadatta, R. KShler, A. Mitrovid, E.D. Gilles and M. Zeitz
463
469
475
481
487
493 499
505
511 517 523
529
535 541 547
xiii
Heat Integration in Process Design and Retrofit- Software Tools and Data Interchange E. Aust, S. Scholl and C. Ubler
553
Modelling and optimisation of polymerisation reactors in gPROMS M. Asteasuain, S.M. Tonelli, A. Brandolin and J.A. Bandoni
559
Modeling Particle Size Distribution (PSD) in Emulsion Copolymerization Reactions in a Continuous Loop Reactor P.H.H. Arat~jo, J.C. de la Cal, J.M. Asua and J.C. Pinto
565
Process modelling of metallurgical processes- software tool and modelling concept M. Modigell, A. Traebert, P. Monheim, S. Petersen and U. Pickartz
571
Modelling High Pressure Extraction Processes M. Skerget and Z. Knez
577
Waterless wool cleaning process with supercritical carbon dioxide: extractor modeling and optimisation F. Trabelsi, J-C. Luc, J. Miquel, M-A. Larrayoz, M. Capilla and F. Recasens
583
Equation Based SPYRO | Model and Solver for the Simulation of the Steam Cracking Process M.W.M. van Goethem, F.I. Kleinendorst, C. van Leeuwen and N. van Velzen
589
A Shortcut Method for Design and Synthesis of Multicomponent Thermally Coupled Distillation Flowsheets B.G. Rong, A. Kraslawski and L. Nystrdm
595
A heating-cooling management to improve controllability of batch reactor equipped with a mono-fluid heating-cooling system H. Bouhenchir, M. Cabassud, M.V. Le Lann and G. Casamatta
601
Evaluation of time varying parameters in polymerization reactors by means of Temperature Oscillation Calorimetry P. Guerrini De Luca, C. Scali and G. Maschio
607
Integer-Programming Based Algorithms and Computational Performance for Terminal-Drop Zone Assignment Problems M- T. Kong and N. Shah
613
Automatic Generation of Switching Start-Up Schemes for Chemical Processes E. Klein, A. Itigin, J. Raisch and A. Kienle
619
Creative Design of Distillation Flowsheets Based on Theory of Solving Inventive Problems B.G. Rong, A. Kraslawski and L. Nystrdm
625
Technological change by system design- the industrial production of aromatics G.P.J. Dijkema and J. Grievink
631
Symmetric multiprocessing algorithm for conceptual process design E.S. Fraga
637
xiv
Optimisation of distillation and pervaporation system for ethanol dehydration Z. Szitkai, Z. Lelkes, E. Rev and Z. Fonyo Shape and Terminal Velocity of Single Bubble Motion: a Novel Approach G. Bozzano and M. Dente The Myth of Decomposition P. Kesavan and P.I. Barton Parameter Analysis and Optimization of Ideal Heat Integrated Distillation Columns (HIDiC) M. Nakaiwa, K. Huang, K. Naito, A. Endo, M. Owa, T. Akiya, T. Nakane and T. Takamatsu Computer-aided screening of adsorbents and porous catalyst carriers F. St@dnek, M. Marek, M. Kubi~ek and P.M. Adler A Hierarchical Framework for Modelling Biopharmaceutical Manufacture to Address Process and Business Needs S. Farid, J. Washbrook, J. Birch and N. Titchener-Hooker Study of the insertion of partial oxidation gas turbine to satisfy high temperature requirements of industrial processes using energy integration techniques F. Marechal and B. Kalitventzeff Abstract design in the development of pharmaceutical processes M. Sharif N.J. Samsatli and N. Shah Batch Distillation of Azeotropic Mixtures in a Column with a Middle Vessel M. Warter and J. Stichlmair Development and design of a forced unsteady-state reactor through numerical simulation M. Cittadini, M. Vanni, A.A. Barresi and G. Baldi Intent and Rationale in the Design of Chemical Processes: A Case Study A. Guzmdn-Reyna and R. Bafiares-Alcdntara Energy Efficient Distillation by Optimal Distribution of Heating and Cooling Requirements T.R. Andersen, G. Siragusa, B. Andresen, P. Salamon and S.B. Jorgensen Optimal Design of Heat-Integrated Multipurpose Batch Facilities A.P.F.D. Barbosa-P6voa, T. Pinto and A.Q. Novais Plant-independent Process Representation K. Wall, P.N. Sharratt, N. Sadr-Kazemi and J.N. Borland The design and management of material cycles towards a functional specification for an awareness-tool E. V. Verhoef G.P.J. Dijkema and M.A. Reuter A Strategy for the Generation of Robust Accident Scenarios in Quantitative Risk Assessment Using Multi-Component Analysis K.H. Kim, J.H. Song, D. Shin and E.S. Yoon
643 649 655
661 667
673
679 685 691
697 703
709 715 721
727
733
XV
Simulation of Blowout Events: Integration of Different Modelling Approaches Within Industrial Risk Assessment and Management Tools N. Mancini, F. Podenzani, M. Bonuccelli, P. Andreussi, P. Blotto and R. Galinetto
739
Fault diagnosis system support for reactive scheduling in multipurpose batch chemical plants D. Ruiz, J. Cant6n, J.M. Nougu~s, A. Espu~a and L. Puigjaner
745
Improving on chemical process safety through distributed computer assisted knowledge analysis of preliminary design B.A. Schupp, S.M. Lemkowitz, L. Goossens, H.J. Pasman and A.R. Hale
751
Plant Monitoring and Fault Detection:Synergy between Data Reconciliation and Principal Component Analysis T. Amand, G. Heyen and B. Kalitventzeff
757
Note on vapour disengagement dynamics modelling A. Sogaro, M.L. Caldi, D. Franchi and G. Biardi
763
Computer aided transportation risk assessment R. Bubbico , S. Di Cave and B. Mazzarotta
769
Using PHA Results for Real Time Operator Support during ASM S. Dash and V. Venkatasubramanian
775
Leak Detection and Localisation in Pipes and Pipelines G. Geiger, W. Gregoritza and D. Matko
781
Industrial Applications of Intelligent Systems for Operating Procedure Synthesis and Hazards Analysis for Batch Process Plants J. Zhao, S. Viswanathan and V. Venkatasubramanian
787
Model-based safety verification under uncertainty H. Huang, C.S. A djiman and N. Shah
793
Computerized Screening of Chemicals for Energy Release Hazards B. K. Harrison
799
A Hybrid Modular Hierarchical Approach for Fault Diagnosis in Complex Transient Processes N. Scenna, B. Drozdowicz, S.J. Benz and E.J. Lamas
805
Dynamic Simulation of the Behaviour of Pressure Relief Systems J-P. Pokki, J. Aittamaa and M. Hurme
811
From Environmental Care to Sustainability: the role of CAPE tools and methods J. Venselaar
817
Accounting for sustainability requirements in process design M. P. C. Weijnen, P.M. Herder and H.D. Goel
823
An Intelligent System for Identifying Waste Minimization Opportunities in Chemical Processes I. Halim and R. Srinivasan
829
xvi
A CAPE tool for evaluation of adsorber-reactor systems for treatment of exhausts from mobile sources J. Jirdt, M. Kubigek and M. Marek Quick identification of the wastewater biological treatment process by using shortcut techniques and previous plant operation data G. Maria, C. Constantinescu and P. Ozil Implementation of Flue Gas Cleaning Systems into an Object-Oriented Process Simulator for Practical Use G. Schuster, K. Weigl and A. Friedl Dynamic optimisation of small size wastewater treatment plants including nitrification and denitrification processes B. Chachuat, N. Roche and M.A. Latifi A New Procedure for Predicting NOx Emissions from Furnaces T. Faravelli, L. Bua, A. Frassoldati, A. Antifora, L. Tognotti and E. Ranzi Liquid Effluent Properties Prediction from an Industrial Wastewater Treatment Plant Using Artificial Neural Networks C.A. Gontarski, P.R. Rodrigues, M. Mori and L.F. Prenem Incorporating Production Scheduling in the Optimal Operation of Wastewater Treatment Plants R. Gouveia and J. M. Pinto Analysis of the Operation of a NSDX Pilot Plant for Cr(VI) Recovery A.M. Eliceche, S.M. CorvalCm, A.I. Alonso and I. Ortiz Optimum deNOx performance using inferential feedforward reductant flow control H.C. Kr~insen, J. C.M. van Leeuwen, R. Bakker, H.P.A. Calis and C. M. van den Bleek Software tool for waste treatment selection using economic and ecological assessments L. Cavin, O. Jankowitsch, U. Fischer and K. Hungerbiihler Distributed Information System For Environmentally Conscious Process Design Y. Fukushima and M. Hirao Decision Making for Batch Manufacturing Sites under Uncertainty A.A. Linninger and A. Chakraborty Minimization of Water Consumption and Wastewater Discharge in the Sugar Cane Industry R. Pastor, L. Abreu, A. Espu~a and L. Puigjaner Hydrodynamics and Chemical Model to Evaluate Environmental Risks in Proximity of River Mouth M. Di Natale, G. Merola and D. Musmarra Simulation and optimization of the reactive absorption of HF/HNO3 during pickling acid regeneration W. Wukovits, W. Karner, A. Lebl, M. Harasek and A. Friedl
835
841
847
853 859
865
871 877
883
889
895 901
907
913
919
xvii
Trend recognition of process data of a refinery using wavelets B. Bitzer and J. Richters Comparison of methods for assessing human health and the environmental impact in early phases of chemical process development G. Koller, U. Fischer and K. Hungerbiihler An integrated framework of process and environmental models, and EHS constraints for retrofit targeting F. Nourai, D. Rashtchian and J. Shayegan Soft sensor development and experimental application to wastewater treatment process D. Zyngier, O.Q.F. Arahjo and E.L. Lima Computer Aided Technique for Pollution Prevention and Treatment P. M. Harper and R. Gani Using driving force based separation efficiency curves within an integrated system for process synthesis/design E. Bek-Pedersen, M. Hostrup and R. Gani Pairing Criteria and Tuning Methods Towards Integration for Heat Exchanger Networks S. Chetty and T.K. Zhelev A Conceptual Programming Approach for the Design of Flexible HENs L. Tantimuratha, G. Asteris, D.K. Antonopoulos and A.C. Kokossis Mass Exchange Network Synthesis by Coupling a Genetic Algorithm and a SQP Procedure S. Shafiei, A. Davin, L. Pibouleau, S. Domenech and P. Floquet Synthesis of Reactor Networks in Overall Process Flowsheets within Multilevel MINLP Approach B. Pahor and Z. Kravanja Synthesis of reactive and extractive Distillation Units Using Distillation Line Diagrams L. Jimdnez, O.M. Wanhschafft and V. Julka Separation System Synthesis of Fractional Crystallisation Processes With Heat Integration L.A. Cisternas, C.P. Guerrero and R.E. Swaney Optimization of bleed streams in evaporation systems based on pinch analysis: new approach D.L. Westphalen and M.R. Wolf-Maciel Knowledge Based Models for the Analysis of Complex Separation Processes P.B. Shah and A.C. Kokossis Synthesis of Solvent Extraction Separation Schemes in Hydrometallurgy L.A. Cisternas and E.D. Gdlvez Synthesis of Separation Processes by Using Case-based Reasoning E. Pajula, T. Seuranen, T. Koiranen and M. Hurme
925
931
937
943 949
955
961 967
973
979
985
991
997 1003 1009 1015
xviii
An analytical process performance model for batch distillations S.D. Zamar, S. Xu and O.A. Iribarren Synthesis of Heat Exchanger Networks Considering Stream Splitting and the Rigorous Calculation of the Heat Transfer Coefficient According to the Bell Delaware Method M. C. Roque and L. M.F Lona Using Conceptual Models for the Synthesis and Design of Batch Distillations J. Espinosa, E. Salomone and S. Xu Mixed Integer Linear Programming and Constrained Based Search Approaches in a Multipurpose Batch Plant Short Term Scheduling Problem L. Gimeno, M. T.M. Rodrigues, L.C.A. Rodrigues and W. Alvarenga A Continuous-Time Approach to Short-Term Scheduling of ResourceConstrained Multistage Batch Facilities C.A. Mdndez, G.P. Henning and J. Cerdd A Comparative Study of Bi-linear and Tri-linear Approaches for the Monitoring of an Industrial Batch Process X. Meng, E.B. Martin and A.J. Morris Planning and Scheduling in a Pharmaceutical Research and Development L. Mockus, J. Vinson and R.B. Houston Mixed Integer programming techniques for the scheduling of fuel oil and asphalt production J. M. Pinto and M. Joly A Time-Windows Approach for Enhancing the Capabilities of Batch Scheduling Systems: An Application to Simulated Annealing Search L.C.A. Rodrigues, M. Graells, J. Canton, L. Gimeno, M.T.M. Rodrigues, A. EspuBa and L. Puigjaner A Hierarchical Approach for Real-Time Scheduling of a Multiproduct Batch Plant with Uncertainties G. Sand, S. Engell, C. Schulz, A. Markert and R. Schulz Closed-Loop Implementation of Optimal Operating Policies in Batch Distillation M. Barolo and P. Dal Cengio Development of an efficient system for scheduling large-scale industrial process and consumer goods factories with multipurpose and flexible storage C. Charalambous, T. Tahmassebi and K.S. Hindi Optimal Cyclic Operation of Biomass Production B.H.L. Betlem, P. Mulder and B. Roffel Short-term Scheduling and Recipe Optimization of Blending Processes K. Glismann and G. Gruhn Planning and Maintenance Optimization for Multipurpose Plants C.G. Vassiliadis, J. Arvela, E.N. Pistikopoulos and L.G. Papageorgiou
1021
1027 1033
1039
1045
1051 1057
1063
1069
1075
1081
1087 1093 1099 1105
xix
A Mathematical Programming Approach for the Optimal Scheduling of HeatIntegrated Multipurpose Plants under Fouling Conditions M. C. Georgiadis and L. G. Papageorgiou
1111
Development of Batch Process Operation Management Platform A. A oyama, I. Yamada, R. Batres and Y. Naka
1117
Synthesis, experiments and simulation of a heterogeneous batch distillation process I. Rodriguez-Donis, E. Pardillo-Fontdevila, V. Gerbaud and X. Joulia
1123
Robust Mixed Stochastic Enumerative Search Technique for Batch Sequencing Problems M. Graells, J. Cant6n and L. Puigjaner
1129
Systematic Assessments of Uncertain Demand Effects on Multiproduct Batch Process Design Using a Multi-Objective Optimization Technique H.I. Park, C. Azzaro-Pantel, P. Floquet and LB. Lee
1135
A Mixed Integer Model for LPG Scheduling J.M. Pinto and L.F.L. Moro
1141
Simulation-aided Implementation of Supervisory Control for Industrial Batch Reactors K. Preufi, M.V. Le Lann, M. Cabassud, G. Anne-Archard and G. Casamatta
1147
Dynamic modeling of batch distillation: comparison between commercial software L. Jimbnez, M.S. Basualdo, L. Toselli and M. Rosa
1153
Design, Synthesis and Scheduling of Multipurpose Batch Plants via an Effective Continuous-Time Formulation X. Lin and C.A. Floudas
1159
A Novel Superstructure and Optimisation Scheme for the Synthesis of Reaction-Separation Processes P. Linke, V. Mehta and A. C. Kokossis
1165
Short term Product distribution plan for multisite batch production, warehousing and distribution operations: solutions through Supply-Demand network and Resource-Task network optimisation approaches B.P. Das, N. Shah, A.D. Dimitriadis and B. Cao
1171
A New Generation in ERM Systems: The Tic Tac Toe Algorithm M. Badell and L. Puigjaner
1177
AUTHOR INDEX 1183
This Page Intentionally Left Blank
European Symposiumon Computer Aided Process Engineering- 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
MIXED INTEGER NON-LINEAR PROGRAMMING USING CUTTING PLANE TECHNIQUES Ray P 6 m a and Tapio Westerlund b
a Department of Mathematics, * b o Akademi University F~nriksgatan 3B FIN-20500 ,~bo, F I N L A N D (email"
[email protected]) b Process Design Laboratory, Abo Akademi University Biskopsgatan 8, FIN-20500 * b o , F I N L A N D (email" twesterl @abo.fi) In the present paper a modification of the extended cutting plane (ECP) method is described and illustrated. It is shown how it is possible to solve general MINLP (Mixed Integer Non-Linear Programming) problems with pseudo-convex objective as well as constraints to global optimality by a sophisticated cutting plane approach. The method relies on the ability to construct valid cutting planes for the entire feasible region of the problem. The method is illustrated on a simple test example and on some demanding practical scheduling problems. A comparison with a recently developped branch-and-bound approach is also given. 1. INTRODUCTION The extended cutting plane method (ECP) originally introduced in Westerlund and Pettersson (1995) is an extension to the mixed integer case of the classical cutting plane method for convex NLPs by Kelley. In Westerlund et al. (1998) the ECP method was extended to cover general MINLP problems with pseudoconvex inequality constraints. The convergence properties of this method is more rigorously analyzed in Still and Westerlund (2000). In the present paper the problem domain is even further enlarged to also include the case of a pseudo-convex objective function. It is shown how MINLP problems with pseudoconvex objective and inequality constraints can be solved to global optimality by a modification of the cutting plane approach used in the ctECP method. The method is illustrated through a simple example and four different instances of a cyclic scheduling problem. There exist only a few methods in the literature which are able to solve pseudo-convex MINLP problems to global optimality. To the authors knowledge, the only MINLP method previously published in the literature which directly addresses the problem of minimizing a pseudo-convex function (maximizing a pseudo-concave) is a branch-and-bound approach recently given in Jain and Grossmann (1998). Other common MINLP methods (e.g. Geoffrion (1972), Duran et al. (1986) and Fletcher et al. (1994)) have, in general, global convergence properties for convex problems only. In the area of deterministic global optimization there exist methods which are applicable to general non-convex MINLPs. This can be done by considering a binary variable in an explicit manner (e.g. Smith et al. (1999)) as a 0-1-variable or implicitly (e.g. Ryoo et al. (1995)) where a binary variable is considered continuous and modeled, for example, using concave equalities. Although, global optimization methods are applicable to general MINLPs the computational effort of these approaches increases rapidly with the number of variables (especially binary/integer) and constraints in the model. Therefore, these methods are only applicable to MINLP problems with moderate size.
b corresponding author
2. THE MINLP P R O B L E M
The MINLP problem considered in this paper can be formulated as follows
min
{ f (z) }
z~ N n L
N = {zl g(z) < 0}
L={zlAz
This variant is globally convergent if f ( z ) is a linear function, i.e. f ( z ) - c T z . The case with a convex objective is also included since after an introduction of a dummy variable /t the problem (P) is equivalent to minimizing /1 subject to the original constraints plus the convex constraint f ( z ) - l t
< O.
This rewriting procedure is, of course, also valid if f ( z ) is pseudo-convex but in this case the additional constraint will no longer, in general, be pseudo-convex and the global convergence properties of the method may be lost. The problem with a linear objective and pseudo-convex inequality constraints is solved by the 0tECP method by a sequence of MILP sub-problems of the form
min { crz } z~f~t
a k =La{zllj(z)
.... Jk}
k = 0,1,2 .... K The sub-problem solved in iteration k is called (Pk). The procedure is initialized with g~0 = L. The linear functions lt(z) added in iteration k are of the form lj(z)=fft +a tk .Vg~t r (z-zk), j~ {Jk-, +1 ..... J~} where each fit corresponds to the function value of a particular non-linear constraint g i(z), i = 1..... n, with positive value at zk. The vector V~t is the corresponding gradient of the non-linear constraint at zk. If only one cutting plane is added in each iteration then gt =rnax{gi(zk)} and Jk =Jk-I -I-1. Initially t
ark = 1 , but these values are sequentially increased in order to make all linearizations valid cutting planes at termination. For convex constraints
o~tk _ 1 is enough. In order to ensure global convergence three
essential steps are required: I.
If zk is infeasible in (P) then this point is excluded from all subsequent iterations by each of the constraints lj (z) < 0 added at the point zk (since lt(z ~) = ~t > 0 ).
II. Every lt(z) added to the sub-problems must, at termination, be a valid cutting plane (not cutting off parts of N n L). In order to ensure this an up-dating strategy for the o~k -parameters is required. The up-dating strategy is activated before termination and after detection of infeasible MILP sub-problems.
III.A solution z, to (pk) is optimal in (P) if z, ~ N n L and N n L c f ~ . That is z, is feasible in (P) and all linearizations lj(z) are valid cutting planes. In step II an up-dating procedure is mentioned. The up-dating is usually of the form tzj.,+1 = ft. o~k j where fl > 1. Both feasibility and under-estimation must be checked. feasibility: max{gi(z k )}< eg
under-estimation: o~jk _>--~-, j = l , 2 .... Jk
t
where h = ffj for a linearization that corresponds to a convex constraint and h = e h if it is obtained from a pseudo-convex. Both
F_.g and e h
are small positive tolerances, that depends on the problem. A detailed
description of the method is given in Still et al. (2000) and Westerlund et al. (1998). 4. I N C O R P O R A T I O N OF A P S E U D O - C O N V E X O B J E C T I V E F U N C T I O N
Now we consider problem (P) equipped with a pseudo-convex objective. As a first approach we will construct a procedure that computes a sequence of improving upper bounds on the objective. The limit point of this sequence can be proven to the optimum of (P). This procedure can be view as a sequence of MINLP sub-problems (Pr~ ) of the form: min z~ N, oL'~ ,/z<0
{.}
N r "- (z E N I f ( z ) <~ f ( z ~ )} 9 1-
The set
,2 . . . . .
N r contains all non-linear constraints from N plus an additional, so called, reduction
constraint f (z) < f(Zlr ). The linear set L~r contains all original linear constraints plus all linearizations of the objective at the active contour. Thus, the index r counts the number of different contours visited and l the number of solutions on each contour. The procedure is initialized with N o = N and L~ = L . The solution to this "feasibility" problem is a point zl1 e N n L and the first proper upper bound f(z~) is found. The pseudo-convex objective in (P) is then in the first real iteration replaced with a linearization and the pseudo-convex reduction constraint f ( z ) < f(z~ ) is included. If the reduction constraint is active at the next solution a new linearization is added to Lll and L2 will contain two linearizations. On the other hand, if the reduction constraint is redundant a strict improvement in f ( z )
is obtained and all
previous linearizations of f ( z ) will be replaced by a single linearization at the solution. Thus, L~ will contain one linearization and the reduction constraint is strengthened to f ( z ) < f(zl2). Note that problem (Pr") has a linear objective and pseudo-convex inequality constraints and can therefore be solved to global optimality by the o~ECP method. Since the procedure is iterative it can be view at an MILP-level instead of at the MINLP-level. Thus, the solution procedure can fully be integrated within the framework of the ~ECP approach. This means that we can also use previously generated cutting planes for the reduction constraint and the original constraints when solving subsequent sub-problems. Other computational improvements are discussed below. The proof of convergence of the method relies mainly on the definition of a pseudo-convex function. A function f ( z ) is pseudo-convex on a convex set S c R" if f (Zl) < f (z2) ::> V f (z2) r (zl - z2) < 0 for every z~, z2 ~ S. Theorem of optimality. If z* is a solution to sub-problem with/1 = 0 then z* is optimal also in (P).
1 < l.l must be active at Proof. Since we are minimizing /t at least one of the constraints V f ( z , I)T ( z - Zr)
'f(Zrl ) T (Z * -- Z ,)1 = / t = O. From the definition of pseudo-convexity it follows that if there exists a point, ~,e N r n L~, with f(~,) < f(Z~r ) r 1 T (z * - z r )1 = 0 it implies Vf(z~)r(~-z~)
V
conclude that there exists no point ~,~ N r t'~ Lnr with f(~') < f(z~ ) = f(z*). Thus z* is optimal n (P). [] A non-optimal point will, due to the pseudo-convexity, always correspond to a solution with strictly negative /1-value. Thus, the only additional termination criteria required, besides the feasibility and under-estimation criteria previously mentioned in the section of the aECP method, when incorporating a pseudo-convex objective function is the simple check /t = 0 or I/tl < el, in practice. A situation with /1 = 0 will always occur. This is due to fact that the method produces a sequence of sub-problems with feasible regions, N r ~ Znr, of decreasing size (due to the strengthening of the reduction constraint) and in the limit we will h a v e / t = O. 5. C O M P U T A T I O N A L I M P R O V E M E N T S The following improvements have been implemented to increase the computational efficiency and stability of the method. I. Line-search for the contour. Assume that we have obtained points on the same contour r, z~ ..... z n , and that the next MILP solution, ZMILp,does not satisfy the reduction constraint, i.e. f(ZMILp) > f(z~). It is now possible to compute a point on this contour without solving the entire MINLP problem (Pr~) to optimality or feasibility. First compute the "midpoint" ~mid = 1. ~'~=IZtr of the points on the contour. n
Since f('Zmid ) <- f ( z ~ ) (due to convexity of the level-sets off) and f(zM,,~p) > f(z~) (assumption) a point
segment
f ( z ) = f(z~) can be found using a linesearch strategy. The objective can now be linearized at the relaxed point ~r~+l=2*"Zmi d "~-(1--2*)ZMILP
on the line
[ZMILP,"Zmi d ] located exactly on the contour
where 2* is obtained with the line-search strategy. Due to the continuous nature of the line-search the integer restrictions may be violated at ~'r"+~ . Instead of "solving" ( p n ) a s a MINLP problem we have solved it as a single MILP combined with a simple line-search. II. Line-search for the minimum. Suppose that a MILP solution ZMlt.p that violates the reduction constraint has identical integer part to one of the points on the contour, say Zlr ( y~ = YM~LP)" Since the integer parts match we can in this case find the minimum
of
f(z)
on the line segment
"1
1
I instead of locating the contour. In this case the obtained point will be feasible,
i.e. it satisfies all integer restrictions, since the minimization was performed in the continuous space only. This might improve the convergence on the continuous variables. III. Normalization. To avoid non-optimal termination for extreme cases, for example objective functions with almost constant "plateaus" ( V f ( z ) = 0 ) , it is possible to normalize the linearizations in L~. That is, the linearizations are replaced by their normalized counterparts according to (the norm is the Euclidean)
L"r= Z~LIIVI
r
6. N U M E R I C A L E X A M P L E S In this section we apply our method on some examples. Consider the small MINLP problem .B
min,.y{1.1-((2x-1 O)2+(y-5)2) +sin(q.x-1 O)2+(y-5) 2) } 0.7x+y_<7, 2.5x+y<19, O<x,y
rel
6.
The objective is pseudo-convex by convex analysis. The feasible region is drawn with bold lines and the contours of the objective with thin lines. The iterates are marked with dots. The filled dots correspond to MILP solutions and the circles to relaxed points, which are solutions to line-searches. The method converged within 8 iterations, which included the solution of a total of 8 MILPs and 3 one-dimensional line-searches. Line-search strategy 1 was used.
4
2
0
I
. ~,
X
9 ,:~, . . i , , , ~,
F '7 -8
Figure 1: Solution sequence for the example. zm = (0.00,0), z2 = (7.60,0), z3 = (0.00,7),
Test problems. In this section we apply our method on z3r'' = (1.41,5.70),z4 = (4.50,3),z5 = (6.80,2), four different instances of a demanding cyclic scheduling problem recently published in the literature z~" = (5.04,2.77), z6 = (4.29,4), z7 = (7.60,0), (Jain and Grossmann (1998)). These problems are ZT"' = (4.89,3.27), z8 = (4.29,4) optimal MINLP models representing the problem of scheduling multiple feeds on parallel units (furnaces), where the performance of each unit decreases with time. The optimization trade-off is therefore between the performance of the units, the maintenance costs and the loss in production due to shutdowns for cleaning. The problem is linearly constrained with a fractional pseudo-convex objective (originally maximization of a pseudo-concave objective) of the form, (convex function)/(linear function), that includes both continuous and integer variables. The computational results and a comparison with Jain and Grossmanns branch-and- bound method is given in Table 1. The abbreviations bfs and dfs in the B&B (branch-andbound) rows stands for breadth first search and depth first search respectively. The instance-row gives the "dimension" of the problem as (number of feeds)x(number of furnaces). The total number of continuous and binary variables as well as constraints is also given. The abbreviation 1-s corresponds to the number of line-searches applied in the cutting plane approach. The two first instances are taken explicitly from the paper by Jain and Grossmann and we have generated the last two. In the paper by Jain and Grossmann it was also found that the OA method (dicopt++) converged to a non-optimal point in some of the problems.
Instance
3x1
7x4
5x2
cont/bin
11112 931140 37/50
52/60
9
-100
20
140
57
15/9 0.25
144/131 84.0
13/8 0.8
3 0.22
85 49.0
no result
-80
, Im:m.
'~ .,,,~.
Cutting plane
iter (MILPs/1-s) cpu-tirne (sec) B&B (dfs) iter (NLPs) cpu-time (sec) B&B (bfs) iter (NLPs) cpu-time (sec)
I"K]O~ 16013130.
# of constraints
linear
Solution results for inslance 7x4
4x3
# of variables '"
m
85168 6.9 ~" 11~110 no
result
-
1100130-
9
100000,
0
3 0.33
>2000
no result
no
,
,
~
40
,,
,
.
60
80
.
.
100
.
0
1~
140
itera~on mm'i3er
result
Table 1: Problem characteristics and solution results for the scheduling problems
Figure 2: Objective value and CPU-time versus
the iteration number.
p+
The lower bound on the objective (since the original problem is a maximization problem) and the cumulative CPU-time are plotted versus the iteration number in Figure 2 for the instance 7x4. Already after about 40 iterations (-15 CPU seconds) the lower bound is less than 0.2% from optimal. The proposed cutting plane method visited a total of 11 different contours, starting from a value of 105239 at the first. The cutting plane procedure is implemented within the ctECP program package (Westerlund and Lundqvist 2000). The program is written in FORTRAN-90 equipped with a Visual Basic interface. The CPLEX 6.0 package is used to solve the MILP sub-problems. The NLP-code used in branch-and-bound method was MINOS connected to GAMS. The computer used by Jain and Grossmann was a HP 9000/C 110 workstation and we used a 500 MHz Pentium III PC. The efficiency of the branch-and-bound method with dfs was according to the authors due to a very small integer gap. Branch-and-bound with bfs did not converge within 2000 NLPs for the instance 7x4. 7. CONCLUSIONS In this paper we have described an iterative MINLP method for minimizing a pseudo-convex function subject to pseudo-convex inequality constraints. The procedure was first view as a sequence of MINLP sub-problems with linear objective and pseudo-convex constraints. It was thereafter embedded within the framework of an existing cutting plane method, the ~ECP method. An additional termination criterium for the case with a pseudo-convex objective was also derived. The computational efficiency of the proposed method was then improved using two different simple line-search strategies. Finally, the method was used to efficiently solve four instances of a demanding scheduling problem recently published in the literature. ACKNOWLEDGEMENT Financial support from the Nordic Energy Research Programme (NEFP) and from the Academy of Finland is gratefully acknowledged. REFERENCES Duran M.A. and Grossmann I.E. (1986). An Outer-Approximation Algorithm for a Class of Mixed Integer Nonlinear Programs. Mathematical Programming, 36, 307-339. Fletcher R. and Leyffer S. (1994). Solving Mixed Integer Nonlinear Programs by Outer Approximation.
Mathematical Programming, 66, 327-349. Geoffrion A.M.(1972). Generalized Benders Decomposition. Journal of Optimization Theory and
Applications, 10, 237-260. Jain V. and Grossmann I. (1998). Cyclic Scheduling of Continuous Parallel-Process Units with Decaying Performance. AIChE Journal, 44, 1623-1636. Ryoo H.S. and Sahinidis N.V. (1995). Global Optimization of Non-Convex NLPs and MINLPs with Applications in Process Design. Comp. & Chem. Engng., 19, 551-566. Smith E.M.B. and Pantelides C.C. (1999). A Symbolic Reformulation/Spatial Branch-and-Bound Algorithm for Global Optimization of Non-convex MINLPs. Comp. & Chem. Engng., 23, 457-478. Still C. and Westerlund T. (2000). The Extended Cutting Plane Algorithm. Chapter in: Encyclopedia of Optimization, Ed: Floudas C.A. and Pardolos P.M., Kluwer Academic Publishers. Westerlund T. and Lundqvist K. (2000). Alpha-ECP Version 4.0. An Interactive MiNLP-solver Based on the Extended Cutting Plane Method. Report 0-170-A. Process Design Laboratory, ]kbo Akademi University. ISBN 952-12-0606-3. Westerlund T. and Pettersson F. (1995). An Extended Cutting Plane Method for Solving Convex MINLP Problems. Comp. & Chem. Engng., 19, S 131-S 136. Westerlund T. Skrifvars H., Harjunkoski I. and P6rn R. (1998). An Extended Cutting Plane Method for a Class of Non-Convex MINLP Problems. Comp. & Chem. Engng., 22, 357-365.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
A Novel Interactive M I N L P Solver for C A P E Applications Jens Peter Henriksen, Soren F. Stoy, Boris M. Russel & Rafiqul Gani CAPEC, Dept. of Chem. Eng., Technical University of Denmark, 2800 Lyngby, Denmark
1 Abstract This paper presents an interactive MINLP solver that is particularly suitable for solution of process synthesis, design and analysis problems. The interactive MINLP solver is based on the decomposition based MINLP algorithms, where a NLP sub-problem is solved in the innerloop and a MILP master problem is solved in the outer-loop. The interactive MINLP solver allows a purely equation system mode (where all equations are given explicitly) and a simulation mode (where the process model equations are included and solved by the simulation engine of a simulator). These solution modes give flexibility in problem formulation and inclusion of different solution approaches. Applications of the interactive MINLP solver to the solution of typical CAPE problems are illustrated through several test problems.
Keywords: Optimisation, MINLP, NLP, solver, synthesis, design, integrated systems 2 Introduction Current trend of integrated approaches in computer aided process engineering (CAPE) requires the use of mixed integer non-linear programming (MINLP) techniques. In integrated design and synthesis algorithms, it is necessary to determine the optimal flowsheet configuration simultaneously with the optimal process design conditions. This is formulated as optimisation problems involving both integer and real variables with equality/in-equality constraints that are linear as well as non-linear. Solution of MINLP problems requires robust and efficient numerical solvers. In addition, since the process flowsheet needs to be simulated during the solution of these MINLP problems, it is necessary to have available, the process model equations. Most currently available MINLP solvers require the process model equations to be given explicitly as equality constraints. While this approach has the advantage that the solution, if achievable, is obtained very efficiently, it also has some disadvantages. For example, the size of the optimisation problem may become too large to handle and it may not always be possible to supply all the process model equations. As a result, it may be difficult to formulate and solve realistic MINLP problems with such solvers. The objective of this paper is to present a novel new solver that is robust and efficient and at the same time, flexible, easy to use and does not need the process model equations to be explicitly supplied by the user. The new solver integrates a NLP solver, a MILP solver, a computer-aided tool for process model generation, a simulation engine and a user interface, which 'manages' the various tools during the solution of an optimisation problem. With this architecture, it is possible to solve optimisation problems where all equations are supplied
explicitly or solve problems where some equations are supplied explicitly and the rest supplied by the model library in the simulation engine or the modelling test-bed tool (MOT). The MINLP solution strategy is based on the Outer Approximation algorithm, where the problem is decomposed into an inner-loop NLP sub problem and an outer-loop MILP master problem. 3 Proposed Interactive MINLP Solver The outer approximation is described by Duran and Grossmann (1986) and Floudas (1995) for explicit MINLP problems. It is a decomposition technique where the problem is divided into an inner-loop NLP sub problem (giving and upper bound on the optimisation problem) and an outer-loop MILP master problem (giving a lower bound). The MILP master problem is generated by linearisation of the optimisation problem in the optimal point from the NLP sub problem. Convergence is reached, when the upper bound - lower bound _< e. The Outer Approximation is a rigorous method, which under assumptions of convexity guarantees an optimal solution. This paper will focus on how this algorithm can be integrated with a process simulator. The Outer Approximation integrated with the process simulator can be written as follows:
Problem:
NLP sub problem:
min f (d,x, y) d,y
v(y)
= inf f ( d , x , y
k)
MILP master problem: min ~lLiN d , y , [dUN
st.
st.
st.
P(d,x, y) = 0 h(d,x,y)=O g(d,x, y) < 0
P(d,x,
h ( d , x , y k) = 0 g(d,x,y k) <_ 0
d~DcR" xeXcR m
deDc xeXcR
y e Y = {0,1}q
y e Y = {0,1} q
y k) = 0
R" m
Pl~m >---f(dk,xk,Yk)+ Vd,yf(dk'xk,Y k)
yk
0 = h(dk,x k , yk ) + V d,yh(dk,x k , y k () d - d kyk 1 Y O>g(dk'xk'Yk)+Vd,yg(dk'xk'Yk)( d-dk)y yk
i~B k
i~NB k
9d e D c _ R " , x e X c R m , y e Y = { O , 1 } q Here f is the objective function, P constitutes the process models as formulated in the process simulator and which are thus implicit equality constraints in the optimisation problem, h and g are the equality and in-equality constraints given explicitly in the optimisation problem. The binary integer variables are represented by y, the process state variables are represented by x and the problem design variables are represented by d. The proposed integrated algorithm is then: 1. Chose a feasible combination of binary decision variables as starting point, yk=yl 2. Solve NLP sub problem for design variables in the process simulator with fixed yk. Optimal solution jf,.,h op, (d,x,y) and optimal d. 3. Upper Bound: UBD = fopf (d,x, y).
4. Linearise the optimisation problem by perturbing the design variables around the optimal solution from the NLP sub problem jf.,.,b op, (d,x, y) and do feasible step changes in the decision variables y. 5 9 Solve the MILP master problem. Gives fM opt (d,x,y) and optimal yg+l" 6. Lower Bound: LBD
=
fopM (d,x, y).
7. Is UBD-LBD < s a. Yes: Terminate algorithm. Optimal solution found. b. No: yk=yk+l. GO to step 2. The integer cut is introduced in the MILP master problem. This additional constraint can be used in an interactive manner either to filter out 'best solutions' or 'solutions' already tested 9 The linear process model is generated by makin~ perturbations in the design variables around the optimal point from the NLP sub problem d ' in the simulator and by 'measuring' the effect on the state variables x: k
E
x
(d',+,~)-a~'i=l,..,m,j=l,..,n
~Xj
X i -- X i
~~
~d,
Furthermore, the integer part of the MILP problem is modelled through feasible step changes in the y variables:
~'
= x,", Vy, ~ y" ,
Ayj
Ax," =x,-", vy, ~ y" Ay.j
Here 2~ is the numerical value of the state variable in a feasible step change of y . From the above we can now generate a linearised model using the following expressions for the state variables in the objective function and in the constraints:
x,:x:,
+
[~x~d
La
~';"
,
)+~:
y:) _
+...+
~;
y. _,
)1
The MILP master problem is solved with a standard branch-and-bound type MILP solver, for example, GAMS (Brooke et al. (1992)). The optimisation algorithm is integrated in ICAS in the way schematically shown in Figure 1. d, Fobj l g(d,x) ICAS SQP h(d,x) l User Interface Problem definition
[
~
d"ew d,x
I Evaluation uoc,ion
~ - Optimiser ~_Administrator] d, Fobj g(d,x) h(d,x)
T
I
ICASSIM ] Steady State ~ Simulator 1
[ MoT Modelling [Testbed_~
Figure 1" Integration of the optimisation algorithm in ICAS 4
Applications
A number of application examples have been developed using the optimiser in ICAS. As an example of NLP solution the Williams Otto Plant (Edgar & Himmelblau (1988), Biegler,
10 Grossmann & Westerberg (1997)) is tested. Production of cyclo-hexane is used as primary example of the MINLP algorithm. The superstructure proposed by Bek Pedersen et al. (1999) is solved using the interactive MINLP algorithm. Solutions of other examples (NLP and MINLP problems from the literature) can be obtained from the authors.
4.1 NLP example: Williams Otto Plant As an example of the implementation of the NLP solver we will present the traditional Williams-Otto plant (Edgar & Himmelblau (1988), Biegler, Grossmann & Westerberg (1997)). This example will illustrate how a problem, normally formulated as a system of equations, also can be solved in a sequential modular simulator. Flowsheet
Model and solution 100
min Z =
*
600 * 0.00002964 * F R * p 2 2 0 7 . 5 2 * Fp + 5 0 . 0 4 * F D - 1 6 8 "
F A - 252* F~
- 84 * F~ - 60 * 0 . 0 0 0 0 2 9 6 4 * F n * p
)
s.t. 0 = Fproa - 4 7 6 3
o = P(x)
Optimal: Z = 7197.71 Figure 2: Williams Otto Plant
Here A and B are reactants, P is the product, C and E can be sold as fuel, and G is a byproduct which has to be disposed of. The optimisation problem can be formulated in the way shown above, where P(x) denotes the process model, which comprise the mass balance equations. The results of the optimisation using both GAMS, ICAS in equation systems mode and ICAS in simulation mode are identical.
4.2 MINLP example: Cyclo-hexane Production As a primary example of the interactive M1NLP algorithm the determination of the optimal flowsheet for cyclo-hexane production is used. This rigorous process model employing rigorous property models, is highly non-linear. Bek-Pedersen et al. (1999) propose a superstructure containing the following variables: Configuration variables y 9 Reactors o 70% conversion o 80% conversion Separation systems o Distillation o Distillation + membrane o Extractive distillation
Optimisation variables x 9 Hydrogen feed 9 Purge fraction (inner loop) 9 Extractive distillation o Top product, dist. 1 o Boil-up ratio, dist. 1 o Reflux ratio, dist. 2 9 Distillation, Distillation + membrane o Reflux ratio; Reboiler temp.
11 The optimisation problem is formulated as a MINLP problem with the above integer variables and the following free continuous variables d: Note that the number of integer variables is reduced by removing some of the redundant separation systems (see Hostrup et al. 1999). The objective function is set up as: min Z = - Cl*Product-C2*ReactorHeatGeneration (Rx!, Rx2) + C3*FeedCost + C2*(Reboill + Reboil2 + Reboil3 + Reboil4)+ C4*(Condl + Cond2 + Cond3 + Cond4) + Yl*RxlCap + Y2*Rx2Cap + Y3*ExtrDistCap + Y4*DistCap + Y5*DistMemCap st. Reactor feed (Hydrogen/Benzene) e [9,14] ; Product purity > 0.99 YI+Y2=I; Y3+Y4+Y5=l The optimisation results using the interactive MINLP algorithm is shown in Table 1 for two different starting points. This illustrates how the optimal configuration is found, formulating and solving a MILP master problem. Iteration 1. Inner
Y2, Y5
1. Inner
Yl, Y3
1. Outer 2. Inner
Yl, Y4 Yl, Y4
2. Outer
Yl, Y4
Binary variables
NLP-solution Fm = 714.08 PFinnerloop= 0.05 (80% conv, extractive F H 2 - - 714.08 distillation) PFinnerloop-- 0.05 (80% conv, 1 dist column) MILP Evaluation (80% conv, 1 dist column) FH2 = 701.41 PFinner loop"- 0.05 MILP Evaluation (80% conv, 1 dist column) (70% conv, membrane)
FOBJ
380.20 $/hr 327.06 $/hr 741.74 $/hr 705.07 $/hr 732.68 $/hr
Table 1: Optimisation results of the interactive MINLP for the cyclo-hexane plant 4.3 Other Application Examples: MINLP optimisation of Acetone-Chloroform separation using extractive distillation (testing three different solvents (1-hexanal, Benzene, Methyl-n-pentyl ether) and pressure swing distillation has been performed (Hostrup et al. (1999)). The chosen optimisation variables were the reflux ratio in the two columns and the solvent flow rate. The optimal solution recommends the use of Methyl-N-pentyl ether. Another MINLP problem solved is the well known Duran & Grossmann (1986) example, which has been tested using the interactive MINLP employing the branch-and-bound algorithm, the outer approximation algorithm and a special "short-cut" feature. The optimisation problem can be formulated generally as: min Z =- Product + Feed + Compr. + Reactor (cap.) + Reactor (var) + HX, heat + HX, cool s.t. Prod = 3600 kmole/h ; YI+Y2=I ; Y3+Y4=l The optimal solution for two different starting points using the interactive MINLP is given in Table 2. Other starting points also gave the same optimal solution.
12
Iteration 1. Inner
Binary variables yl, Y3
(80% A, 10% conv.)
1. Inner
y2, y4
(80% A, 10% conv.)
1. Outer 2. Inner
yl, y4 yl, y4
(80% A, 20% conv.) (80% A, 20% conv.)
2. Outer
Yl, y4
(80% A, 20% conv.)
NLP-solution F = 10081.8 P=0.1499 F = 11118.8 P = 0.2966 MILP Evaluation F = 8345.9 P = 0.219 MILP Evaluation
FOBJ 1565.85 $/hr -1666.09 $/hr -4063.87 $/hr -2547.2 $/hr -2547.3 $/hr
Table 2" Results using the interactive MINLP for the Duran Grossmann example 5
Conclusions
A new interactive algorithm for solution of typical CAPE related MINLP problems has been developed and successfully tested with several non-trivial examples. The novel feature of the interactive MINLP algorithm is that it is able to accommodate the purely equation system mode of solution as well as the simulator mode of solution. For many CAPE applications, since the process model is not provided explicitly but included as library modules, simulator mode becomes particularly suitable. Also, the interactive MINLP approach is particularly suitable for decomposition based MINLP algorithms since it is able to integrate with any process simulator with a NLP solver. The application examples clearly illustrates that reliable optimal solutions can be obtained efficiently even when rigorous process models are employed. It should be noted that for the interactive MINLP algorithm, a special technique to generate the linear model and a modelling testbed were also developed. Finally, the interactive MINLP algorithm is being further extended in terms of CAPE application areas, size of problems, automatic generation of superstructures (for structural optimisation problems) and in computational aspects related to solution efficiency and robustness. 6
References
Gani, R, Hytoft, G., Jaksland, C., Jensen, A. K., 1997, An integrated computer aided system for integrated design of chemical processes, Computers & Chem Engng, 21, 1135-1146. Bossen, B.S., 1995, Simulation and Optimization of Ammonia Plants, PhD-thesis, DTU, Lyngby, Denmark. Bek_Pedersen, E., Hostrup, M., Gani, R., 1999, Using Driving Force Based Separation Efficiency Curves Within an Integrated System for Syntheis/design, Proceedings Escape-10 (submitted). Duran, M.A. & Grossmann, I.E., 1986, "An outer approximation algorithm for a class of mixed-integer nonlinear programs", Math. Progr., 36:307. Floudas, C.A., 1995, "Nonlinear and Mixed-Integer Optimization", Oxford University Press,
New York. ICAS User's Guide, 1999, CAPEC, DTU, Lyngby, Denmark. Edgar, T.F., Himmelblau, D.M., 1988, "Optimization of Chemical Processes", McGraw Hill, New York. Biegler, L.T., Grossmann, I.E., Westerberg, A.W., 1997, " Systematic Methods of Chemical Process Design", Prentice Hall, Upper Saddle River. Brooke, A., Kendrick, D., Meeraus, A., 1992, "GAMS" A User's Guide", San Francisco, CA, Scientific Press.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
An MILP-Based Scheduling
and
Reordering
Algorithm
13
for Complex
Industrial
Rescheduling
J. RoslSf, I. Harjunkoski, J. Bj5rkqvist, S. Karlsson and T. Westerlund Process Design Laboratory, Department of Chemical Engineering /~bo Akademi University, Biskopsgatan 8, FIN-20500/~bo//Turku, Finland Despite the significant progress made in the fields of operations research and process systems engineering (Puigjaner, 1999; Shah, 1998) the complexity of many industrialsize scheduling problems means that a global optimal solution cannot be reached within a reasonable computational time. In these cases, the production schedule must be generated using e.g. some kind of sophisticated heuristics, which can often lead to suboptimal solutions. In this paper, we introduce a Mixed Integer Linear Programming (MILP) based algorithm, which can be efficiently used to improve an existing feasible, but nonoptimal, production schedule or to reschedule jobs in the case of changed operational parameters. The algorithm has been successfully applied to certain scheduling problems in both the paper-converting and pharmaceutical industry. 1. I N T R O D U C T I O N The combinatorial complexity of many real-life scheduling problems combined with the demand for computational efficiency often requires the use of heuristic rules or aggregated procedures (e.g. Lee et al., 1997; Rosl5f et al., 1999). Although these methodologies can produce very good feasible schedules, the optimality of the solutions cannot be guaranteed. Consequently, in most cases a gap exists between the global optimal solution and the best one obtained. Already a minor tightening of this gap may improve the schedule significantly and thus, have a notable economical impact. The problem has been addressed using different approaches. Hasebe et al. (1991) proposed an algorithm based on two reordering operations, the insertion of a job and the exchange of two jobs. They stated that simultaneous reordering of several jobs would be preferred, but concluded that such a system would be very complicated to design. To simplify the problem, they used a method to aggregate jobs before the reordering phase. Franca et al. (1996) presented a tabu-search heuristic with job insertion and removal procedures including a final adjustment stage in order to improve the obtained schedule. Lee et al. (1997) also used a heuristic rule followed by a post-processing procedure consisting of a series of insertion and swap operations. In the present work, a reordering algorithm based on an MILP framework is introduced. The general idea is to iteratively release a set of jobs in a feasible schedule and reallocate them optimally into the production program. By adjusting the number of simultaneously released jobs, even very large systems can still be addressed, obtaining solutions within a reasonable computational time. The algorithm can be applied to a wide range of scheduling problems both in single and multi-unit environments. It works especially well when applied to certain complex batch process scheduling and rescheduling problems with sequence-dependent setup times. Promising results have been obtained with real-life data from both the paper-converting and pharmaceutical industry.
14 2. P R O B L E M
DEFINITION
Consider a problem which contains a set of production jobs i t o be allocated into processing units. Each job has a predetermined production time pi and possibly also a release date ri and a due date di. In case of a multi-unit environment, there may exist several complicating factors to be dealt with in the scheduling process. For instance, a job can often be produced on alternative processing units each of which has a specific production time and there can be precedence relations between the jobs. In many cases, the problem described is most actual in the chemical processing industry, especially in batch production. In an order-driven industry, e.g. in paperconverting, the batch sizes and thus, even the production times are often predetermined by detailed customer specifications. The challenge lies in handling a very large number of jobs in a dynamic environment, where new jobs continuously emerge and specifications of some of the already received ones can be changed at any time. In mid-term scheduling of pharmaceutical fine-chemical production the batch sizes can as well be considered as fixed ones, mainly due to the authority regulations and extremely high validation costs for modified production sequences. In this case, the ultimate assignment for the scheduler is the handling of the alternative production paths as well as the management of unstable intermediates. 3. S O L U T I O N
METHODOLOGY
The complexity of real-life problems together with the expectations for reasonable solution times often exceed the performance that can be provided by the exact mathematical models using available computational capacity. Consequently, the practical problems are commonly solved using heuristics combined with various degrees of true optimization elements. When the construction of an acceptable feasible solution can already be a difficult and time consuming task, the potential hidden in a possible improvement process often remains unutilized. To be able to improve these schedules towards optimality, we introduce a reordering procedure which is easy to implement and applicable even on large-scale problems. When a feasible schedule has been obtained, a subset of the jobs included is released and then optimally inserted back into the schedule between the fixed ones. The jobs to be released can be chosen e.g. according to a specific given order or they can be picked randomly. By adjusting the number of simultaneously released jobs, the computational complexity can be set to a desired level in relation to the total number of jobs present in the system and the available computer capacity. The reordering algorithm can be executed either by running a certain prespecified number of iterations, or using a convergence criterium, e.g. dealing with the reached improvement of the solution in relation to the number of performed iterations. 3.1 M I L P C o r e F o r m u l a t i o n for a S i n g l e - U n i t Case The core model for representation of an iteration stage in the reordering process can be expressed as an MILP formulation. The most interesting part of the formulation, from the algorithmic point of view, is the constraints needed for the allocation of the jobs based on continuous time representation (e.g. Greenberg, 1968). They can be written for example as follows: t~ - tj <_ - P i - s~j
V
(i, j ) e S I i x e d l i
precedes j
(1)
Equation (1) describes the relative order of the jobs that are not released at the actual iteration (subset Ssixed). It must be written for every pair of jobs preceding each other. The equation ensures that the production of job j cannot be started before the production of job i is completed and the required setup time sij has elapsed.
15
V
k E S vet
(2) (3)
V
k
9S r d
(4) (5)
V
k 9 S~
ti -- tk + ( T + sik -- rk ) . Yikj <_ T -- pi -- rk tk -- tj + ( T + Ski -- r j ) " Yikj <_ T - Pk -- rj tk -- t f + ( T + Skf -- r f ) " y k f <_ T - - p k
V
(i,j) E Sfix~dli
precedes j
--rf
tl -- t k + ( T + s l k -- r k ) " Yik <_ T -- p l -- r k
Y i k j + Y k l + Ylk = 1
(i,j)ess~
(6)
l i precedes j
Constraints (2) and (3) model the possible locations of a released job k (subset S re') in relation to the fixed ones. The binary variable y~kj obtains the value one, if the job k is allocated between jobs i and j. Accordingly, constraints (4) and (5) represent the time slots before and after all the fixed jobs, and the binary variables yks and y~k are set to one if job k is to be produced before the first fixed job f or, respectively, after the last fixed job 1. Equation (6) ensures that the released job k is allocated to one and only one of the locations allowed. The constant T represents the upper bound for the completition times of the jobs.
(7)
ti -- t j A- ( T + s i j -- r j ) " Yij <_ T - p~ - r j t j - ti -
( T + s j i - r i ) " y i j <_ - P j
- 8ji
V
(i,j)
9 Srd,i
# j
(8)
If several jobs are released simultaneously, their internal order is determined by constraints (7) and (8), in which the binary variable y~j is set to one if job i is produced before job j. A complete MILP model must, naturally, also contain a proper objective function and other relevant constraints, dealing e.g. with the release and due dates. A clear strength of this formulation, compared to many other reordering algorithms, is that every iteration contains information of the entire system, i.e. all jobs are present in the optimization procedure. Moreover, the result of the previous iteration can be used as a start condition for the following one, which provides a tight initial bound for the B&B algorithm. On the other hand, it is obvious that the reordering procedure can be driven towards suboptimal solutions as global optimality cannot be guaranteed. This phenomenon can, however, be avoided to some extent by releasing several jobs at the same time.
3.2 M u l t i - U n i t E n v i r o n m e n t The formulation presented above can be further utilized for multi-unit scheduling. The possible additional limitations, e.g. durability requirements of the intermediates, must be considered in the model by introducing appropriate constraints. This concept has recently been applied on a production planning problem dealing with the production of fine-chemicals in the pharmaceutical industry (BjSrkqvist et al., 1999). A very common feature in industrial batch processing is that a specific job can be performed on alternative processing units. Furthermore, the system can be highly coupled, i.e. the allocation decision concerning a job belonging to a production sequence often partly determines even the equipment which can be used for the down-stream jobs. These properties can be dealt with by introducing an additional reordering phase. The job with alternative production paths is first released, whereafter it is inserted into each of the possible processing units at a time. Finally, the processing unit providing the best overall solution is chosen. If there are coupled jobs present, it may be necessary that a part of the sequence must be released and then reallocated into the schedule according to the order given by the precedence constraints. An alternative method is to backtrack the entire sequence and enumerate every possible production path that can be generated by fixing the
16 processing units towards the down-stream jobs. This policy can be beneficial with sequences containing a limited number of alternative scenarios, whereas very complex recipes may be problematic from the computational point of view. 3.3 O p e r a t i o n a l A s p e c t s In a dynamic production environment it is very common that some jobs need to be relocated due to e.g. changed customer requirements, delayed raw-material deliveries or failures occurring on processing machinery. In an order-driven industry, there exists even a continuous need to allocate new orders into the existing schedule. In many cases, it is not desirable to reschedule all the jobs included, instead the required changes should be performed in such a way that the entire system is affected as little as possible. The reordering algorithm provides an efficient method to handle these issues. The modified jobs can be released and thus, rescheduled optimally only with minor changes to the original schedule. If a new job emerges, it can, accordingly, be inserted into the schedule using the same concept. The algorithm can also be used as a background process continuously performing release and insertion operations to find better solutions. Such a feature can be useful for production environments containing a very large number of jobs. If the jobs located in the near future are not preferred to be included into the continuous reordering process, the scanning can be limited to a time-window which is sufficiently separated from the current shop-floor schedule. If the complexity has been adjusted to an appropriate level, one iteration step does not require too high computational resources. Thus, if a sufficiently large number of reordering operations is performed, the possibility of finding improved solutions is considerable. From the operational point of view it is also a notable feature that, regardless of the convergence criterium used, the algorithm can be stopped at any time and is always able to provide the best solution obtained so far. 4. I L L U S T R A T I V E
EXAMPLE
A case study based on data received from a Finnish paper-converting mill producing barrier coated and laminated packaging materials and industrial papers, is presented. The mill is operated on an order-driven basis and the production machinery can be used for producing a very wide range of different product qualities. The task is to allocate the production jobs in such a way that the deliveries are performed in time and the total setup time is minimized. The large amount of jobs produced during a short time-period, continuously changing customer requirements together with strongly sequence-dependent setup times form a fascinating challenge, which is extremely difficult to solve by hand, even after years of shop-floor experience. The scheduling task contains 61 jobs representing 24 different product qualities on a single processing unit. No release dates are present but 11 different due-date groups complicate the system. The setup times required between different qualities can be derived from an expert system based on the data obtained from experienced schedulers. The time period includes two weekends during which the processing unit is not operated. The production sequence at the mill has been determined by a manually scheduled production program. The formulations required for the representation of the weekends do not fall under the scope and extent of this paper. Yet, the reordering iterations were performed using the MILP framework described above. The additional formulations do, however, slightly increase the combinatorial search space, which should be noted when studying the results. If the whole problem was solved in one stage, i.e. all the jobs were released simultaneously, the resulting MILP formulation would contain 1952 binary variables and be impossible to solve within acceptable time with the available computer resources.
17 4.1 T e s t r u n s 250 reordering iterations were performed starting from four different initial schedules: 1) The manually sorted production program (MANUAL) 2) a schedule obtained using a heuristics by first sorting the jobs using the earliest due date first policy and then, within a due date group, applying a priority rule dealing with the qualities (EDD-Q1Q2) 3) a randomized solution (RND) and 4) a solution obtained using a tailored iterative optimizer based on the concept presented by Roslhf et. al (1999) (SUPpre). The objective function is formed by a sum of total weighted tardiness and an overall weighted makespan. It should be noted that the schedule provided by the EDD-Q1Q2 heuristics is not regarded as an acceptable solution despite the fact that it provides a much lower objective function value, with the applied cost factors, than the realized schedule. Although the goal of minimizing the tardiness is very important, the total setup time is even more vital a factor for the efficiency of the mill. The EDD-Q1Q2 rule is not intelligent enough to consider this part to as large extent as desired. Two separate test sequences were performed using a uniformly distributed random selection of the released jobs. The first one releasing only one job at a time and the other releasing two jobs per iteration. The algorithm was implemented using C programming language and the tests were performed on a 300 MHz Pentium II workstation with 128 MB RAM running the LINUX operating system. The CPLEX-6.0 (ILOG, 1999) was used as an MILP solver. Selected results are presented in Figure 1 and Table 1.
T w o r e l e a s e d j o b s at a t ime
O n e r e l e a s e d j o b at a t i m e
300 000
300 000
RND
i RND 250 000
250 000
,~ 200 000
200 000
~ 150000
100 000
L__._,
0
50
100
150
Start value of the Randomized schedule is : 1 925 600
Fig. 1
~" 150 000
.
200
250
100 000
U
0
r
50
100
150
Nurrber of Iterations
200
250
Number of Iterations
The objective function value during the iterations
Table 1. Manually sorted production schedule vs. the best and worst solution after the reordering Indicator
Manual
Best solution
Worst
(SVPpre-2)
(RND-1)
Objective function value Active makespan Total setup time Number of tardy jobs Total tardiness
288,830 158.2 h 24.3 h 4 145.8 h
111,738 150.2 h 16.3 h 1 4h
118,516 157.7 h 23.8 h 1 4h
Total CPU-time used Average CPU-time per iteration Binary variables per iteration
-
3755.1 s 15.02 s 243
205.8 s 0.82 s 183
solution
18 4.2 C o n c l u s i o n s First of all, the results show that the SUPpre was directly able to generate a very good solution to the actual problem. However, the most interesting result is that the reordering process was able to improve even the randomized initial condition near to the very best solution found, with only a minor computational effort. When the obtained solutions are compared with the manually generated schedule, it is notable that even the "worst solution" is considerably more efficient than the one realized at the mill, especially in terms of total tardiness. Moreover, the best solution found leads to a very significant decrease of the total setup time. As expected, the strategy to release two jobs at a time led to a much stronger relative decrease of the objective function value than the option with only one released job. However, the higher complexity required much bigger computational effort. Despite the fact that the both strategies resulted, for this actual case, in schedules very near to each other, it can still be beneficial to release several jobs in order to guarantee high quality solutions. 5. D I S C U S S I O N
In this paper, an MILP-based reordering algorithm for the scheduling and rescheduling of batch processes was presented. It was shown that the algorithm can be successfully used to improve large-scale schedules appearing in the chemical processing industry. Considerable improvements to an existing non-optimal schedule can often be obtained already with low computational capacity. A powerful strength of the proposed methodology is that every phase of iteration contains information of the entire system, which means that each iteration will only improve or maintain the current schedule quality. The method can be applied even to improve already running schedules as a background optimization process. Furthermore, due to the general nature of the concept, the algorithm can, with minor modifications, be applied to various types of scheduling and other optimization problems with a related structure. REFERENCES
BjSrkqvist J., Karlsson S., RoslSf J., RSnnback R. and Westerlund T. (1999). Applying Iterative and Parallel Methods for Production Planning in the Pharmaceutical Industry. Presented at AIChE Annual Meeting, Dallas, Texas, USA. Franca P.M., Gendreau M., Laporte G. and Miiller F.M. (1996). A Tabu Search Heuristic for the Multiprocessor Scheduling Problem with Sequence Dependent Setup Times. International Journal of Production Economics, 43, pp. 79-89. Greenberg H. (1968). A Branch-Bound Solution to the General Scheduling Problem. Operations Research, 16, pp. 353-361. Hasebe S., Hashimoto I. and Ishikawa A. (1991). General Reordering Algorithm for Scheduling of Batch Processes. Journal of Chemical Engineering of Japan, 24, pp. 483-489. Lee Y.H., Bhaskaran K. and Pinedo M. (1997). A Heuristic to Minimize the Total Weighted Tardiness with Sequence-Dependent Setups. IIE Transactions, 29, pp. 4552. Puigjaner L. (1999). Handling the Increasing Complexity of Detailed Batch Process Simulation and Optimization. Computers ~ Chemical Engineering, 23, pp. $929-$943. RoslSf J., Harjunkoski I., Westerlund T. and Isaksson J. (1999). A Short-Term Scheduling Problem in the Paper-Converting Industry. Computers ~4 Chemical Engineering, 23, pp. $871-$874. Shah N. (1998). Single- and Multisite Planning and Scheduling: Current Status and Future Challenges. Proceedings of FOCAPO'98, Snowbird, Utah, USA.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
19
Non-Linear Partial Least Squares through Data Transformations B. Li, E. B. Martin and A. J. Morris* Centre for Process Analytics and Control Technology University of Newcastle, Newcastle upon Tyne, NE 1 7RU, United Kingdom Partial Least Squares (PLS) is one of the most frequently used techniques for process modelling and monitoring with correlated data. In this paper, a Box-Tidwell transformation based PLS algorithm (BTPLS) is proposed to deal with non-linear problems in complex systems. The BTPLS algorithm provides a family of flexible regression models for data fitting. These are shown to out-perform both the linear and quadratic PLS algorithms for non-linear problems in terms of modelling and prediction accuracy. In contrast to neural network based PLS (NNPLS) algorithms, the BTPLS algorithm significantly reduces computational costs and exhibits better performance for many practical situations in terms of Akaike Information Criterion. This is due to the resultant model forms being more parsimonious and the use of a non-iterative search for data transformations and regression coefficients. The BTPLS is a compromise between model simplicity and accuracy, and constitutes a complementary modelling technique alongside linear PLS and NNPLS. 1. INTRODUCTION Partial least squares has been shown to be one of the most frequently used techniques for dealing with highly correlated data in process modelling and monitoring [1]. For systems that exhibit complex non-linear behaviour, linear PLS is inappropriate for modelling the underlying structure. A number of non-linear extensions to linear PLS have been developed. Wold et al. [2] proposed a quadratic extension to linear PLS whilst a number of authors developed variants of neural network based PLS algorithms [3-6]. Most recently, Baffi et al. [7] presented an error based weight updating procedure for quadratic PLS algorithm that was shown to out-perform the quadratic PLS algorithm of Wold et al. [2]. Baffi et al. [8] then combined the error-based weight updating procedure and a neural network approach to obtain a modified neural network based PLS algorithm (NNPLS). In this paper, a compromise between linear PLS and the modified NNPLS algorithm is proposed. A model is a simplified representation of the real world, hence modelling is a trade-off between model simplicity and model accuracy. For example, there are a wealth of regression techniques which differ in terms of complexity. These include linear regression, linear regression through data transformations, non-linear regression, and non-parametric regression. Each technique has its own advantages and disadvantages. Practitioners are then required to select the most appropriate tool according to the modelling objective and the required simplicity and accuracy of the application. *The authors acknowledge the support of the EU ESPRIT PERFECT No. 28870 and SCIENTIA No. GR/L28029
20 In this paper a compromise between the two extremes of the complexity spectrum in terms of PLS, linear PLS and the modified NNPLS algorithm is proposed, the Box-Tidwell Transformation based Partial Least Squares (BTPLS) algorithm. Since the Box-Tidwell transformation family [9] encapsulates both linear and quadratic forms as special cases, it is not surprising that the Box-Tidwell transformation based PLS algorithm can exhibit better performance than either the linear or quadratic PLS algorithms for modelling non-linear behaviour. Compared with NNPLS, the BTPLS has clear advantages in terms of computational effort and model parsimony, especially for industrial data where large amounts are being routinely collected, typically involving hundreds of variables. It is also equally useful for laboratory data where there is only a limited number of samples and there is therefore a tendency for the data to be overfitted when using neural network approaches.
2. PROBLEM DEFINITION Consider a set of data representing the "normal" status of a process. Xuxu represents the process variables and YN• the quality parameters, which are recorded for N time points. The objective of linear PLS is to project the data down onto a number of latent variables (LVs), say tj and uj, where j= 1.... a, and then to develop a regression model between the LVs:
uj = bjtj + e j
(1)
t jp Tj + E and Y =
The matrices X and Y are decomposed as X j =1
fij -l)jtj
fi jq Tj "[- F ,
where
j =1
is the prediction of u j from (1), E and F are the residual matrices for the matrix
decomposition of X and Y, and a is determined by cross validation. The most commonly used PLS algorithm is non-linear iterative partial least squares (NIPALS). This algorithm sequentially extracts each pair of LVs through an iterative procedure. In each iteration, the decompositions of X and Y are related through a linear regression between the latent variables tj and uj. To extend the algorithm from linear to non-linear PLS, Wold et al. [2] proposed a quadratic modification to equation (1), U j -- COj ~- Clj[ j + c2jt 2j -t- ej. As pointed out in [3], the applicability of the quadratic form is limited in terms of the structures it can model. To overcome this problem, several variants of NNPLS have been proposed in which neural networks were used to approximate an arbitrary regressor function f(tj), uj = f(tj)+ej. Clearly, equation (1) plays a key role in the non-linear extension of the PLS algorithm. More importantly, such extensions affect the outer mapping through the weight vectors [7].
3. BOX-TIDWELL TRANSFORMATION BASED PLS ALGORITHM The application of data transformations is one of the most often used techniques in regression analysis. One key advantage of PLS is that it essentially reduces to a simple regression problem with only one-independent and one-response variable, equation (1). Compared with general multiple regression problems, the identification of a transformation for one-independent variable is more straightforward. In addition there exists an important
21 distinction between PLS and ordinary regression; regression between the latent variables is performed automatically in PLS. This means that at each iteration it is not possible to check the structure of the latent variable data and thus decide which transformation should be applied. Therefore, it is necessary to develop a procedure that automatically selects the most appropriate transformation. In this section, the Box-Tidwell transformation family is introduced before describing a modified version. Finally the modified Box-Tidwell transformation family is used to develop the new BTPLS algorithm.
3.1. Box-Tidwell transformation family and its estimation procedure Consider a simple regression problem between an independent variable x and a response variable y. Instead of fitting a linear regression model: (2)
E(y) = g(x, flo, ill) = flo + fll x
Box and Tidwell [9] proposed a transformation family for a positive independent variable x and then investigated the regression problem between t and y:
E(y) = g(t, flo,
1~1)=/~0 + til t
with t = x a for a r 0 and t = In(x) for a = 0
(3)
Clearly equation (3) is more flexible for data fitting than the linear model defined in equation (2). To estimate the unknown parameters fl0, fll and o~, they proposed expanding function g about the initial guess, o~0=1, in a Taylor series and ignoring terms higher than first order:
E ( y ) = g ( t , flo,fll)= flo + f l l x + ( a - a o ) { d g ( t ,
flo,fll)/da}a:ao=flo + f l l x + T z
(4)
Pl
in the linear
where y = (c~ - 1)fl~ and z = x In(x). Denoting the least squares estimate of
model, equation (2), as J31, and the least squares estimate of ),in the linear model, equation (4) as ~, oc is estimated as o~* = ~//31 § 1, and ,80 and fll are estimated by least squares estimates for y and t= x a* in the model equation (3). This procedure can be repeated to ensure convergence. Box and Tidwell [9] noted that this procedure usually converges quite rapidly, and often the first stage result, oc*, is a satisfactory estimate [ 10].
3.2. Modified Box-Tidwell Transformation Family One of the key assumptions of the Box-Tidwell transformation family is positivity of the independent variables. This however is not valid for the inner mapping problems of the PLS algorithm where both the independent and response variables, i.e. the latent variables tj and uj, have zero-means. In order to apply the Box-Tidwell transformation, the transformation in equation (3) is extended from x>0 to any real x by the following piece-wise transformations:
•[sgn(x)] 6 Ix Ia, t = ~[sgn(x)]~ ln(I x I),
o~ r 0 a-0
for 6 = 0 or 1
(5)
22
Based on equation (5), the regression model, equation (3) can be extended as follows to replace equation (2): E ( y ) = g(t, f l o , f l l , 6 , a ) =
flo + ill(sign(x)) 8 Ixla
8=0
or 1
(6)
3.3. Modified estimation procedure of Box-Tidwell transformations It should be noted that the above model is no longer valid when both x = 0 and o~ <0. Therefore, o~ is further constrained as o~ >0 in the above extended Box-Tidwell family, Equation (5). In optimization, a typical implementation of this restriction is to let o: = v 2 for any real 1:. Taking this restriction on o~ into account, the modified estimation procedure can be obtained in a similar way to the Box-Tidwell estimation procedure. The only difference is to expand the function g with respect to v rather than o~. Specifically, for observation data { (xi,Yi), i= 1. . . . . N } , the function g in equation (6) is expanded about the initial guess v 0 = 1 in a Taylor series and the higher than first order terms are ignored: E ( y ) = g(t, flo, fll , 6, v 2 ) = flo + ill(sign(x)) 8 I x l +(V - Vo ){dg(t, flo, fll, 8, vZ ) / dv}v=Vo
= flo + fll (sign(x)) 8 I x l + y z where 7"= 2(v
/~, = a r g m i n
- 1)fl 1
and z= (sign(x)) 8 I x Iln(I x I). The parameters are then estimated as
N
Z [ y i - { f l 0 + fll(sgn(xi)) 8 Ixi I}] 2 flo,fl1,8 i=l N = a r g m i n Z [ y i - { f l o + fll[sgn(xi)] 8 Ixi I+y(sgn(xi)) 8 Ixi Iln(lxi I)}] 2 flo,fll,~,T i=1
o~* = {~/(2/~1) + 1}2
(7a)
(7b) (7c)
N
[flo*,fll*,8*]=arg min Z [ Y i - { f l 0 + fll (sgn(x)) 8 Ixi la*}] 2
(7d)
A~,Pl,8 /=1 The problem in equations (7) is essentially a quadratic optimization which can be solved through least squares by decomposing the problem into two sub-problems for 8 - 0 and ~= 1.
3.4. Box-Tidwell transformation based Partial Least Squares Algorithm The Box-Tidwell Partial Least Squares algorithm is based on the quadratic PLS algorithm of [2] and the error-based weight updating procedure of [7]. The estimates of the first iteration are used as approximations of the Box-Tidwell transformations. This avoids additional iterative steps in the search for the optimal Box-Tidwell transformations during the iterative identification of the latent PLS structures. Specifically, the BTPLS algorithm is the same as the error-based weight updating procedure of [7] (Table 3) except for step 5 and step 14, of Table 3 in [7], which is modified to estimate the parameters [fl0*,fll*,~*,ot*] from equation (7).
23 It is noted that in BTPLS, appropriate transformations are automatically chosen through the modified Box-Tidwell estimation procedure. No intervention is needed to identify which transformation should be applied. Moreover, in contrast to a non-iterative procedure, the modified NNPLS algorithm [8] requires a neural network to be trained at each iteration to identify the latent structures. This clearly demands increased CPU time. 4. E X A M P L E The cosmetic data of Wold et al [2], comprising N=17 different formulations of face creams forms the basis of the study. This particular data set has been chosen as it has formed the basis of a number of other comparative studies on PLS [3]. It is also well known that it is problematic in terms of its tendency to be overfitted. Each formulation is composed of 8 chemical constituents including glycerine, water, emulsifier, vaseline, and 11 quality variables such as ease of application, greasiness, skin smoothness, skin shininess and overall appeal. To illustrate the flexibility of the Box-Tidwell transformation family for modelling the LV structure within the BTPLS algorithm, scatter plots of LVs tj and uj (j=1,2,3,5) and the resulting fits from the BTPLS algorithm are given in Figure 1. It can be seen from Fig. 1 that the Box-Tidwell transformation family is quite flexible for fitting data that exhibits non-linear features. For instance, for the latent variables given, latent variables tj and uj, it is clear that neither linear nor quadratic regression can capture the underlying trend, while from Fig. 1, fitting tj and uj through a Box-Tidwell transformation, the result is acceptable. Secondly, in comparison with the modified NNPLS where a neural network is trained to approximate the relationship between tj and uj, BTPLS ensures a parsimonious model. For instance, for LVs tl=[tM and Ul=[Ulk], the resulting regression model fitting is given by Ulk=O.25+4.94tlk4"42+Ekfor tlk_>0 and Ulk=O.25--4.941tlk14"n2+Ekfor t~k <0. Moreover, when the latent LVs exhibit a linear relationship, the BTPLS reduces to linear PLS. For instance, for t3 and u3, the BTPLS gives an estimate of o~as c~ = 0.98. Thus, for the third pair of latent variables, the BTPLS gives almost the same result as linear PLS.
"~ o
Y -0.5
ooj o
oo S
ou o
o
0 tl
0.5
-0.5
0 t2
0.5
0 t5
1
4
f
~oO
o
4'
-2
-i
0 t3
i
2
--2
-1
Fig. 1. Scatter plots of latent variables and regression fitting ( - )
2
for the BTPLS
24 The balance of model simplicity and accuracy can be further evaluated in a quantitative way by using Akaike Information Criterion (AIC). Table 1 gives a comparison of AIC for BTPLS and modified NNPLS (with a feedforward network consisting of one hidden layer and h hidden neurons) for the first eight pairs of LVs. It can be seen that many of the fits through neural network approximations are seriously overfitted. This means that too high a price on model parsimony is paid for in terms of accuracy of the modified NNPLS algorithm. Table 1. Comparison of AIC in LV Pair 1 BTPLS 20.14 NNPLS (h=2) 59.93 NNPLS (h=3) 43.58
latent variable regressions 2 3 4 39.84 26.40 31.52 60.08 66.45 55.09 32.05 48.40 40.88
for BTPLS and NNPLS 5 6 7 6.61 28.36 27.70 31.87 53.33 33.68 33.11 30.09 25.28
36.08 40.60 30.69
Finally from a simulation study (not reported) it is shown that the modified NNPLS approach has much higher computational costs than the BTPLS (the BTPLS takes only 0.42% of the CPU time needed by the modified NNPLS used in the simulation study). This will also be true for all sigmoidal neural network based PLS algorithms. This is a consequence of the fact that at each iteration in the loop for defining the latent structure, a neural network is trained, whilst for BTPLS, this step is superfluous. Computational costs will further increase if good initial values for the training of the neural networks are to be obtained, and the appropriate number of neurons in the hidden layer is also to be identified. 5. CONCLUSIONS Box-Tidwell transformation based PLS is proposed to deal with problems exhibiting nonlinear features. Advantages of the BTPLS algorithm include: (i) enhanced flexibility in fitting data with non-linear features compared to the linear and quadratic PLS algorithms; (ii) lower computational costs than neural network based PLS algorithms; (iii) better performance in terms of AIC than neural network based PLS algorithms. Based upon these features, the BTPLS is a comprise between model simplicity and model accuracy. This is especially appropriate when modelling large amounts of industrial data in terms of savings in computational time, as well as for laboratory data where there is only a limited number of samples, in this case application of BTPLS algorithm can avoid overfitting. REFERENCES
1. T. Kourti, and J.F. MacGregor, J. of Quality Tech., 28 (1996) 409. 2. S. Wold, N. Kettaneh-Wold and B. Skagerberg, Chemo. Intell. Lab. Syst., 7 (1989) 53. 3. S.J. Qin and T.J. McAvoy, Computers Chem. Engng., 16 (1992) 379. 4. T.R. Holcomb and M. Morari, Computers Chem. Engng., 16 (1992) 393. 5. E.C. Malthouse, A.C. Tamhane and R. S. Mah, Computers Chem. Engng., 21 (1997) 875. 6. D.J.H. Wilson, G.W. Irwin and G. Lightbody, ACC, Albuquerque, New Mexico, 1997. 7. G. Baffi, E.B. Martin and A.J. Morris, Computers Chem. Engng., 23 (1999) 395. 8. G. Baffi, E.B. Martin and A.J. Morris, Computers Chem. Engng., 23 (1999) 1293 9. G.E.P. Box and P.W. Tidwell, Technometrics, 4 (1962) 531. 10. D.C. Montgomery and E.A. Peck, Introduction to Linear Regression Analysis. New York: Wiley, 1982.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
25
"Optimisation of an Industrial Cogeneration System by means of a MultiObjective Genetic Algorithm" G. A. Effhimeros", D. I. Photeinos", I. G. Katsipou a, Z. G. Diamantis a, D. T. Tsahalis a a Laboratory of Fluid Mechanics and Energy, Department of Chemical Engineering, University of Patras. P.O. Box 1400, GR26500, Patras, Greece E-mail: [email protected]~:...C.~.H..~M.E,.N....G..,_~,P.AT, R.A.S_:_.G_R_ URL: http ://LFME. CHEMENG.UPATRAS. GR 1. INTRODUCTION The key word in the process industry is energy. Energy is required in multiple forms (electricity, steam, mechanical energy, fuels, etc.) and large amounts for the proper operation of an industrial process plant. Very often, multiple sources of energy are incorporated in large process plants. These sources can be utilities such as steam turbines, gas turbines, fuel-burning boilers, exhaust gas boilers, or even the electricity grid. It is obvious that the operating cost of a plant strongly depends on the amount of energy the plant requires, especially in cases where the energy cannot be generated internally in the plant (as by-product of separate processes in the plant) and has to be purchased in the form of fuels and/or electricity from the local grid. The need for intensification and self-efficiency, in terms of energy, of the process that consequently results in reduction of the operating cost is satisfied to a certain extent by the cogeneration systems. Such systems incorporate various utilities (usually gas or steam turbines, and exhaust-gas boilers with supplementary firing of fuel) to produce needed steam of various grades and electricity, which can be exported to the electricity grid in case of excess. Due to the variety of the utilities incorporated and their interdependencies, as well as the variation of technical and economic conditions with time, the task of optimizing the operation of a cogeneration system is complex. In order to emphasize this fact, it is not rare for the operation of such systems to be empirically determined. In order to solve these types of problems, various methods are still being developed. This is mainly due to the nonlinearity of such problems, which have multimodal objective functions that may invoke both discrete and continuous variables. Up to now, the authors are not aware of a single method that has solved such optimization problems successfully. In this paper, the problem of optimizing the operation of an industrial cogeneration system is addressed with an advanced-level optimization technique that is based on a MultiObjective Genetic Algorithm (GA). This optimization method, which is usually referred to as the Pareto technique, is widely used in optimization problems where multiple parameters must be optimally configured simultaneously. While maintaining the robustness of Gas, this method utilizes multiple objective functions to better describe the problem. For the calculation of the fitness functions, the Pareto GA
26 utilizes both the simulation model of the system and specified constraints, in order to solve the optimization problem considered.
2. THE OPTIMIZATION P R O B L E M
The optimisation problem at hand consisted of a cogeneration system with a recovery boiler. This system comprised a "superstructure" that in general could include the following technologies: combustion, air preheating, oxygen enrichment of air, gas turbine, advanced gasturbine, partial oxidation gas-turbine, gas or diesel engine. During the EXSYS project, a model was developed for this system, that took into account only generic technologies, i.e., technologies and utilities available in the market, along with the necessary information about them [2]. In this system, the role of the gas turbine is proven to be pivotal. The size of the gas turbine influences not only the cost of the system, but also its efficiency. According to the generic model developed for this system, the following equations [2] governed the selection of the appropriate gas turbine: ]]loss - - 0.1576 + 0.0129 log(WinCe),
(1)
Cost =
(2)
1.466
(We)0"845,kECU
Maintenance costs = 0.0851 (We)"0"3081,in kECU/kWh
(3)
Where: ]]loss is the loss factor for the gas turbine, expressed as 1 - ]]heat- ]]mec ]]heat is the thermal efficiency factor
]]mccis the mechanical efficiency factor, corresponding to the electricity produced by the gas turbine with respect to the fuel consumption Wmcc is the mechanical power of the gas turbine (in kW) Wo is the electrical power of the gas turbine (in kWo) Information about the mechanical and electrical power of commercial gas turbines existed for 41 commercial gas turbines in the databases developed during the EXSYS project [2]. It is obvious that the optimal gas turbine for the cogeneration system under consideration should be the one with the minimum loses, cost and maintenance costs. Thus, the optimization problem consisted in finding the optimal gas turbine that satisfied equations (1)(3) simultaneously, or in other words, to find the mechanical and electrical power that minimized equations ( 1)-(3). At this point it should be noted that the optimization problem is not of extreme complexity. However, it was selected as a test case for the multiobjective optimization algorithm that was developed. Both the algorithm and the results are preliminary, while it is envisaged that in the near future this algorithm will be further improved.
27 3. THE MULTIOBJECTIVE GA As mentioned in the Introduction, the optimization method that was selected for this problem, is the Genetic Algorithms (GAs) method. This method is part of a class of algorithms, called Evolutionary Algorithms. The characteristics that distinguish the GAs from the classic optimisation techniques are the following: 1. GAs do not need any type of information other than a measure of how good each point in the optimisation area is. Consequently, they may be applied in cases where only a black-box model of the system-to-be-optimised exists 2. GAs work with a coding of the parameter set and not with the parameters themselves 3. GAs search for the optimum from a set (population) of points, and not from a single point 4. GAs use probabilistic transition rules and not deterministic ones 5. GAs are a robust optimisation method, i.e. they perform regardless of the optimisation problem. 6. GAs provide more than one equivalently good near-global-optimum solutions. This allows the selection of the most appropriate solution for the problem at hand. From the above it seems that for the application of a GA to a problem, a) a good knowledge of the problem and b) an experience using GAs are not necessary. Even though this may be generally true, both (a) and (b) are necessary for the successful application of the GA. The GA developed for the optimization problem at hand, utilizes the classic GA operators of reproduction, crossover and mutation. For an introduction to these operators and the classic structure of a GA, the reader is referred to Goldberg [ 1]. The fitness, which is a measure of the "goodness" (optimality) of each possible configuration (string) for Wo and Wmoc in the optimization space, should consider all three objective functions (eq. (1) - ( 3 ) ) simultaneously. This was achieved by assigning a "dummy" fitness to each string in the population, according to the values of the three objective functions. Moreover, a weighting factor was used for each of the three objective functions, which corresponded to the importance of each objective function, i.e. the weighting factors should have the same value for all objective functions when the objective functions are considered to be of the same importance. Thus, the "dummy" fitness assigned to each string in the population and in each generation, was based on the following formula:
F= Ewi" fi
(4)
i
where: wi is the weighting factor of the objective function i t] is the value of the objective function i for a string Based on the value of the "dummy" fitness of each string, the population in a generation was classified in ranks. Each rank consists of strings (configurations) of equal fitness, i.e. of equivalently optimal configurations, and the optimal configurations were stored in Rank 1. Finally, a comparison was performed between each pair of "parent strings" and the corresponding pair of "offsprings (4 strings in total) and the best two strings were included in the initial population of the next generation.
28 4. RESULTS AND CONCLUSIONS The GA multiobjective optimization algorithm was developed in the FORTRAN 90 programming language, and the code executions were performed on a Pentium II 450 MHz with 320 MB of RAM. Depending on the size of the population and the limit to the number of generations, the code takes a few seconds to execute. Various runs were performed, and the results indicate that the optimal gas turbine(s) should produce a mechanical power between 5960 and 24630 kWmee,electrical power between 5841 and 24150 kWo. Concerning the three objective functions for the optimal range of gas turbines, the corresponding values are: rllossbetween 0.34 and 0.358, cost between 15 and 20 Million EURO and maintenance costs between 0.0027 and 0.0037 EURO/kWh. The results obtained with the present multi-objective optimization method, although preliminary, are satisfactory. This conclusion stems from the comparison of the results obtained with those obtained from the single objective optimisation method, which was applied under the framework of the EXSYS project. With the new optimisation technique a remarkable decrease in the maintenance cost is achieved for a specific range of the generator output, 584124150 kWh. The range of the maintenance cost that corresponds to the referenced generator output in the case of the single optimisation method is 0.0031-0.0062 EURO/kWh. The coding of the parameter space and certain aspects of the code can be further optimized. However, the optimal values that the GA found correspond to at least 4 commercial gas turbines that satisfy the needs of the case study, while remaining the most economic solution available. From the work performed, the following conclusions can be derived: 1. GAs are a robust optimization method that can successfully address any optimization problem in the process industry. This conclusion has already been pointed out in similar work performed by LFME on this field. [3], [4], [5] 2. The introduction of multiple objectives in the robust method of GAs takes optimization a step further. This is specifically true for the optimization problems of the process industry, where the cost has always been the only parameter for optimization, regardless of any other improvements. 3. Due to their fast execution, multiobjective optimization algorithms based on GAs is a tool that can be used by the process engineer, not only during the development phase of a process, but also on-line, for control purposes. 6. ACKNOWLEDGEMENT Part of the work presented in this paper was supported by the European Commission in the JOULE3 project EXSYS (Contract No. JOE3-CT95-0020). REFERENCES
1. Goldberg D. E., "Genetic Algorithms in Search, Optimisation, and Machine Learning", Addison-Wesley Publishing Company Inc., 1989. 2. EXSYS Final Report, submitted to EC in December 1997. 3. Manolas D.A., Gialamas T.P., Tsahalis D.T., "Development of a special Genetic Algorithm for the Selection of the Energy Best Available Technologies and their Optimal Operating Conditions", presented at the First European Congress on Chemical Engineering (ECCE-1), Florence, Italy, 7 May 1977.
29 4. Manolas D.A., Effhimeros G.A., Tsahalis D.T., "Development of an expert System Shell based on genetic Algorithms for the Selection of the Energy Best Available Technologies and their Optimal Operating Conditions for the Process industry", Proceedings of IFAC Minisymposium on Optimisation using Evolutionary Methods, 15-17 July, 1998, Patras, Greece. 5. Manolas D.A., Gialamas T.P., Fragopoulos C.A., Tsahalis D.T., " A Genetic Algorithm for Operation Optimisation of an Industrial Cogeneration System", Journal of Computers & Chemical Engineering, Vol. 20, Suppl. B, p.p. S1107-Sl 112, 1996
This Page Intentionally Left Blank
European Symposiumon ComputerAided ProcessEngineering- 10
S. Pierucci(Editor) 9 2000 ElsevierScienceB.V. All rightsreserved.
31
Grid refinement in multiscale dynamic optimization* T. Binder 1, L. Blank 2, W. Dahmen 2, W. Marquardt 1 1 Lehrstuhl fiir Prozesstechnik, 2 Institut fiir Geometrie und Praktische Mathematik, RWTH Aachen, Germany. Abstract
In the present work we explore an adaptive discretization scheme for dynamic optimization problems applied to input and state estimation. The proposed method is embedded into a solution methodology where the dynamic optimization problem is approximated by a hierarchy of successively refined finite dimensional problems. Information on the solution of the coarser approximations is used to construct a fully adaptive, problem dependent discretization where the finite dimensional spaces are spanned by biorthogonal wavelets arising from B-splines. We demonstrate exemplarily that the proposed strategy is capable to identify accurate discretization meshes which are more economical than uniform meshes with respect to the ratio of approximation quality vs. number of used trial functions. dynamic optimization, large scale systems, direct method, adaptive mesh refinement, input estimation, state estimation, simultaneous approach, wavelets Keywords:
1
Introduction
The numerical solution of dynamic optimization problems is typically quite challenging for large-scale applications. The challenge becomes even more severe when real-time applications are envisaged, since the response time where a valid solution has to be prompted is fixed. In on-line applications usually the numerical cost and the associated solution time is conservatively estimated and the optimization problem is solved with well developed numerical methods (e.g. Tanartkit and Biegler, 1997, and Bock et al., 1999). The numerical effort is determined to a large extent by the complexity of the finite dimensional approximation. In fact, the computational effort grows at least superlinearly with an increasing number of decision variables. Problem adapted discretization of the control vector might be considered if one is interested in lowering the computational burden associated to a specified accuracy while at the same time the robustness of the solution algorithm is improved. In particular a discretization which is too coarse on a uniform grid or which locally resolves the profiles in the wrong location on a nonuniform grid cannot meet prespecified accuracy requirements. On the other hand, a discretization which is too fine often leads to inappropriately high computational cost and might cause robustness problems in addition. However, it is not trivial to generate a problem adapted mesh a *This work has been supported by the "Deutsche Forschungsgemeinschaft" under grant no. MAl188/6
32 priori. There have been only few attempts to incorporate adaptivity into the discretization scheme with the objective of automatically determining an appropriate mesh (e.g. Waldraff, 1996; Tanartkit and Biegler, 1997; Betts and Huffman, 1998; and Binder et a/.,1998). In this contribution, we want to address adaptive discretization strategies for input and state estimation problems which are formulated as dynamic optimization problems. The optimization problem is approximated by a nonlinear program (NLP) where states and inputs are discretized simultaneously. We suggest a systematic framework which automatically generates sequences of nonuniform grids with an increasing degree of resolution. The method is started from a coarse grid (t~ = 0) with few decision variables which can be solved efficiently and robustly. In every following refinement cycle (t~ := t~ + 1) the discretization mesh is improved in order to meet local accuracy requirements. In particular the optimization problem is formulated in a weak sense and discretized using a Wavelet-Galerkin approach. Biorthogonal wavelets arising from B-splines are employed to span the test and trial functions. The aim of this paper is to explore potential reuse of the current solution for an adaptive refinement. Improvements on the approximation of the measurements are established employing thresholding techniques. Error analysis techniques based on one-step methods are used to monitor the discretization error of the model equations whereas unknown input functions in the estimation problem are refined based on gradient information of potential trial functions. The suggested refinement procedure leads to problem adapted approximations with local resolution to guarantee prespecified local error bounds. 2
Problem formulation
We consider estimation problems formulated as a dynamic otpimization problem given by min fo(x Xo,W J(to*~f
y, w, z) dT
(P1)
under the restrictions
y
:
f(X, U, w,t),
t e [to, tf]
:
C(X, U, W, t),
t e [to, tf]
o >_ o
-
te[to, tf] z(to)-xo
.
,
(1) (2) (3) (4)
x(t), x0 C ]RTM denote the state and initial condition, y(t) e IR'~ are the model outputs and u(t) E ]Rn~ are the inputs which are assumed to be measureable and therefore known. w(t) E R n~ is an unknown time variant input function which might reflect disturbances in the process or uncertainty in the process model, z(t) c ]RTM is a reference or measurement function and known, u and z are interpolated functions based upon possibly denoised measurement samples z(ti), u(ti), l a n d c denote the process model of appropiate dimensions. Mixed constraints are denoted by g. f0 specifies the cost functional where to, tf denote the initial and final times.
33 A multiscale formulation of the process model which permits model representation of various resolutions is obtained by a weak formulation of equations (1)-(4): = 0 V ~ e (L2(I)) n~ (y - c(x, u, w, t), ~y) - 0 V C y e (L2(I)) ~ (g(x,w,t),v) << 0 V u e (L+(I)) ng
(& - f (x, u, w, t), ~ )
-
to))
=
o
(5) (6) (7) (s)
Here 5 denotes the dirac function and I := [to, tf]. For convenience we gather v := ( x T yT, U T , w T zT)T e T and r "- (~T ~T ~T) e M where T and ~ refer to appropiately chosen functions spaces. We choose appropriate finite dimensional wavelet spaces T A and 2~4A as subsets of T and ~4. Wavelets Cj,k, are specialized functions of local support which enable an efficient approximation of an arbitrary function f, e.g. J f ~ ~keZ~ o djo-l,k~jo, k -+-~-~j=jo ~keJj dj,kCj,k where Zjo , ffj denote appropiate index sets 9 Wavelets are constructed such that the Euclidean norm of the wavelet coefficients dj,k is always proportional to the L2 norm of f (see e.g Dahmen, 1997 for a survey). Thus discarding small coefficients dj,k will cause only small changes in approximate representations of f. Moreover, in regions where f is smooth the values Idj,kl will be quite small. Therefore functions that exhibit strong variations only locally, can be approximated very accurately by linear combinations of only relatively few wavelets corresponding to the significant coefficients dj,k. Denoting the set of the corresponding indices (j, k) by A, the sparse basis ~h : = {~)j,k : (j, k) C A} is expected to lead to a particularly adapted approximation to f. In particular we discretize (P1) using hat wavelets r to approximate x, y, z and Haar wavelets r for u, w , e. g. x ..~ x A "= d~ @A~, Y ~ Y A "- d ~A~, z .~ z h "= dT~A~, u ~ uA " - d uTm aH~ w ~ w h := d T~ A H . The state and output equations (5),(6) are tested by appropriately chosen dual wavelets (see Binder et al., 1998 for further details on the discretization). Since the trial functions employed are piecewise constant (r or piecewise linear (r it is sufficient to evaluate the inequalities (7) pointwise on a possibly nonuniform mesh nh:= {ti E I } which captures the finite number of knots in the approximation. The optimization problem in discretized form is now given by min OA(dx, dy, d~, dz)
(P2)
under the restrictions f A(dx, d ~ , d w , t ) cA(dx, dy, du, dw, t) gh(dx, d~, ti) eh(dx, xo)
---
u 0
,
<_ 0, =
0
V t i E/kA,
,
where f A , CA,gA a r e the finite dimensional model equations resulting from (5), (6) and (7) after projection, e i 9= d T x ~ i (to) approximates (4) and Oh "-- f f0(Xh, YA, Zh)d7 is the discretized cost functional of problem P1.
3
Adaptive Algorithm
R e f i n e m e n t of k n o w n q u a n t i t i e s : z, u are measurement functions, which have been obtained by interpolation of the possibly non-uniform discrete measurements. We limit
34 ourselves to the treatment of z since refinement of u is obtained in a similar way in every refinement step g. We are interested in compressed approximations z~A~satisfying II
-
z
!
<
,
(9)
with given tolerance c~. Let dzJ be the coefficient vector of the expansion zi - dJziT~A~ where ~ h [ is sufficiently rich to capture all measurement samples. On account of the norm equivalences (Dahmen, 1997) we simply have to neglect the elements of dz~ which are smaller than a threshold c which uniquely depends on c~. The remaining entries are the s i g n i f i c a n t coefficients and their indices form the index set Aezi. Typically the number of significant wavelet coefficients is far less than the number of discrete measurement samples. During the refinement sequence the approximation quality is increased Q+I' -< Q.' Thus the approximation from step g to t~+ 1 is refined adding trial functions with indices F ez i "- ~Ae+l A A~ " Hence, P~z~is called refinement set of step g. R e f i n e m e n t of s t a t e s x a n d o u t p u t s y: Although the discretization structure allows individual non-uniform meshes for the components of x and y we restrict ourselves to the simpler case where a common mesh is used to discretize all xi, Yi. The refinement is based on an error analysis of x~ only since errors in YA are directly linked to errors in xa. Error analysis either involves local error estimation or residual evaluation. The latter is computationally inexpensive and gives usually a qualitatively good grasp on the error behavior. However, sharp error estimates are difficult to obtain. Therefore the refinement is based on local error estimation where x~[ is compared to locally refined solutions keeping x~ e, U~A and W*A'e at their current optimal values. In particular error tests are performed at the midpoints of the current mesh associated to A~. The error tests require the solution of equation systems of size nx for each midpoint. At first glance this seems to be a substantial numerical effort. But one has to realize that the local solutions are computed by solving a sequence of decoupled equation systems of relatively small size. This is obviously much cheaper than resolving the complete refined optimization problem. The local error estimates are then checked if they satisfy error bounds which depend uniquely on the approximation quality of z~, u~, w~. Regions where the error bounds are violated are locally refined with appropriate trial functions whose indices are collected in the refinement set F eX" R e f i n e m e n t of u n k n o w n i n p u t s w: The central idea for an improved approximation of w is to evaluate gradients of the Lagrange functional s "= OA + ,kTfa + ttTcA + V~g A+~/~eAof problem P2, where AA, tt h, Vh, ~Th are the associated Lagrange multipliers, with respect to p o t e n t i a l l y n e w trial functions collected in the set II~, and encoded by e their expansion coefficients dw~,iii. Large gradients are taken as an indication to identify parameterization functions of large impact. In particular, the current W~A~is expanded by zero, i. e. w a~ e - d,~ e T ~ h ~ + dw~,ni~n~i eT e i -- 0 Local neighbors of the trial with d~,n functions in A~w~are excellent candidates for for II~ where we require II~w~A A~ = 0. Once the gradients e r i :=
Os
~
Odw,,n,
]~=~e, i - - 1 , . . . , n w
35 101
I~
-e-
.................
,
........
,
.......
scalewise I 10o
10 0 o o ._1
..J
10 -~
i
- B - scalewise I adaptive - e - adaptive accumulated
10 -1
200
400 600 800 number of trial functions
1000
10;20_2 .................................. 10-1
10~ computation time [s]
101
102
Figure 1" Comparison of scale wise vs. adaptive refinement
are computed at the current optimal solution ~ "- {x~~, y~, A~, u~l, v~t, ~7~e} we collect the trial functions associated to the larger absolute gradients in the F~ while the smaller ones are neglected. The directional gradients can be inexpensively evaluated using the adjoint formula (Fletcher, 1987) taking the already computed Lagrange multipliers A~l, tt~e v~ associated to the optimal solution ~ into account. In areas where inequality restrictions are active large gradients might be obtained. Here, refinement might not increase the approximation quality since the active inequalities already bound the solution. However, simple heuristics can be applied which exclude refinement in these areas by analyzing the active inequalities. E l i m i n a t i n g trial functions: The discretization structure of the approximations for x, y, w might change during the cycles of refinement such that we are interested in the elimination of currently unnecessary trial functions in x~, y~, w~. Similar to the previous section, the compression is based on the norm equivalences and the vectors dex, dy, d,~ and are searched for their significant coefficients which are collected in A~ c_ A~, A~ c_ A~, Final algorithm: The refinement algorithm proceeds as follows: (1) Solve problem P2 at A~. (2) Refine z, u by thresholding -+ F~, F~. (3) Estimate discretization error of x~, Y~h and locally refine areas with large errors (4) Perform gradient tests of potential refinement functions for w -+ rw. Check error and gradient tolerances and terminate refinement if satisfied. (5) Compress current approximations x~h, y~, w~ by thresholding --+ ~.~, A~,/~ and define A~z "- A~z, A~ "- A~. (6) Construct a new approximation A~+1 :-- /~etA F t taking interdependencies into account. (7) t~ := t~+ 1, go to 1. Potential savings are illustrated in Figure 1 where a comparison of the outlined adaptive
36 algorithm with respect to uniform (scalewise) discretization is shown. The figure is based on a linear estimation problem generated from nonlinear model equations of an ethylene glycol process. In the adaptive case we start with a non-uniform mesh which has been computed by analysis of the measurement functions as outlined. Adaptive refinement uses less trial functions to obtain similar approximation quality compared to the scalewise approach. The CPU times of the QP solver needed to execute the refinement steps are shown as well. Since the computation time is strongly coupled to the number of trial functions adaptive discretization is more economical, even if one considers the accumulated times. Note, that here, although in principle possible, the computation does not employ a warm start using the previous solution ~ - 1 . 4
Conclusions
We presented a framework which steadily refines the discretization of a dynamic optimization problem starting from an initial coarse grid and suggested a methodology which reuses the current solutions to generate improved discretization meshes. The suggested procedure leads to economic and nonuniform grids on which the optimization problem might be evaluated at less computational expense then on a uniform mesh of comparable accuracy. The approach explores differences in the time-frequency behavior of the solution. Local areas containing low frequencies are parameterized with large step sizes while on the high frequency areas the step size is chosen to be rather fine. Reductions in numerical expense should not be expected if the optimal solution does not reveal local differences in frequency content. The framework is not restricted to estimation problems, it can be applied to other more general dynamic optimization problems including nonlinear model predictive control (MPC) or nonlinear moving horizon estimation (RHE). References Betts, J.T. and W.P. Huffman (1998). Mesh refinement in direct transcription methods for optimal control. Optim. Control Appl. Meth. 19, 1-21. Binder, T., L. Blank, W. Dahmen and W. Marquardt (1998). Towards multiscale dynamic data reconciliation. In: Nonlinear Model Based Process Control (R. Berber and C. Kravaris, Eds.). N ATO-ASI Series. Kluwer. Dordrecht. pp. 623-665. Bock, H.G., M.M. Diehl, D.B. Leineweber and J.P. SchlSder (1999). A direct multiple shooting method for real-time optimization of nonlinear DAE processes. In: Nonlinear Model Predictive Control (F. Allg5wer and A. Zheng, Eds.). Birkh~iuser Verlag. Basel. Dahmen, W. (1997). Wavelet and multiscale methods for operator equations. Acta Numerica pp. 55-228. Fletcher, R. (1987). Practical Methods of Optimization. Wiley-Interscience. Tanartkit, P. and L.T. Biegler (1997). A nested, simultanous approach for dynamic optimization problems- II: The outer problem. Comput. Chem. Eng. 21(12), 1365-1388. Waldraff, W. (1996). Modellgestiitzte Uberwachung und Fiihrung von Fed-Batch-Bioreaktoren. VDI-Fortschrittsbericht, Reihe 8, Nr.592. VDI-Verlag. Diisseldorf.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
37
Numerical Strategies for Optimal Experimental Design for Parameter Identification of Non-Linear Dynamic (Bio-)Chemical Processes Julio R. Banga 1, Karina J. Versyck 2 and Jan F. Van Impe 2 (1) Chemical Engineering Lab, Instituto de Investigaciones Marinas (C.S.I.C.). C/Eduardo Cabello 6, 36208 Vigo (Spain). Fax: +34-986-292.762, e-mail:
[email protected] (2) BioTeC - Bioprocess Technology and Control, Department of Food and Microbial Technology. Katholieke Universiteit Leuven, Kardinaal Mercierlaan 92, B-3001 Leuven (Belgium). Fax: +32-1632.19.60, e-mail:
[email protected],
[email protected]
1. A B S T R A C T The problem of optimal experimental design (OED) for parameter estimation of non-linear dynamic systems is considered. It is shown how this problem can be formulated as a dynamic optimization (optimal control) problem where the performance index is usually a scalar function of the Fisher information matrix. Numerical solutions can be obtained using direct methods, which transform the original problem into a non-linear programming (NLP) problem via discretizations. However, due to the frequent non-smoothness of the cost functions, the use of gradient-based methods to solve this NLP might lead to local solutions. Stochastic methods of global optimization are suggested as robust alternatives. A case study considering the OED for parameter estimation in a fed-batch bioreactor is used to illustrate the performance and advantages of two selected stochastic algorithms.
2. I N T R O D U C T I O N Sound mathematical models are the fundamental elements of modern methods in process systems engineering. The development of a model is usually an iterative process which involves two basic steps: designing the model structure, and estimating the model parameters for a given structure from experimental data. Here we will consider this latter task of parameter estimation considering dynamic models of chemical and biochemical processes. These processes are generally described by systems of differential and algebraic equations (DAEs), with the particularity that these models are frequently highly non-linear and stiff. The parameter estimation problem can be formulated as finding the parameter vector p to minimize some norm of the weighted differences between a vector of measured outputs ym(t) and the model predictions y(p,t). Performing experiments to obtain a rich enough set of ym(t) is a costly and time-consuming activity, very especially when considering real industrial units. The purpose of optimal experimental design (OED) is to devise the necessary dynamic experiments in such a way that
38 the parameters are estimated from the resulting experimental data with the best possible statistical quality. The latter is usually a measure of the accuracy and/or decorrelation of the estimated parameters. Although the OED applied to linear steady state models is a well known subject, in the more challenging case of non-linear dynamic models, as those arising from (bio)-chemical processes, fewer references are available (e.g. Munack and Posten, 1989; Lohmann et al, 1992; Baltes et al, 1994; Versyck et al, 1997; Bauer et al, 1999). Mathematically, this OED problem can be formulated as a dynamic optimization (optimal control) problem. The objective is to find a set of time-varying input variables (controls) for the experiments so as the quality of the estimated parameters is optimal in some statistical sense. This optimal control problem is subject to a set of equality constraints (the DAEs describing the system dynamics) and a set of inequality path and/or point constraints on the state variables. These inequality constraints are usually associated with restrictions concerning issues like practical implementation, safety and/or model validity. The cost function reflecting the statistical quality of the parameters is usually constructed as a certain function of the corresponding Fisher information matrix F:
(1)
with between the brackets the sensitivity matrix of the model outputs (in the vector y) with respect to the parameters (in the vector p) and Q the inverse of the measurement error covariance matrix under the assumption that the outputs are corrupted with zero-mean gaussian noise. Thus, the mathematical formulation of the OED problem can be written as: Find u(t) to minimize J = ~(F) subject to f[x,x,p,u,t]=O X(to)- Xo
(2)
h[x,y,p,u,t]= 0
(3),(4)
x L_<x_<x v
g[x, y, p, u, t] _<0
u L
u
(5),(6)
where J is the performance index (cost function), x is the vector of state variables, u the vector of control (input) variables, Eqn. (2) is the system of ordinary-differential equality constraints with its initial conditions, Eqns. (3) and (4) are the equality and inequality algebraic constraints, and Eqns. (5) and (6) are the upper and lower bounds for the state and control variables. The performance index is a scalar function ~(F) of the Fisher information matrix. Examples of common functions are the so-called D-criterion (maximizing the determinant of F), where J =-~V I , which measures the global accuracy of the estimated parameters, and the modified E-criterion (minimizing the condition number of F, i.e. the ratio between the maximum and minimum eigenvalues), where J = A ( F ) = Am.x(F)/Ami.(F ) , which measures the parameter decorrelation. Thus, OED of these processes implies the solution of a class of very challenging non-linear, highly constrained dynamic optimization problems. Besides, additional difficulties may arise due to the non-smooth nature of the abovementioned cost functions.
39 3. S O L U T I O N M E T H O D S Dynamic optimization methods can be classified in two major groups: indirect approaches, based on the minimum principle of Pontryagin, and direct approaches, which transform the original problem into a non-linear programming (NLP) problem via discretization of the control and/or the state variables. In the case of the problem stated above, indirect approaches are not applicable due to the non-differentiable nature of the costs. Thus, one must resort to direct approaches, reducing the problem to the solution of an NLP, either following the control vector parameterization (CVP) strategy (Vassiliadis et al, 1994) or the complete (controls and states, via collocation) parameterization strategy (Cuthrell and Biegler, 1989). In any case, standard gradient-based NLP-solvers may fail to converge, or converge to a local solution, due to the non-smooth and highly non-linear nature of the problem (Barton et al, 1998). In this study, we have followed the CVP approach, where the control variables are approximated by some type of discretization, usually based on low order polynomials (e.g. piecewise constant or piecewise linear). This discretization results in an NLP main problem, where the decision variables are the coefficients used to build the approximation. This main NLP problem requires the solution of the initial value problem formed by Eqns. (2) and (3) for each function evaluation. The most popular methods for solving the NLP are gradientbased local optimization techniques, usually variants of the powerful sequential quadratic programming (SQP) method. But, as already mentioned, since this NLP may be non-convex due to the non-smooth nature of the performance indexes, SQP solvers may converge to local solutions, or even fail to converge. Global optimization techniques are needed in order to surmount these difficulties. The use of stochastic or hybrid stochastic-deterministic methods have been suggested as efficient and robust alternatives for similar difficult optimal control problems (Banga and Seider, 1996). Here, we will apply two stochastic techniques, namely Integrated Controlled Random Search (ICRS) and Differential Evolution (DE), which have been found particularly suitable for this type of problems (Balsa-Canto et al, 1998). ICRS is an adaptive stochastic method developed by Banga and Casares (1987), while DE is a population based method recently presented by Storn and Price (1997). Both methods are very simple to implement and use, which is an important characteristic for many potential users.
4. CASE STUDIES We illustrate the advantages of these strategies considering an important problem in biotechnology: the estimation of kinetic parameters of unstructured microbial growth models. The dynamics of a fed-batch bioreactor where one biomass is growing on one limiting substrate are described by the following model: dCs - - o ( C S )C x -[- Fin (Cs,in -- C S ) dt
dC~ dt
-
g. = ~t(Cs)% --:-:-c~ v
(7) (8)
40
dV dt
--=
Fi,,
(9)
with Cs [g/L] the (volumetric) concentration of limiting substrate, Cx [g DW/L] the biomass concentration, V [L] the volume of the liquid phase, Cs,i,, [g/L] the substrate concentration in the influent with flow rate Fi,, [L/h], cy [g/g DW h] the specific substrate consumption rate and ~t [ l/h] the specific growth rate. These rates are functions of Cs: 1
cr(Cs) -yx~s ~(Cs)+ m
(10)
CS
~z(c~)-lz,,, X,, +C~ +C~/K,
(ll)
with Yx/s [g DW/g] the biomass on substrate yield coefficient and m [g/g DW h] the (overall) specific maintenance demand. Eqn. (11) is known as the non-monotonic Haldane growth kinetics, with parameter Kp [g/L] indicating how fast the optimum for the specific growth rate is reached, and K; [g/L] the inhibition parameter. In this case study, our objective is to estimate parameters Kp and Ki based on measurements of the substrate concentration Cs and the biomass concentration Cx in a fed-batch experiment. The information matrix F (1) can be computed from the sensitivities obtained by solving an extended initial value problem. Values for initial conditions, operating conditions and other model parameters can be found in Versyck et al (1997). The OED problem is formulated as finding the optimal substrate feed rate so as maximum global accuracy and/or parameter decorrelation is obtained, subject to the differential equality constraints (model dynamics, Eqns. 7-11) plus bounds for the control and the states. The following two sub-problems are considered: a) Optimal control for parameter decorrelation" the cost function is the modified E-cost (ratio of the maximum and minimum eigenvalues of matrix F). b) Optimal control for parameter accuracy: the cost function is the D-cost (determinant of matrix F). Preliminary runs indicated that path inequality constraints on Cs must be imposed in order to guarantee model validity. More specifically, wild jumps in the substrate concentration are not acceptable because the condition of balanced growth (which is at the basis of the unstructured growth kinetics considered) would not hold (Roels, 1983). Considering sub-problem (a), it should be noted that the modified E-cost should be as close as possible to 1, which corresponds to a situation of complete decorrelation. Versyck et al (1997) followed a heuristic procedure, based on theoretical analysis of the optimal process performance feed rate profile, to design optimal control inputs which provide the desired complete decorrelation. Here, we started from no a priori assumptions and solved the problem in a purely numerical way. Apart from the stochastic techniques mentioned in the previous section, we also tried to solve the problem by using a deterministic (SQP-based) solver. Many
41 difficulties were encountered by the SQP solver, and in fact convergence failures or convergence to local solutions after excessive computation times were found, in agreement to the reasoning presented above about the non-smoothness of the cost function. In contrast, the stochastic solvers arrived to very good solutions (cost functions close to 1 within a tolerance of 10-5 in most cases) in very reasonable computation times (order of minutes in a PC Pentium-II). These solutions, which in this case we know are globally optimal, agree quite well with those of Versyck et al (1997). For example, Figure 1 shows the optimal feed rate found by these authors, while those obtained with the stochastic methods are presented in Figure 2 (for the particular case of fixed tf = 86.3 h and Cs(O)= 38.4 g/L).
,
........
,
0.1
0.25
,
,
....
~
~
0.08
El
0.2
2" "1 ~.0.15
~
0.06
u.
0.04
,...., t---
._ LL
0.1
ICRS 0.02
0.05
0
..... 0
I
........
20
40
time [h]
6'o
80
0
1oo
o
2'0
4'o
time [h]
60
8'0
,oo
Figure 2.- Optimal feed rates obtained with ICRS and DE for subproblem (a)
Figure 1.- Optimal feed rate by Versyck et al (1997) for subproblem (a)
Considering sub-problem (b), the determinant of F must be maximized. There is no a priori knowledge about the globally optimal value for this cost function, so we have to limit ourselves to compare the solutions obtained by the different stochastic solvers and the heuristic solution obtained by Versyck et al (1997). These authors obtained a D-cost of IF1= 2.2143-10 , with Cs(O) = 68.5 g/L and tf 218 h. Here, the problem was solved for TM
-
-
several time horizons with the different solvers. In this way, a compromise between statistical quality and process time can be reached by using the results as a pareto-optimal response curve. In agreement with the previous results, the SQP-based deterministic solver failed to arrive to good solutions. In contrast, the ICRS stochastic method arrived to a better value of IF[ = 1.9770.1016 for a shorter process time of 86.3 h and Cs(O) = 38.1 g/L. The DE method clearly outperformed the ICRS method in this sub-problem, arriving to a value of 2.7155.10 , with Cs(O) = 31.7 g/L and the same process time.
IFI
TM
When considering the optimization results obtained for sub-problem (b) with respect to the modified-E-cost in (a), and vice versa, it should be noted that the minimization of either cost function is at the expense of the alternative cost. For example, the best solution (obtained by DE) for subproblem (b) yields a modified E-cost of 5.1580.1011. This confirms the results reported for heuristic solution procedures in Versyck and Van Impe (1998). Current research focuses on the stochastic optimization of a novel cost combining both criteria in a weighted sum. As such, a trade-off between the two parameter estimation quality measures is aimed at.
42
5. C O N C L U S I O N S In this contribution, we compared several numerical strategies for solving two optimal experimental design problems in the context of parameter estimation for (bio-)chemical process models. The stochastic global optimization methods show the best performance in terms of the criterion values and the computational efficiency for these non-linear and highly constrained dynamic optimization problems.
Acknowledgements Author Karina Versyck is a research assistant with the Fund for Scientific Research - Flanders (FWO). The scientific responsibility is assumed by its authors.
REFERENCES Balsa-Canto, E., A. A. Alonso and J. R. Banga (1998). Dynamic optimization of bioprocesses: deterministic and stochastic strategies. In Proceedings of ACoFoP IV, 21-23 Sept., G6teborg. Baltes, M., R. Schneider, C. Sturm and M. Reuss (1994). Optimal experimental design for parameter estimation in unstructured growth models. Biotechnol. Progr. 10:480-488. Banga, J. R. and W. D. Seider (1996). Global optimization of chemical processes using stochastic algorithms. In "State of the Art in Global Optimization", CA Floudas and PM Pardalos (Eds.), p. 563-583. Kluwer Academic Pub., Dordrecht. Banga, J. R. and J . J. Casares (1987). Integrated Controlled Random Search: application to a wastewater treatment plant model. IChemE Symp. Ser. 100,183-192. Barton, P. I., R. J. Allgor, W. F. Feehery and S. Galan (1998). Dynamic optimization in a discontinuous world. Ind. Eng. Chem. Res., 37:966-981. Bauer, I., H. G. Bock, S. K6rkel, and J. P. Schl6der (1999). Numerical methods for initial value problems and derivative generation for DAE models with application to optimum experimental design of chemical processes. In Proc. of Int. Workshop on Scientific Computing in Chemical Engineering, May 26-28, vol. II, TU Hamburg, Germany. Cuthrell, J. E. and L. T. Biegler (1989). Simultaneous optimization and solution methods for batch reactor control profiles. Comput. Chem. Eng., 13:49. Lohmann, Th.W., H. G. Bock and J. P. Schloder (1992). Numerical methods for parameter estimation and optimal experiment design in chemical reaction systems. Ind. Eng. Chem. Res., 31:54-57. Munack, A. and C. Posten (1989). Design of optimal dynamical experiments for parameter estimation. In Proceedings of the American Control Conference, ACC89, Pittsburgh, USA, pp. 2011-2016. Roels, J. A. (1983). "Energetics and kinetics in biotechnology". Elsevier, New York. Storn, R. and Price, K. (1997). Differential Evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11:341-359. Vassiliadis, V. S., R. W. H. Sargent and C. C. Pantelides (1994). Solution of a class of multistage dynamic optimization problems. Part I. Ind. Eng. Chem. Res., 33:2111-2122. Versyck, K. J., J. Claes and J. Van Impe (1997). Practical identification of unstructured growth kinetics by application of optimal experimental design. B iotechnol. Progr., 13:524-531. Versyck, K. J. and J. F. Van Impe (1998). Trade-offs in design of fed-batch experiments for optimal estimation of biokinetic parameters.In Proceedings of the 1998 IEEE Conference on Control Applications, Control Applications in Biological Systems, 51-55, IEEE Catalog Number: 98CH36104 (also on CD-Rom)
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
43
Solution of population balance equations for prediction of particle size distribution in emulsion polymerization: comparison and evaluation of different numerical methods. A.H. Alexopoulos and C. Kiparissides Department of Chemical Engineering and Chemical Process Engineering Research Institute, Aristotle University of Thessaloniki, P.O. Box 472, Thessaloniki, Greece. 1. INTRODUCTION The quantitative description of the development of latex particle size distribution (PSD) in emulsion polymerization reactors is very complex. Important process variables, such as type and concentration of initiator and surfactants, polymerization temperature, and variation of the physical properties of the latex during the polymerization, have been included in a recent mathematical model for predicting the evolution of particle size distribution in emulsion polymerization reactors (Kiparissides et al. 2000). The formation of panicle nuclei can occur by both homogeneous and micellar nucleation mechanisms (Gilbert, 1995). The nucleated particles can subsequently increase in size either by growth due to polymerization or/and coagulation with other particles. The combined action of nucleation, growth, and aggregation determine the evolution of the latex panicle size distribution PSD (Feeney et al. 1984). The evolution of the latex PSD is further complicated due to the strong coupling between reaction kinetics and panicle size during emulsion polymerization. The use of population balance equations (PBE) to describe the development of panicle size distribution in a paniculate process is a well-known method and has been utilized in a diverse range of problems including crystallization, liquid-liquid dispersions, polymerization (Ramkrishna, 1985). The continuous distribution of panicles in an emulsion polymerization reactor is usually described by a number density function n(x,t) which represents the number of panicles within a differential volume size range per unit volume of latex. The rate of change of the panicle number density function is described by a nonlinear integro-differential population balance equation. o~n(x, t) alv (x)n(x, t) c3t + ax = 8 ( x - Xmin)So(t) y=X_Xmin
+-2
y=Xmax
(1)
I I 3 ( y ' x - y ) n ( y , t ) n ( x - y , t ) d y - n(x,t) II3(Y'x)n(y't)dy y=xmin
y=Xmin
where Iv is the particle growth rate, So is the nucleation rate, and 13(x,y) is the aggregation rate kernel between particles of volumes x and y. The numerical solution of the PBE generally requires the discretization of the particle volume domain into a number of elements leading to a usually stiff set of nonlinear differential equations. The application and subsequent solution
44 of the PBE in reacting, and, especially, nucleating systems, is difficult due to the complexity of particle nucleation mechanisms that are often not well-understood or/and the numerical difficulties involved in the solution of PBEs. In this work two different numerical methods, namely, the discretized PBE method of Hounslow et al. (1988) and the orthogonal collocation on finite elements (OCFE) method, are applied for the solution of the particle population balance model (1). A detailed study is carried out to assess the accuracy of the numerical methods and to establish the conditions for the convergence of the numerical solution to the correct PSD. This is accomplished by comparing the numerically calculated PSDs with the corresponding analytical solution for the case of a constant aggregation kernel. 2. NUMERICAL METHODS FOR THE SOLUTION OF PBE 2.1. Discretized Population Balance. The particle size distribution can be determined using a discretized PBE which assumes a constant number density function ni within the size interval "i" such that a particle number density Ni can be defined as:
gi+l (2)
N i = ~ nidW = nii(Wi_,- Vi) =ni--Vi
vi Accordingly, following the developments of Hounslow et al. (1988), one can derive an equivalent to eq. (1) discretized PBE including particle aggregation, growth, and nucleation mechanisms.
I'Ir
'
dN i dt -8(i-1)B(t)+(l+r)V i r2-1Ni-1 + N i - r 2 rNi+l
1 (3)
"~'2"~i_l,i_lNi_ 1 - N i Lj=
2J-i~i,j Nj )"]-~(~i,j Nj j=l
The terms on the right hand side of eq. (3) represent particle nucleation (B=VoS0), growth, generation due to aggregation, and depletion due to aggregation, respectively. Unfortunately, for many problems the geometric discretization of eq. (3) (based on the rule: Vi+l=2Vi) is often inadequate. As a result Lister et al. (1995) proposed a more general discretization method based on the following fractional geometric discretization rule:
Vi+l - V i * 21/q
(4)
where q is an integer greater than one. This approach has been further generalized by Kumar and Ramkrishna (1996) for any type of discretization which guarantees the correct determination of any two moments of the PSD (e.g., zero moment and first moment which correspond to the total number of particles and total particle volume, respectively).
45 2.2. Collocation on Finite Elements The PBE can also be solved in the continuous form (eq. 1) using orthogonal collocation on finite element methods (OCFE) (Gelbard and Seinfeld, 1978; Nickmanis and Hounslow, 1998). The collocation on finite elements was used by Gelbard and Seinfeld (1978) with cubic Hermite basis functions and equally spaced (non-orthogonal) nodes to simplify the "bookkeeping". The method was very successful to the solution of pure aggregation problems and also in the case of a combined growth-aggregation problem. In the collocation on FE method nc collocation points are defined within ne elements and the solution is obtained by an expansion of the unknown number density function in terms of appropriate basis functions over each element. nc+2
(5)
n(x,t) = Y'~n](t) qoj(x) j=l e
,,
where nj indicates the value of n(x,t) at node "j of the element "e" and (pj are Lagrange basis functions. Based on the above discretization procedure eq. (1) can be recast into the following ne(nc+ 1)+2 residual equations: 9e n i
(t)= -
1 +--2
nc~.+2(dq) j "~ j=~l' ~--'~-)
(div 1
i
ns ns
e e e e f f nJ (t)ljlelv(x)- \ dx Ji n i (t) - n i (t) f=l j=l w(j)lJI e 13(xi ,xj )nj (t) nc+2
w(J)lJlgl3(x~ -- xgj'xjg)n~
-- g=l
1 (pfjn
\
+~-
]
ng
(6)
[3(xe - x , xng)n(x)n(x e - x)dx Xlng
where f = map(x~, xjg) is a mapping function indicating the element that the difference xie --xjg belongs to. The last term of eq. (6) corresponds to the "fractional" birth element, 1
ng = map(x~,xl), which is integrated separately. The integrals are determined using GaussLegendre formulas at the node positions xj with weights of wO). The mapping of element e into the integration domain ~ ~[-1,1 ] is described by the Jacobian of the mapping function [Jle The system of equations (6) is closed with two boundary conditions and ne-1 continuity conditions and integrated with respect to time using standard DAE solvers. 2.3. Full-Discrete Simulation Many particulate polymerization processes (e.g., emulsion, dispersion, etc.) at the early stages of reaction can be approximated by a discrete population balance model assuming zero particle growth rate and the simultaneous presence of particle nucleation and aggregation mechanisms. For example, in emulsion polymerization, the precursor-particle model of Feeney et al. (1984), which assumes a homogeneous coagulative nucleation mechanism, can take the following PBE discrete form: 1 i-1
dN~ _ B o S ( i - 1 ) +
ne
~13(i_j,j)Ni_jNj _~[3(i,j)NiN j
(7)
46 The above full-discrete model (Hidy, 1965) assumes that particles of a specific size consist of i-multiples of a unit size corresponding to the particle nucleus. This approach allows the use of realistic aggregation kernels and nucleation rates although, due to the computational burden, its application is limited to small domain sizes. Furthermore, it can not account for particle growth. 3. R E S U L T S In Figure 1 the accuracy of the collocation and discretized PBE methods is shown. Both numerical solutions are compared to the analytical solution n(x)=N0/V0e 2v/v~247 where "c is a dimensionless integration time (x=130N0t) and 130 and No denote the characteristic aggregation kernel and particle number, respectively. As can be seen the OCFE method produces accurate PSDs even for extended particle aggregation times provided that sufficient collocation points are used. The OCFE method requires more computation time than the discretized PBE method but it is more accurate than the latter, especially, at larger particle diameters (see Fig. 1b "c=10). The solution of the combined nucleation and aggregation problem did not present any difficulties for the discretized PBE method except for the case of kernels promoting small to small particle aggregation. The numerical solutions of the PBEs were assessed by a direct comparison with the solution obtained by the full-discrete model. In Figure 2 the full-discrete method is compared with the discretized PBE solution for a Brownian kernel with a dimensionless nucleation rate of B0/130N0=10-3. The PSD peak positions were produced accurately despite the observed numerical dispersion of the PSD. In Figure 3 it is shown that in the presence of an initial seed (Fig. 3a) the solution obtained with the discretized PBE method is smoother and presents fewer numerical difficulties. Figure 4 shows that PSDs which include nucleation, growth, and aggregation can develop a "secondary nucleation" at a time that depends on the dimensionless nucleation rate (Fig. 4b). After the "secondary nucleation" the small diameter distribution converges to a steady state as with the Brownian aggregation case shows in Fig. 3a. This behavior is a result of a dynamic balance between nucleation and aggregation of small with the larger particles in the PSD (Sathyagal and McCormick, 1998). |
'~
x =0
1
Analytical
_,
c)
x=0
z z
0.1!
-- " "
",
Numerical
z o" .,..,
x=l
x~
E
0.01-
1E-3
~= 1 E - 3 -
IE-4
"~
'
'
''""1
'
'
''""l
1.0 10.0 Volume Ratio, V/Vo
'
'
"
.
.
100.0
.
.
Numerical - ~-
%
/ I :1oo
1E-4 -!
z 1E-5
, x=l
0.01
z
Analytical
0.l-
\
-.
1E-5 . .
.
0.
'"l
'
'
''""l
1.0 10.0 Volume Ratio,V/Vo
'
'
'
..... 100.0
Fig. 1. Simulation of a PSD undergoing only aggregation. Comparison between analytical and numerical solutions" (a) Collocation on FE (ne=10,nc=4); (b) Discretized PBE (q=2).
47
0.1 o
0.01 -
y
~ 1
x=100
[
~
o
x=200 x=300
1E-3 -
I
:
0.01 1
Z=100
X
~=20o x:300
1E-3 !
.,-,
.,..,
~
1E-4 -
~-
IE-5 -
>
1E-6 -
x=400
= o
x=400]
1E-4
x=500
x=500 1E-5 o
1E-7
> '
' '''"'1
'
' ' ....
1E-6 1E-7
'1
'
'
'''"'1
10 100 V o l u m e Ratio V / V 0
'
' '''"'1
'
.....
'"
10 100 V o l u m e Ratio V / V o
Fig. 2. Simulation of a PSD undergoing aggregation and nucleation. Comparison between full discrete (a) and discretized (b) PBE solutions. (a) N= 1000 points" (b) ne=20points (q= 1) 1
1
9
o
"
Z
0.1-1
.~
0.01 -~
~:o
~
~=2
Z d
0.01
~
1E-3
1E-3~
~
IE-41
z=100
~
1E-4
~
1E-5
x~ 1 E - 5 ~
.~
1E-6
~ Z
~ Z
1E-7
1E-6 -!
~// \ ~
1E-8
1E-7
. . . . . . . .
I
. . . . . . . .
I
1.0
10.0
Diameter
Ratio, D / D o
~--0.2 x=2.4
"""
x=34 ~
1~~"\
'
X
'
' ' ''"1
~
'
"r=4.6
' ' ''"
. . . .
1
10
100
D i a m e t e r Ratio, D / D o
Fig. 3. Simulation of a PSD undergoing Brownian aggregation and nucleation kinetics. Comparison between (a) seeded and (b) unseeded case. Nucleation rate Bo/13oNo=10 .2 l
o
100.0
--
~=0
--
Z
T=2
Z ._ .,_., r
_
z
0.1~
x=6 T=I0
0.01~
10.0 --= [.,
.,_,
1.0
1E-3~ E
.,-,
Z
IE-4
!
10 Diameter
100 Ratio, D/Do
!
0.1 1E-6
1E-5
IE-4
Dimensionless
1E-3 Nucleation
Fig. 4. PSD evolution with constant aggregation, nucleation, and growth rates. (a) Dimensionless nucleation and growth rates: Bo/13oNo2=10-3, Iv/13oNoVo=l (b) Dimensionless time required for the development of secondary nucleation.
0.01
0.1
Rate So/rioN o2
48 10
><(
6-
N o seed
"F..
t=100 min
8-
E
t=30 min
--i--
~=
t=170
8-
7>
4-
o
"=
t=30 min
~
o
o
t=0 min
,~L
6-
,....
;:>
[ ~(
(.r.,
0
. . . . . 9",,,r,, - ,r",,,r,, v , , r - r , ~
10 100 Diameter Ratio, D/Do
1000
A /
/ ! /
l,
42-
2-
t=100min t=17Omin
eel [.r.,
Seed: 60nm
......
2 ?j
r--'-""'-"-'" r-'" " 10 100 Diameter Ratio, D/Do
1000
Fig. 5. Simulation of the PSD for an emulsion polymerization process. Nuclei size Do=2nm. The discretized PBE was subsequently used to study the behavior of an emulsion polymerization process. The nucleation, growth, and aggregation functions were obtained from an emulsion polymerization model (Kiparissides et al. 2000). The dynamic nature of the polymerization prohibits the formation of the small-diameter "steady-state" discussed above. The mean diameter of the PSD depends on the growth rate and the total amount of nucleated particles while the shape of the PSD is determined by the aggregation kernel (Fig. 5). Different nucleation transients including secondary nucleation were examined and were found to affect mostly the small-diameter portion of the PSD. REFERENCES Kiparissides, C., Achilias, D.S., Fratzikinakis, C., and Samaras, S. 2000. The effect of oxygen on the homogeneous particle nucleation in emulsion polymerization. I & EC. (to be submitted). Feeney, P.J., Napper, D.H., and Gilbert, R.G. 1984. Coagulative Nucleation and Particle Size Distributions in Emulsion Polymerization. Macromolecules, 17, 2520-2529. Gelbard, F. and Seinfeld, J.H. 1978. Numerical solution of the dynamical equation for particulate systems. J. Comp. Phys., 28, 357-375. Gilbert, R.G. 1995. Emulsion Polymerization. Academic Press, London,. Hidy, G.M. 1965. On the theory of the coagulation of noninteracting particles in Brownian Motion. J. Colloid Sci., 20, 123-144. Hounslow, M.J., Ryall, R.L., and Marshall, V.R. 1988. A Discretized Population Balance for Nucleation, Growth, and Aggregation. AIChE J., 34, 1821-1832. Kumar, S. and Ramkrishna, D. 1996. On the Solution of Population Balance Equations by Discretization-I. A Fixed Pivot Technique. Chem. Eng. Sci., 51, 1311-1332. Lister, J.D., Smit, D.J., and Hounslow, M.J. 1995. Adjustable Discretized Population Balance for Growth and Aggregation. AIChE J., 41, 591-603. Nickmanis, M. and Hounslow, M.J. 1998. Finite-Element Methods for Steady-State Population Balance Equations. AIChE J., 44, 2258-2272. Ramkrishna, D. 1985. The Status of Population Balances. Rev. Chem. Eng., 3, 49-95. Sathyagal, A.N. and McCormick, A.V. 1998. Effect of Nucleation Profile on Particle-Size Distribution. AIChE J., 44, 2312-2323.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
49
Solution of the hyperbolic model for heat and mass transfer in packed bed reactors A. A. Iordanidi, A. E. Kronberg, J. A. M. Kuipers and K. R. Westerterp Department of Chemical Engineering, Twente University of Technology, P.O. Box 217, 7500 AE Enschede, The Netherlands 1. INTRODUCTION The importance of packed bed reactors in chemical industry has prompted extensive research on mathematical modeling of such systems. One of the key problems involved is the formulation of conservation equations for the smoothed concentration and temperature profiles in the flowing fluid. The mass and energy balance equations for axi-symmetrical problem and at steady state can be written as: OC 1c3(rjmr ) OT lO(rjhr) ajh ~ u--+-~+ - + - ~ r- J - c3r =Q(C,T) (1) C3Jmx = R t,C, T ), "OCpU -ox & r Or & Ox In order to use these equations to determine concentration and temperature distributions additional relations for the mass and energy dispersion fluxes jmx, jmr, jhx and jhr are needed. The only approach used for practical calculations is to represent the mixing in terms of modified Fick's law of diffusion and Fourier's law of heat conduction:
j.~ =-D~ OC ~ '
J~r =-Dr aC -&r'
Jhx = - K x OT ~x'
OT Jhr = - K r Or
(2a)
where effective dispersion coefficients Dx, Dr, Kx and Kr are used instead of molecular transport parameters. Eqs. (1), (2a), are of parabolic (diffusion) type and together with appropriate boundary conditions constitute standard packed bed reactor model. Its numerous modifications are described in the usual textbooks [1,2]. The capabilities of the standard model are recognized. However, experiments at high reaction rates and in the reactors with low tube to particle diameter ratio demonstrate that the model breaks down [3,4]. This is not unexpected. More surprising is that the model can be made to yield good agreement with experiments in many cases because nearly all packed bed reactor problems violate the requirements for the applicability of Eqs. (2a). The same problems with the gradient transport models are recognized in many other fields of transport phenomena. In particular to overcome drawbacks of the Fourier's law the concept of heat transmission by waves has been introduced [5,6]. Recently the wave (hyperbolic) model for longitudinal dispersion has been derived [7]. Kronberg and Westerterp [8] derived two-dimensional wave model for packed bed reactors similar to that proposed by Stewart [9]. An essential feature of the wave model is that mass and heat dispersion fluxes are taken to be additional to C and T state variables. According to the packed bed wave model the relations between the dispersion fluxes and T and C to be used instead ofEqs. (2a) are [8]: U aim r c3C 0 - rmP)Jmr + "Cm- - ~ = -Dr--, g Ox Or
U Oj,,~ OC 0 - rmP)J~x + rm - ~ = -Dxg Ox Ox'
(2)
50
aT
U ajh r
where
u ajhx
K r --,
0 -- "chB)Jhr + I'h . . . . cox
aT
(1- rhB)Jhx + r h . . . .
Or
P(C,T)=aR(C,T)/aC,
(3)
K x --
e ax
ax'
rm "rh are the model
B(C,T)=(pCp)-laQ(C,T)/aC;
parameters of time dimension. The boundary conditions of the wave model are: X=0"
C=Co,
r=0"
Jmx=0,
Jmr=O,
Jmr=O,
Jhr=O;
T=T
o,
jhx=0
(4)
Jhr=hw(T-Tw)
(5)
Jhr=O,
r=F t " Jmr=O,
Here we assume that pCprhU 2 > Kx and rmU2 >_Dx, otherwise upstream mass and heat transfer are allowed and the boundary conditions over axial coordinate will be different. Note that in this case the wave model - in contrast to the standard model - doesn't require the boundary conditions at the reactor outlet. Fundamental advantages of the new model have been demonstrated [8]. For the calculations of packed bed reactors the new model has never been applied. Since Eqs. (1)-(3) are of the hyperbolic type, their solution requires methods different from those well developed for diffusion-type models. The purpose of this paper is to develop a suitable finite difference method to numerically solve the wave model and to identify some conditions at which predictions of the standard and wave models diverge. 2. N U M E R I C A L A P P R O X I M A T I O N For the numerical approximation of hyperbolic equations method of characteristics is extensively used. The method maximally exploits the properties of the differential equations, converting them to ordinary differential equations [10]. It is particularly convenient if the slopes of characteristics are constant (as in the case of Eqs. (1)-(3)). The main shortcoming of this approach is that to integrate system (1)-(3) along its characteristic curves one must fix the ratio of the radial and the axial integration steps. As a result excessively tiny partitioning determined by the characteristic slopes - may appear in one of the directions. In this section we shall show that the Wendroff's [ 11 ] algorithm adopted to the problem (1)(5) is unconditionally stable, does not depart much from the characteristic method, requires less computer memory and is faster. To derive the scheme we introduce new dependent variables
II1
-
T
-
+
mh T 0
~
Jhx '
Y2 - -
lOC p U T 0
C
Jinx
2.Vh
Jhr
2
pC p U[ o
k2 C
--'-I- - -
uC o /, I"
2Vm C O
where
= [8Kr/[t7~7 p
Vh
r i pCpU2~.h
2
,
1/2,
Vm --
r
~2 T
Y3 -
'
~ I +
2
/ u r2 m 1/2,
o~Dx Wh
2V m C O
_
2
k2 C Z 3 =
uC o
k
2.Vh
i
2 Vh T O
k V m Jmr
Z 2 = - -
ZI=Wmc o
=
A,2 T 2 Vh TO
_
Jhr
[~7,p U [ 0
k V m Jmr "]
2
uC o'
,
2 =VhKx/Kr
Wh =
/K
In terms of the new variables Eqs. (1)-(3) become: aY~
&
=
5(Y~,Zi,r)
,
aZ, __ G , ( y . , Z i , r ) , az
OY2 /l aY2 = F~(Yi , Z,,r) az
az= az
as
,
k aZ2 =G2(Y,.,Zg,r ) , as
aY3 az
k/],
ar, as
= F 3(Yi,Zi,r)
aZ 3 + k aZ 3 = G3 ( y i , Z , , r ) az
as
(6)
(7)
51 where i=1, 2, 3; Fi, a n d Gi are the known functions determined by Eqs. (1)-(3); z = x / r t , s=r/rt; 2 and k determine the directions of heat and concentration wave propagation. Boundary conditions (4), (5) shall be rewritten as
,~2 z = O"
YI = Wh ,
s=0:
Y3=Y2,
k2
Yz = }"3 - Z V h
Z3=Z2;
Z I = Wm
s=l:
Z2=Z 3
Yz=a, Y3-fllTw,
2Vm Zz=Z 3
(8) (9)
where a 1, fll are the known constants. The new variables allow us to treat the first Eqs. of (6) and (7) as ordinary differential equations. They are solved by the second order explicit Runge-Kutta method. A combination of the Wendroff's and the second order Runge-Kutta methods is exploited to solve the second and the third Eqs. of (6) and (7). To derive the finite difference analog of the second equation of (6) we approximate the axial derivative at the n + 89level as the average of the derivative at the n and n + 1 levels and the radial derivative at thej + 89level as the average of the derivative at thej and j + 1 levels:
k C~Z J j+l/2
i /n lJ2 \ Os Y j+I/2
n
.,
= -'2
]j+l _(r
L1
Az
-
n1
+
-2
As
(11)
As
Using Eqs. (10) and (11) and auxiliary functions Y~, i = 1, 2, 3; we construct difference scheme: ( r"~ z ) J = ( Y z ) J +nl
. 2Az . l1+- -pp ((Y2)j+I- (Y2)j) + l + p F2(Yi,Zi,I")j+I (12)
(Y2)~ +1 = (Y2)j+I
11 +- pp
Y2,j+,
)j + 1 + p
,Z,,r
+Fz(Y~,Z,,r)j+,
wherej = 0 ... M-l, n = 0 ... N-1 refer to the radial and the axial grid points respectively; As = 1/M, Az = 1/N and p = 3.Az/As. Similar approximation is applied to the second equation of (7). For the third equations of (6) and (7) the derivatives are approximated at the levels n + 89andj 89 The first of Eqs. (12) represents the Euler's method for the corresponding differential equation, therefore we set for the grid functions Yi the same boundary conditions as for Y,: z =0:Y2 = Y3 = A//ZVh ,
s=0"
~ = I72 ,
s = 1" ~ = a l ~ - f l , r w
(13)
The scheme has the local truncation error O(Az 2 +As2). The error is determined by the approximation of the differential operators O/Oz +_ A.O/Os and can not be improved using more accurate integration of the source terms F2,3 and G2,3. Because of coupled boundary conditions (13) Eqs. (12) must be solved simultaneously with the corresponding difference equations for Y3. To do so we shall rewrite them in the form:
=a(Yz)j+l +bj, j E [ 0 , M - 1 ] ; where bj and dj depend on (g)", (Z)"; (Yz)j
(Y3)j = a(Y3)j-1 + d j , j E [ 1 , M ]
(14)
a = - (l-p)/(1 +p), la[ < 1. Running index j from 0 to M - 1 in the first equation of (14) and from M to 1 in the second one we get:
52 ~(a
(Y2)o :aM(y2)M +
M-1
Ybj),
(Y3)M:aM(Y3)o + Z(aJdM-s) 9
j=0
j=0
Together with boundary conditions (13) they give a system of four linear, independent equations for four unknowns. Solution of this system determines the boundary values of Y2.3. Knowing (Y2)Mand (Y3)o we apply Eq. (14)to calculate (Y2,3)j. The same procedure is used to calculate (Y2,3)"+1.Similarly we introduce the grid functions 22,3 and calculate (Z2,3)n+1. Note that Eq. (14) gives the
estimation [(Y2)~+l< 1(I,,2]j+l] +)n+l Klll(Y2)n[]+ K2I(F2)n ]l '
where K1, K2 are positive constants. Similar estimations are valid for all other unknown grid functions. These conditions ensure unconditional stability of the algorithm. Very important properties of the difference scheme as dissipation and phase shifting are discussed in Appendix A. 3. RESULTS For the calculations we use data from [ 12]: dp = 0 . 0 0 9 5 m de = 0.042 m
p=
Cp - 1046 J/(kg K)
To=Tw= 7 4 0 K
L = 0.5 m u = 0.8 rn/s
-AH=278854 J/mole K0=84000 s l
Co = 1.8 m o l e / m 3 c = 0.4
1.12 k g / m 3
E = 1 0 0 k J / ( m o l e K)
Pem, r = 5, Peh, r = 7 Bi = 2.5
R( C, T)=(1-e)Ko C exp(_E/R T) Q(C, 7) : (-AH)R(C, 7) O.l
For simplicity we assume that homogeneous model is valid and put jmx = jhx =0. The latter simplification does not influence much the numerical algorithm whereas it is helpful for the analysis of the two models. We expect larger difference between the diffusion type model and the wave model without these assumptions. The detailed comparison is a subject of the future publications. Comparison of Eqs. (2) and (2a) shows that the difference between the models is determined by the reaction dependent terms rhB(C, 7) and "cmP(C,7/) and the axial derivatives of the radial fluxes. For our calculations we set Az = As = 0.005. For the method of characteristics Az = 0.005, whereas As is determined by the values of'chUMp and rmu/dp. Analysis shows that there is little difference in accuracy between the method of characteristics and the developed method whereas the new method is certainly advantageous from a computational perspective. For example, in the case c, Fig.l, the method of characteristics requires 3-4 times more radial grid points, moreover different meshes are required to solve Eqs (6) and (7) and then interpolation is needed to prepare data for the next step. The developed method does not have these shortcomings and as a result is faster. For the case of rh = rm (interpolation is not needed), the new method is 5 times faster. If rh ;e rm the difference increases. Taking into account that there are 3 independent functions for each balance equation, available computer memory can also be a limiting factor for the characteristic method in case of many components. Figure 1 also shows that the difference between the diffusion and the wave models becomes significant as the relaxation times approach u/dp. This difference becomes crucial for fast reactions when influence of the reaction on transport processes is taken into account, see Fig.2. For the test problem the value of the product rhB(C, T) reaches 0.5 - 0.8 near the hot spot. According to Eqs. (2) this can notably influence the radial fluxes in this region. Finally note that the difference between two models for the problem at hand is determined mainly by the energy conservation equation. The mass distribution for this case is well described by diffusion type model, see Fig. 3.
53
1170
Fig.1. Temperature profiles in the center o f the tube. Influence of the reaction on transport processes is not taken into account i.e. rhB(C, T) = rmP(C, T) = O. a - the diffusion type model; b - the wave model solved by the new method and the method of characteristics ' r,u/d = 0.06 ' r,m u/dp = 0.08"' n p c - the wave model solved by the new method and the method of characteristics, rhu/dp = 0.6, rmu/dp = 0.7; d - the wave model solved by the new method rhu/dp 0 . 8 , Tmu/dp -- 0.6.
1120
i
1070 ~lg
1020 970
/
920 0,,
E
1--
870 820 770
f
720 0
0.2
0.4
0.6
length
dimensionless ~ a
--~--b
0
c
0.8
- ,El-,d
1070
1070 ~"
1020
1020 970
"~
/
/,.,
920 870
E
1--
~
970
~
920
~
870
820
~"
820
770
~.
770
~f
./
i
720
720 0
0.2
0.4
dimensionless A
a
-s
0.6
0.8
length - {3-.c
1
0
0.2
0.4
0.6
0.8
dimensionless length ~ a
~ - -b
Fig.2. Temperature profiles in the center o f the tube. a - the diffusion model; b - rhu/dp = 0.5, rmu/dp = 0 . 5 ; c - Z'hU/dp = 0.06, TmU/dp -- 0 . 0 8 ; .
Fig.3. Temperature profiles in the center o f the tube. a - ThU/dp = 0.06, -Cmu/dp = 0 . 0 8 ; b - rhu/dp = 0.06, TmU/dp = 0 . 5
NOTATION Biot number (:hw dt /(2Kr) Bi concentration in a fluid phase C fluid specific heat per unit mass Cp pellet diameter ap dimensionless axial position Z tube diameter d, effective mass dispersion oefficient D dispersion flux per unit bed area J wall heat transfer coefficient hw effective heat dispersion coefficient K reactor length L heat production Q tube radius rt temperature o f a fluid phase T reaction rate per unit reactor volume R radial position r
Pe Peclet number (--p Cp u dp/Kr or udp/D r s dimensionless radial position u superficial velocity x axial position Greek letters c porosity of the bed p fluid density ~relaxation time Subscripts 0 inlet, at x = 0 h heat m mass r radial w wall x axial
54
REFERENCES 1. G. F. Froment and K. B. Bischoff, Chemical Reactor Analysis and Design, Wiley, New York, 1979. 2. K. R. Westerterp, W. P. M. van Swaaij and A. A. C. M. Beenackers, Chemical Reactor Design and Operation, Wiley, Chichester, 1987. 3. H. Hofmann, Ger. Chem. Eng. 2 (1979) 258-267. 4. M. J. Schwedock, L. C. Windes and W. H. Ray, Chem. Eng. Comm. 78 (1989) 45-71. 5. D. D. Joseph and L. Preziosi, Rev. Modern Phys. 61 (1989) 41-73. 6. I. Mfiller and T. Riggeri, Extended Thermodynamics, (pp. 1-16), Springer, New York, 1993. 7. K. R. Westerterp, V. V. Dil'man and A. E. Kronberg, A.E. Ch.E.J. 41 (1995) 2013-2028. 8. A. E. Kronberg and K. R. Westerterp, Chem. Eng. Sci., 54 (1999) 3977-3993. 9. W. E. Stewart, AIChE Symp. Ser. 61(58) (1965) 61-65. 10. D. C. Wiggert, J. Heat Transfer, February, 35-40 (1977). 11. B. Wendroff, SIAMRev. 3 (1961) 237-242. 12. G. Eigenberger, Chem. Eng. Sci. 27 (1972) 1909-1915. Acknowledgements - The investigation is supported by Dutch Foundation for Chemical Research (STW) with the financial aid from the Dutch Foundation for Science Research (SON). Apendix A. Let us consider some qualitative properties of the exact and numerical solution of the homogeneous equation OF OY --+A--=O ~z ~s The analytical solution exhibits neither damping or amplification of waves nor alteration in the velocity of propagation. Indeed, using the complex Fourier analysis, assume an elementary solution in the form
Y(z,s)= ~~F, exp(Ifl,(s-Az)),
I2=-1
k =-oo
The absolute value of the amplification factor represents the ratio of the amplitude of the kth Fourier component after an axial step Az to its amplitude at the beginning of the step. Yk(z + Az, s) = F k exp(Iflk (s - A(z + Az))) = Yk(z, s) exp(- IAflkAz)= Yk(z,s)~ k . Since [~'kl= [exp(-I2flkaz ~ = 1 no damping or amplification occurs. The Von Newmann analysis of Eqs. (12) shows that for the component (Yk)~ = Fk exp(IffkJAs + Iflknaz) the amplification factor is ~k
(1 + P) + (1 -- p)exp(//~kSsl = (1 - p) + (1 + p)exp(I/3kAs)
(15)
and I~kl= 1, This it means that the numerical method does not introduce any dissipation or growth. The phase error can be expressed in terms of real and imaginary parts of amplification factor 9tg(q~k) = Im(~k)/Re(~k) 9For the analytical solution it gives q~ = flkAAz = flkpAs. Whereas the numerical amplification factor (15) gives 2p sin(/~kAs)
tg(~k)= O_ pz)+ O + pZ)cos(BkAs) " Obviously the difference approximation has a phase error A~bk = ~bk - ~bk unless p ~ 1. The error vanishes when As ---y0. If p = 1 the method is reduced to the method of characteristics.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
55
Moving finite difference method for tracking a shock or steep moving front Y. I. Lira, S. H. Jeong*, J. M. Le Lann, and X. Joulia ~ Laboratoire de G6nie Chimique (LGC, UMR-CNRS 5503), INPT-ENSIGC 18 Chemin de la loge, F-31078 Toulouse, France *International Cooperation Laboratory (ARC & INPT-ENSIGC) For tracking a shock or steep moving front in the convective Partial Differential Algebraic Equations (PDAEs), some spatial discretization methods such as central, upwinding, Essentially Non-Oscillatory (ENO) and Weighted Essentially Non-Oscillatory (WENO) schemes, and the moving grid techniques are examined respectively and simultaneously with regards to accuracy, temporal performance and stability. The uniform fixed-grid method is efficient owing to relatively short CPU time. However, the solution of the Fixed Stencil (FS) approach such as the central and upwinding spatial discretization methods is unstable. Many mesh points are needed for all of the fixed grid methods to obtain enough solution accuracy. In the moving grid techniques, stability of the solution is enhanced even at small mesh numbers but it is prohibitive because of the addition of a complex and nonlinear mesh equation to solved PDAEs. The combination of the ENO/WENO schemes (based on an adaptive stencil idea) with moving grid techniques gives a stable and accurate solution even at small mesh numbers and is efficient to track a moving shock front.
1. Introduction The numerical study of Partial Differential Equations (PDEs) whose solutions display steep moving fronts has demonstrated the need for numerical solution procedures with space adaptation. For solutions possessing sharp spatial transitions that move (e.g. traveling wave fronts, emerging boundary and interior layer), a grid held fixed for the entire calculation is computationally inefficient since this grid often contains a very large number of nodes (in order to yield a good solution). In such cases, methods which attempt to automatically adjust the size of the space step are likely to be more successful in solving critical regions of high spatial activity. Solving PDEs for heat and mass transfers in chemical engineering problems, a shock or steep moving wave front can appear for the case of convection-dominated packed-bed adsorption and gas-solid catalytic/non-catalytic reactions in a porous solid. It is well-known that moving grid methods and upwinding ENO (Essentially Non-Oscillatory) schemes are two kinds of techniques for tracking the shock or steep wave front in the solution of PDEs. It is expected that their combination should produce more robust methods (Li and Petzold, 1997). Many works have been devoted to the construction of shock capturing schemes on uniform grids, such as TVD (Total Variation Diminishing), MUSCL (Monotonic Upstream centered Schemes for Conservation Laws), ENO (Shu and Osher, 1989) and WENO (Jiang and Shu, 1996). These schemes need enough points to capture the shock or steep wave front, and consequently often put too many points in the area where the solution is very flat and smooth. zTo whom correspondence should be addressed, e-mail:
[email protected], phone: +33 5 6225 2355
56 Moving grid methods (Dorfi and Drury, 1987; Huang et al, 1994), on the other hand, can redistribute the nodes to the area where the solution varies rapidly at each time step in order to gain computational efficiency. During discretization using MOL (Method Of Lines), the most troublesome terms are convection terms that cause instability. The principle of MOL is to separate the space and the time discretizations by approximating all partial derivatives in space. Thus a system of DAEs (Differential and Algebraic Equations) is obtained from PDAEs and their boundary conditions. Although the moving grid method can place enough nodes in the wave front and works very well for a convex flux function and sufficiently smooth initial conditions, there are still some oscillations as well as inaccuracies appearing in the solution of nonconvex flux functions or piecewise initial conditions. Therefore, reliable spatial discretization methods are desirable in moving grid techniques in order to take information about the 1st order derivatives. Furthermore, for multidimensional large PDAEs containing mass, momentum, energy balance and equilibrium equations etc, it is necessary to discretize spatially PDAEs with methods which are stable and accurate even at small numbers of grid points. In this study, moving finite difference methods based on Equidistribution Principle (EP) and accurate shock capturing methods for discretization are tested and analyzed. As an illustration, dynamic simulation of a convection-controlled chromatography column is presented. 2. Spatial discretization of the convection term For the convective conservation laws, the one-dimensional hyperbolic PDE is expressed,
au
af
at
~x
or
ut=-fx
(1)
In the frame of MOL, the convective term, fx, can be discretized by using central, upwinding, ENO or WENO schemes. Here, the upwinding concept is used in the sense that a present value (e.g. ui) is updated by values to the left (e.g. ui-1) when the fluid flows from left to right (namely, the fluid speed, v>0). The central and upwinding schemes are classified as the fixed stencil (FS) approach because the number and the position of used spatial points are fixed at the given accuracy order over the discretization procedure. The first-order upwind scheme (named, FS-upwind-1) well-known as the 2-point backward method gives very stable solutions but poor accuracy because of many truncation errors: fxm(fi-fi-1)/(xi-xi-1) (2) The second-order central scheme (named, FS-central-2) is used commonly for the discretization in fixed and moving grid methods: fx--(fi+ 1-fi - 1)/(Xi+ 1-Xi-1) (3) In general, the FS approach may not be adequate near discontinuities or steep fronts because of oscillations (termed the Gibbs Phenomena), which motivates the idea of the adaptive stencil (AS). In order to avoid numerical dissipation in a discretized cell i, the convective term, fx, is newly defined in conservative form, e.g. fx= 2(f/+,/2- Z-,/2)
(4)
Xi+ 1 - - X i _ 1
where fj+l~2is called the numerical flux. The ENO and WENO schemes, which use the AS and the upwind ideas, are uniformly high-order accurate right up to the discontinuity. They achieve this effect by adaptively choosing the stencil based on the absolute values of divided differences (DDi). For the lSt-order divided differences, DDr is defined as follows:
57
--(I),
DDi+,, 2 =(fi+1-fi)/(Xi+ 1-Xi)
(5)
A smaller DDi implies the function is smoother in that stencil. Thus, the one with a smaller absolute value is picked by comparing the two relevant divided differences. In the 2nd-order ENO scheme (named, ENO-Roe-2), if ID/)i+)/21>]D1)j_,/2,1 '
~(1)
'
~(l)
DD~)I/2 is picked and then the
numerical flux is for the positive flow speed (v>0)"
~(2) =fi+ DD[~),,2 "(Xi-Xi-1)/2
(6)
i+l/2
Otherwise, ~(2) =fi+ D/~+),2 .(xi+)-xi)12 ,+,~2
-,-- ( 1 )
,
(7)
In this study, the upwind idea used in the AS approach is achieved by the Roe scheme (Roe, 198 I) where the numerical flux is differently defined according to the flow speed signs (v>0 or v<0). One of the efficient ENO schemes, PHM-REF (Piecewise Hyperbolic Method based on Roe Entropy-Fix correction named by ENO-PHM-3; Marquina, 1994) and two WENO schemes (named, WENO-Roe-3 and 5; Jiang and Shu, 1996) are also tested with the convective adsorption column containing a moving shock front. 3. Moving mesh PDE (MMPDE) Under the moving grid techniques, an additional convective term (Ux) from the Lagrangian description (Dorfi & Drury, 1987) appears in the equation (1). 0u =u- Ux /~=-fx (8) at where, u and /~denote ordinary derivatives of u and x with respect to time (t). The stable and accurate discretization method is thus needed for u,, and f,, that may cause instability to the numerical solution. Moving grid techniques based on EP (Equidistribution Principle) move the grid continuously in the space-time domain, using a monitor function, M(x,t), which means that for 0.0<x(~,t)
,,,(~,t)
i Lo
~0.0 M(x,t)d~=~- ~)0M(x,t)d~=~0(t), i=l, N
(9)
where N denotes the number of grids. The computational coordinate (~=i/N) transforms the nonuniform physical mesh (xi) into a uniform computational grid (~i). From equation (9), one can obtain various mesh equations involving node speeds, so-called MMPDEs (Moving Mesh PDEs; Huang et al, 1994) that are employed to move a mesh having a fixed number of nodes in such a way that the nodes remain concentrated in regions of rapid variation of the solution. The mesh equation and the original PDEs are generally solved simultaneously for the physical solution and the grid. The MMPDE4 proposed by Huang et al (1994) is described:
(M-0--~)-- - ~-0-~-(M-~)
(10)
The parameter "c is representative of a timescale in order to force the mesh toward equidistribution. Note that this mesh equation is shown to satisfy the no node-crossing 0x condition ( ~ >0). The arclength monitor function (1 St-order derivative monitor function) is described as follows" M(x,t)= 41 + (f~) 2
(11)
where, f~ is the convective term defined above. For most discretization methods, abrupt variations in the mesh will cause a deterioration in the convergence rate and an increase in the error (Huang and Russell, 1997). In this study, the arclength monitor function is locally smoothed, employing some spatial discretization
58 methods (central, upwinding, ENO and WENO schemes) to the convection term discretization. 4. N u m e r i c a l results
As an illustration, numerical experimentation for hyperbolic conservation PDAEs exhibiting the shock moving front from a initial condition is carried out. The DAE system is solved on a Digital Alpha server 4000, using the double precision in the DAE solver DISCo (Sargousse and Le Lann, 1998) at the absolute and relative tolerances < 104. To check the accuracy, the Loo error is measured at each time level: N
s
.... ,-u X com te l x = lU Xi ex c,--U Xi com ute I i=l
The liquid-solid (L-S) adsorption column without diffusion effects is described for onecomponent models as follows:
+
1-e ,6'
L
Cf +V.Cx = o
~Cf -k.(C I -cS)=o
(13)
I
CI
-
K
. C L = 0
where the concentration in fluid phase (CL), the concentration in solid phase (cS), the L-S interface concentration (d), the void fraction (e=0.4), the liquid velocity (v=0.1m/s), the mass transfer coefficient (k=0.0129/s) and the equilibrium constant (K=0.85) are denoted. Indices t and x are used for temporal and spatial derivatives. The piecewise initial step-input concentration (CL(x,0)) is set at 2.2 mol/1 and the column length (L) is equal to 1.5m. The equation (13) and the MMPDE4 are discretized on a fixed or moving grid by means of some discretization methods such as FS-upwind-1/3, FS-central-2, ENO-Roe-2, ENO-PHM-3 and WENO-Roe-3/5. The temporal smoothing parameter (x) is set at 0.2. In Fig. 1, numerical solutions of the liquid concentration (CL(x,t)) solved on the uniform fixed 200-grid (Ax=l.5/200) are compared along the axial direction (x) at t=10s. As mentioned above, the FS-upwind-1 is stable but inaccurate, while the FS-central-2 and FS-upwind-3 are unstable near the shock. In fact, the FS approach is efficient with regard to temporal performance, but is not reliable on the solution containing a shock or steep moving front. The ENO-Roe-2, which can overcome the drawback of instability, is very stable and relatively accurate. Note that the other AS approaches (ENO-PHM-3 and WENO-Roe-3/5) also show the accurate and stable solution. However, the AS approach is more time consuming than the FS approach. In order to examine relations between accuracy and temporal performance, we introduce the multiobjective concepts (Lim et al, 1999) to simultaneously minimize the L~ error and the CPU time. In Fig. 2, accuracy and temporal performance of the fixed 200-grid is compared with those of the moving 20-grid according to stable spatial discretization methods (FSupwind-1, ENO-Roe-2, ENO-PHM-3 and WENO-Roe-3/5). It is clear that accuracy conflicts with temporal performance and one can choose a compromise discretization method, considering these two criteria. It is worth noting that the ENO-Roe-2 and the WENO-Roe-3 are reasonable in the multiobjective point of view among the considered moving grid methods. The most accurate discretization method under consideration, WENO-Roe-5, and the method consuming the least CPU time, FS-upwind-1, are shown in Fig. 3 on the fixed 200-grid and
59
the moving 20-grid. More accurate spatial discretization methods on the fixed 200-grid also produce more accurate results on the moving 20-grid. 2.5
~-- 2.0 0
g = 1.5
0 .,,-~
, Real Solution = 1.0
FS-upwind- 1
o
-.
0
0.5
~ 9
o.o
-
-*
FS-central-2 FS-upwind-3 ENO-Roe-2
'
I~ 1.0
I
0
0.5
1.5
Axial direction (m)
-0.5
Fig. 1. Comparison of liquid concentration profiles (C L) in the uniform fixed-grid method at t= 10s and N-200 along the spatial direction (x). 60 Fixed 200-grid
50
9
rid
, ~ 4O O
E
30
.,..~
~
20
r..) 10 0
r
0
5
"
r
i
i
10
15
20
25
Fxror* 100 ( m * l ~ l / 1 )
Fig. 2. Comparison of accuracy (L= error at t=10s) and temporal performance (CPU time during 30s integration) in the multiobjective point of view (the order of points from the right hand side: FS-upwind- 1--)ENO-Roe-2---~WENO-Roe-3---)ENO-PHM-3---~WENO-Roe-5).
5. Conclusion Even though the mathematical modeling equation and its parameters are well constructed and carefully obtained by experiments, one has to also carefully choose the numerical methods in order to more exactly simulate chemical engineering problems since there could be some undesirable errors on the numerical simulation procedure. Furthermore, temporal performance and stability of numerical methods are considered, in particular, for delicate PDAE systems exhibiting a shock, discontinuity or steep moving front. For tracking the shock or steep moving front, some spatial discretization methods and moving grid techniques were taken into account, respectively and simultaneously. According to the numerical experiments, ENO schemes based on the AS approach give accurate and stable solutions. The moving grid techniques also increase accuracy, stability, as well as the calculation time at even small grid numbers. The moving grid with the AS approach can track
60 more accurately the shock or steep front in a stable manner than the commonly used FS fixed grid methods (e.g. FS-upwind-1 and FS-central-2). However, since accuracy conflicts with temporal performance, it is necessary to select a compromise discretization method between the two conflicting criteria. There are many user-selectable elements (rather than tuning parameters) in moving grid techniques. Hence it is desirable to select suitable elements, depending on the problem. This work is a part of the project relevant to PDAE solution techniques, which should be in the nearest future included in the object-oriented numerical kernel DISCo for dynamic simulation. Real solution 2.5
~
Fixed 200-grid with FS-upwind- 1 Fixed 200-grid with WENO-Roe-5
~ 2.0
Moving 20-grid with FS-upwind- 1 Moving 20-grid with WENO-Roe-5
g 1.5
~
1.0
8 .~0.5
0.0
,
0.0
t
0.5
,
-
1.0
1.5
Axial direction (m)
Fig. 3. Numerical solution comparison of the convective adsorption problem.
Reference
Dorfi, E. A. and L. O'C. Drury, Simple adaptive grids for 1-D initial value problems, J. Comput. Phys., 69, p175-195(1987). Huang, W. and R. D. Russell, Analysis of moving mesh partial differential equations with spatial smoothing, SIAM J. Num. Anal., 34, p1106-1126(1997). Huang, W., Y. Ren and R. D. Russell, Moving mesh methods based on moving mesh partial differential equations, J. Comp. Phys., 113, p279-290(1994). Jiang, G. and C. W. Shu, Efficient implementation of weighted ENO schemes, J. Comp. Phy., 126, p202-228(1996). Li, S. and L. Petzold, Moving mesh methods with upwinding schemes for time-dependent PDEs, J. Comput. Phys., 131, p368-377(1997). Lim, Y. I., P. Floquet, X. Joulia & S. D. Kim, Multiobjective optimization in terms of economics and potential environment impact for process design and analysis in chemical process simulator, Ind. Eng. Chem. Res., 38, p4729-4741(1999). Marquina, A., Local piecewise hyperbolic resolution of numerical fluxes for nonlinear scalar conservation laws, SIAM J. Sci. Comput. 15, p892-915(1994). Roe, P. L., Approximation Riemann solvers, parameter vectors, and difference schemes, J. Comput. Phys., 43,357-372(1981). Sargousse, A. and J. M. Le Lann, The stiff DAE solver DISCo, ENSIGC, INP de Toulouse, 1998. Shu, C. W. and S. Osher, Efficient implementation of essentially non-oscillatory shockcapturing schemes II, J. Comp. Phy., 83, p32-78(1989).
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
61
Neural Network in Physical Equilibria Prediction S. Oregki a, J. Zupanb and P. Glavi6 a aFaculty of Chemistry and Chemical Engineering, Smetanova 17, P.O. Box 219, SI-2000 Maribor, Slovenia bNational Institute of Chemistry, Hajdrihova 19, P.O. Box 34-30, SI- 1000 Ljubljana, Slovenia
Abstract In the paper Kohonen neural network as an alternative tool for fast selection of suitable physical property estimation method that is very important for efficient chemical process design and simulation is described. Neural networks should advice appropriate methods of phase equilibrium estimation on the basis of known physical properties. In other words, they should classify objects into none, one or more possible classes (possible methods of phase equilibrium) and estimate the reliability of the proposed classes (adequacy of different methods of phase equilibrium). From among several different artificial neural networks, Kohonen neural networks were chosen as the most appropriate for the specific problem. Probability maps for each specific phase equilibrium method were obtained as a result. The analysis of the results confirmed that the hypothesis to use Kohonen networks for separation of the classes was correct. Keywords: Physical properties; Phase equilibrium; Neural networks; Classification. 1. I N T R O D U C T I O N During the past years, neural networks have become widely used in chemical engineering. First attempts appeared about a decade ago. The application of neural networks in various areas of chemical process engineering, such as fault detection, diagnosis, process control, process design, and process simulation (Hoskins et al., 1988) has been discussed. Later on, a whole book was edited on neural networks for chemical engineers where principal fields of application within chemical engineering like modeling and simulation of complicated processes, process identification and control were represented (Bulsari, 1995). Also some very useful books which make readers acquainted with the basic concepts of networks and possible applications of them have been published (Schuster, 1991; Schuster, 1992; Zupan et al., 1999). Another promising field of application is to use a neural network as a tool for optimization, where neural networks substitute a mathematical solution of a set of complicated partial differential equations (Dong et al., 1996; Calderon et al, 1999; Acufia et al., 1999). In the field of phase equilibria, we can mention the use of neural networks as a part of or complete predictive tool for vapor-liquid-equilibrium using different single phase equilibrium methods (Petersen et al., 1993; Kan et al., 1996; Alvarez et al., 1999). In all the above mentioned fields of application, neural networks have been used for the simulation of complicated systems where the available information was experimental. In this
62 study, we use neural networks as an alternative tool to help an engineer to choose a suitable phase equilibrium method for further process calculation. The physical property estimation method is crucial for good design and simulation of a chemical process. Neural networks are trained with inputs describing several combinations of physical properties associated with the corresponding methods of phase equilibrium. Although many methods of phase equilibrium exist or are appearing day by day, a whole domain of all possible combinations of chemical components, their concentrations, temperatures, and pressures are not covered by them up to now. Our domain consists of a large number of data but, nevertheless, it still does not describe all the possibilities. 2. P R O B L E M C O N S I D E R A T I O N AND NEURAL N E T W O R K M O D E L S E L E C T I O N Artificial neural networks are a set of several different models featuring a wide variety of different architectures, learning strategies and applications. The nature of the problem we are trying to solve determines which neural network will be employed. In our application, three main characteristics could be exposed: a large number of data, the data not describing all the possibilities, and the classification by the neural network. A large number of data transformed into objects for training neural networks demands larger neural networks with more neurons and longer time for training. An incomplete domain requires an "unsupervised" approach because all the responses are not available. A neural network should also be able to classify objects into none, one or more classes and not only into one out of several pre-defined (known in advance), existing classes. According to the problem described, a Kohonen neural network was chosen among several different neural networks as one with the most appropriate architecture and learning strategy. Kohonen neural network is a "self-organising" system which is capable to solve unsupervised rather than supervised problems where it is not necessary to know in advance to which cluster or group the training object belongs. It has only one layer of neurons; therefore, the specific input variable, let us say the i-th variable, xi, is always received in all neurons of the neural network by the weights placed at the i-th position of each neuron. If the neurons are presented as columns of weights then all the i-th weights in all the neurons can be regarded as the weights of the i-th level (Zupan et al., 1999). Because neurons in our Kohonen neural networks are ordered in a two-dimensional formation, the layout of neurons is especially important to us as it will be seen later. 3. DATA P R E P R O C E S S I N G From the numerous phase equilibrium methods, we have chosen fifteen of them most often used in practice. They are divided into methods of phase equilibrium which use only equations of state and methods which employ activity coefficients. Among semi-empirical equations of state two cubic ones were chosen, Soave-Redlich-Kwong and Peng-Robinson method. Out of multiparametric equations Benedict-Webb-Rubin, Starling and Lee-Kesler methods were included. The last of the equations of state was the theoretical Virial equation. From activity coefficient methods Margules-1 and Margules-2 methods, slightly more complex Van Laar and complex Wilson, NRTL, UNIQUAC, ASOG and UNIFAC methods were chosen. In the same group there was the Regular Solution Theory, too. The phase equilibrium methods mentioned are known and well represented in the corresponding literature, so they will not be described here again. The data about physical properties
63 represent information describing chemical bonds, structure of the components, working conditions, further calculations desired, accuracy of methods, simplicity and speed of calculations, and data availability. The data collected from the literature and assigned by experts were expressed with objects of the form X = ( y , x l . . . . . X9). The variables Xi are carrying information about physical properties like chemical bonds, working pressure, and temperature of the mixture, etc. For instance, Xl represents chemical bond (xl=l indicates nonpolar mixture of components, x1=2 slightly polar mixture, x1=3 polar, etc). The variable y represents the corresponding method of phase equilibrium out of the fifteen possible. For example, y with the value 1 represents S o a v e R e d l i c h - K w o n g equation of state, y with the value 10 W i l s o n activity coefficient method, etc. To exclude multiple objects and to include possibilities overlooked, several preprocessing steps like sorting, detection and elimination of identical objects, simple object classification were executed. In the improved database each object was represented as a multidimensional vector X=(x~ .... ,x9,yl .... yls) where Xi represented the values of separate physical properties, and the fifteen-target variables yi which also constituted a target vector Y=(yl ..... y15), indicated the methods of phase equilibrium with the values "1" or "0" assigned to the target variable yi when the particular method i seemed to be appropriate or not appropriate for the phase equilibrium, respectively. 4. T R A I N I N G OF N E U R A L N E T W O R K S AND RESULTS After scaling the variables of the vector X, the target vector Y having values 1 to 15 was substituted by "binary" (1/0) variables assigning "1" to a particular method. Similarly, each of the 9 xi variables was substituted by as many "binary" (1/0) variables as it had different values. Altogether the final representation consisting of 41 binary variables (26 and 15 representing 9 different xi variables and a target vector Y, respectively) was obtained. Finally, there were 3780 objects Xs arranged in 41-dimensional vectors in the bank of objects. According to the number of objects, it was estimated that neural networks of size from 50x50 to 60x60 were needed where the place for 2500 to 3600 neurons was available. For the present, several square Kohonen networks of the dimension 50x50 with 41 weights in each neuron were trained at different learning steps (epochs) using competitive learning (the "winner takes it all method") according to the criteria that the winner c is the neuron having the weight vector Wj(Wjl,Wj2 ..... Wjm) most similar to the input signal Xs(xsl,Xs2 .... ,Xs,,): (Xsi -- Wji ) 2
c 6-- m i n
,
j -- 1, 2, ..., n
I. i=1
The index j refers to a particular neuron, n is the number of neurons, m is the number of weights per neuron, and s identifies a particular input. During the training, the correction of all the m (i=1 ..... m) weights on the j-th neuron was carried out according to the following equation: W ji(new) _. W ji(old) Jvq(t)a(dc - d j ~ x s i -w(Old) ) ji The learning rate term q(t) was decreasing linearly between 0.5 at the beginning of the training and 0.01 at the end of it. The triangular neighborhood function a(dc-dj) was used for scaling corrections on neighbor-weights (Zupan, Gasteiger, 1999).
64 When training, we could notice that with increasing number of epochs the number of activated neurons also increased, but errors of learning and the number of conflict situations diminished. Regardless of the prolongation of the training the number of conflicts in any neural network could be diminished below 10 %. When analyzing the conflict situations it was found that almost all of them were associated with activity coefficient methods. In certain regions Kohonen learning proposed a liquid phase when a two-phase vapor/liquid region was expected. Because activity coefficient methods were applicable to the liquid part of the twophase region (the vapor phase was ideal or it was simulated with appropriate equation of state), these conflict situations were not considered as very bad ones. When inspecting several other conflict neurons it was found out that they where activated by the objects Xs which differed mutually only in some values of the basic "no-binary" variable x4 representing the physical property temperature. The difference in only one dimension of the basic ninedimensional objects X was obviously not informative enough to enable the Kohonen neural networks more precise decisions. In Figure 1 the Kohonen map for 50x50 neural network with 41 weights per each neuron obtained after 900 epochs is represented. By request the pictures are uncolored, although colored pictures are much more informative. + 50 49 48 47 46 45 44 43 42 41 40 39
3 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 1 11
8 7 6
3 2 1
+
ILLL L LLLS V VVVVVVVV VVVVV V V VVVV VVVV VVV V VVI IL LLLL L V VV V V VV VVV V V VV VV V VI IL LLL L S V VV VV V VV V VV V V V VV VV V I ILLL L S SVV V V V V VVV VVV V V VV V VVVVVVV VI IL L LL SS VV V V V VV V V V VVV V VV V I IL LLL S V VVV VV VV VV V VVV V V V V VVV VVVVVVI ILL L LL SV V V V V V V V VV VV V V V V VVVI IL LLL S V VVVVVVV VV VV V V V V VVVVVV I IL L L SS V V V VVV VVV VVVV V V VV V VVI ILL LLLS V V V V VV VVV V VV VVV VV V V I ILL L S S S VVV VVVVVV VVVV VVVVV S V V VVVV SSI ILLLLSS SS S VVVV V V VVVV VV VV S SSS V S SI IL S SVV V V VV VV V V V VVSS SS SS SI ILLL S SSSSSS VVV VVV V V V V VVVV S SSS S S SI IL L L S S V VVVVVVV V V VVV SS S I IL L LSL SS V V V V V V V V V V VV SSV VV VSSSS SI IL LLLL S L VV SV VV VS S V VVVV VS S SI IL L LL LSLLL S S SSSSS VVV VSS V V V SVSSI IL L LL L LS LS S S V V VVV V V V VS LI IL LL LLL SL L L L L SSS S V VV VV LI I L L L L L LLS S VV VVVV VVVV S LLLI ILL L LLLL L LL L LL S VV VV VVSS LI I L L L L S L L LLLL LL S SSVVVV VVSSS L I I L LL LS L LL L LLL L S S V VV SS SLL I IL L L LL L L L L L LLL LL SSS VS S L LI ILL L L L L L L LL L L L LLL SSSSSSSS L LI I L L LLL L L L L L LL SSS S SSL LI IL L LL L L L L L L LLLL L SS S LLI IL L L L L L L LL L L L L LLLLL LLL S SS LI ILL L LL L L L L L SL LL SS SSLLI I LL LL L LL L L L L L L SLLLL SS SS L I ILLLL L L LL L L L LL S L L S LL LLI I LL L L L L L L LL LLL SLL LLSI ILSS L L LLLLL LL L LLL L SS L LL I I L S L L L L L LLL LLLSS SS S L SI I LL S L L L L L L LL L LL S LL S SSSS S LI L L L LL L LL S SS SS i ILS L L IL L L LL L L L L L LL L LL LL S S S S L LLI I L L LL L L L L L L SS S S L SI IL L L L L LLLL L L LL L L L S SS LL S SI ILL L L L LL L LL L L L L L L L SSI IL L L L L LL L L L L L LL LL LI ILL L L L L L L SL L L LL LLLL LI IL L L L L L L L L LLL I ILL LL L L L L L L L L L S L LL LI ILL L L L LL L L L L L LL L L LI IL LL LL L LL L L L L L LLLL LL LI I L L L L L L L L L L LLL L LLI I L L L L L L LL L I ILLL L L L LLL L LLLLLLL LL LL L L L L L L L L S L L LLL L LLI + + 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0
Figure i"
Kohonen 50x50x41 map trained with 900 epochs.
65 Although learning was "unsupervised", almost clearly separated clusters can be seen representing homogeneous vapor, heterogeneous vapor/liquid and homogeneous liquid phase regions ('labels' V, S or L respectively). Because of the limitation of the space only one separate target map representing one phase equilibrium method is shown in Figure 2.
50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 ii i0 9 8 7 6 5 4 3 2 1
I 8469 I 8 I I I 18 I 9 I 9 I 199 9 I 9 9 39 198 9999 I99 9 9 9 I889999 76 I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I + 1 2 3 4 5 6 7 8 9 0
6 9
9
9 98
225 98 9 87 95 5 7 5 571 5 9 8
16 4
96 96
4
4
4 291 581 594 7899951 999688 29 99 99997 2
8 7
7997 7 76 9 6 7 7 8 6 9 99 9 7 6 99 3 91 9 9 8 3 199 99 93 3 3 9 9 9 9 9 999 9 9 9 99 3 19 999 95 8 9 9 9 77 1 996 9399 469 9 999 999 99 7 999 59 97 79 9 5 788 769 7 9 9 969 998 2 9 1 9 77 7 7
I I I I I I I I I I I I I I I I I I I
9191 9I 9 I ii I I I I I 1 I 89 I 71 I 8 8 I 919 I 99 I 81 92 I 1 992 1 I 76 88 I 7 I I I 9 I 88 I 7952 I 99 I 5 52 91 1 8 9 9I 8999 99 9I 69 9 95I 69 9 I 6 999 7 7I + 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0
Figure 2" Target map yl represents Soave-Redlich-Kwong method. In each target map, the positions of the activated neurons are exactly the same as the positions of the activated neurons in the Kohonen map. If the separate target map is overlapped with the Kohonen map it can be seen in which areas (vapor, vapor/liquid or liquid) the neurons are activated for the phase equilibrium method defined. The values of weights of activated neurons are scaled between 1 and 9. The neurons with the highest values are the neurons that satisfy the chosen criteria of competitive learning best. With the distance from those central neurons the values of neighbor neurons diminish. As expected the equations of state except the Virial method appear in all the three regions V, S, L (see for example the Soave-RedlichKwong method in Figure 2). The activity coefficient methods appear only in L and S regions. In the different target maps the same neurons can be activated but with different strengths. Such areas represent which phase equilibrium methods are appropriate for certain
66 combinations of physical properties and with what levels of certainty. If in the certain target map the same area is not activated the corresponding method is not appropriate at all. When for separate neurons all fifteen target maps are inspected, an information about adequacy of phase equilibrium methods for particular combinations of physical properties is obtained. 5. CONCLUSIONS AND FUTURE RESEARCH Although Kohonen learning is an "unsupervised procedure" it was able to cluster vapor, liquid and vapor/liquid regions. It can self learn the characteristics and the applicability of the phase equilibrium methods. The trained neural network can estimate the reliability of appropriate phase equilibrium methods. Despite the less precise neural networks that have been trained one can make a conclusion that the hypothesis to use Kohonen network was correct. In future studies all conflict situations should be resolved with an intervention into the bank of objects to improve their informativity. According to the number of objects larger neural networks will be interesting to be trained in order to prevent too many objects to activate the same neuron. With more precise neural networks further sub-clusters inside the clustered homogeneous vapor, homogeneous liquid and heterogeneous vapor/liquid regions are expected. Active neurons are distributed rather evenly through the whole Kohonen map. All the neurons (not only the activated ones) carry the weights trained. Hence, we expect to perceive important data about the missing knowledge in our bank of objects in return. This is an advantage over classical expert systems which, in the best case, can only warn the user against unsolvable situations. REFERENCES Acufia, G., Cubillos, F., Thibault, J., Latrille, E. (1999). Comparison of Methods for Training Grey-Box Neural Network Models. Comput. Chem. Eng. Supp., $561-$564. Alvarez, E., Riverol, C., Correa, J.M., Navaza, J.M. (1999). Design of a Combined Mixing Rule for the Prediction of Vapor-Liquid Equilibria Using Neural Networks. Ind. Eng. Chem. Res., 38, 1706-1711. Bulsari, A.B., (Ed.) (1995). Neural Networks for Chemical Engineers, Amsterdam: Elsevier. Calderon, Z., Espufia, A., Puigjaner, L. (1999). Minimising Waste Generation Using Neural Networks Based Dynamic Optimisation. Comput. Chem. Eng. Supp., $463-$466. Dong, D., McAvoy, J., Zafiriou, E. (1996). Batch-to-Batch Optimization Using Neural Network Models. Ind. Eng. Chem. Res., 35 (7). Hoskins, J.C., Himmelblau, D.M. (1988). Artificial Neural Network Models of Knowledge Representation in Chemical Engineering. Comput. Chem. Eng., 12, 881-890. Kan, P., Lee, C.H. (1996). A Neural Network Model for Prediction of Phase Equilibria in Aqueous Two-Phase Extraction. Ind. Eng. Chem. Res., 35, 2015-2023. Petersen, R., Fredenslund, A., Rasmussen, P. (1994). Artificial Neural Networks as a Predictive Tool for Vapor-Liquid Equilibrium. Computers Chem. engng., 18, $63-$67. Schuster, H. G., (Ed.) (1991). Nonlinear Dynamics and NeuralNetworks. Weinheim: VCH Verlagsgesellschaft, New York, NY: VCH Publishers. Schuster, H. G., (Ed.) (1992). Applications of Neural Networks. Weinheim: VCH Verlagsgesellschaft, New York, NY: VCH Publishers. Zupan, J., Gasteiger, J. (1999). Neural Networks in Chemistry and Drug Design. Weinheim: Wiley- VCH.
European Symposiumon ComputerAidedProcess Engineering- 10 S. Pierucci (Editor) 9 2000ElsevierScienceB.V. All rights reserved.
67
Novel Methods for the Efficient Evaluation of Stored Mathematical Expressions on Vector Computers B.R. Keeping and C.C. Pantelides Centre for Process Systems Engineering, Imperial College of Science, Technology and Medicine, London SW7 2BY, United Kingdom
1. Introduction Equation-based process simulation depends on the evaluation of the residuals and Jacobians of large systems of nonlinear equations. These highly repetitive tasks can represent a major component of the CPU time requirement of the overall solution, both in the steady state case (where a single non-linear system is solved by some form of Newton iteration) and the dynamic case (where a similar system is solved at least once per integration step). It was once common practice to achieve rapid evaluation of the residuals and the analytic entries of the Jacobian by generation of code in a procedural language (usually FORTRAN) for these calculations, which is then compiled and linked with the simulator code to produce a custom executable program specific to the given problem. Thus, the task of achieving high efficiel~cy is transferred to the FORTRAN compiler. However, there are several disadvantages associated with this, including the excessive cost of compilation and linking; the loss of symbolic information that becomes inaccessible to the mathematical solution methods and cannot, therefore, be used for providing full diagnostic information to the user; and the difficulty of handling changes to the form of equations taking place at discontinuities during dynamic simulation (see, for instance, [1]). For all the above reasons, more modern equation-oriented process modelling tools such as OMOLA [2], ASCEND [3] and gPROMS [1], [4] have adopted a different approach, in which the model equations are held in memory using an appropriate data structure such as a binary tree. The latter is then used during the solution phase to evaluate the equation residuals as required. The above approach has several advantages. Model development times are reduced dramatically because of the removal of the compilation and linking steps; the numerical lnethods have access to the full symbolic information available; and dynamic changes to the equation structure become much easier. Moreover, arithmetic errors (such as divisions by zero, square roots of negative numbers etc.) can be captured and reported in a manner meaningful to the user rather than relying on the compiler's exception handling mechanisms. On the other hand, it should be recognised that storage requirements are increased because of the memory required to hold the binary trees. Fortunately, this is not of major significance given the ever increasing availability of memory on modern workstations. In any case, it is counterbalanced by the fact that there is no longer the need for a large residual evaluation code. A more serious drawback is that the time required for the evaluation of residuals is increased because of the overheads associated with traversing the binary trees. This effect is
68 important, especially when one makes the comparison with the highly optimised code generated by most modern FORTRAN compilers. This paper presents an approach to improving the speed of evaluation of expressions stored as binary trees. Section 2 briefly reviews the binary tree representation of algebraic expressions. Section 3 describes an entirely different representation mechanism suitable for vector computers. Finally, Section 4 presents results that demonstrate the substantial efficiency gains that can be achieved by using this alternative representation.
2. Binary tree representation of algebraic expressions The binary tree representation of algebraic expressions is effective because the basic arithmetic operators are binary themselves: thus, our trees will naturally include the multiplication, division, addition, subtraction and exponentiation (raising to a power) operators. Other naturally arising binary operators include max(.,.) and min(.,.). The simplest unary operator, the minus, can be dealt with by introducing a zero left-hand node and using the binary subtraction operator instead. We will also need to handle some more complex unary operators, more often thought of as functions. These include the usual transcendental functions In(.), exp(.), cos(.), sin(.) etc. In the interests of simplicity, we introduce a special 'binary operator', /F, whose left branch contains an integer identifying the function contained while the right branch is the function's argument. Probably the most natural way to carry out the evaluation of an expression represented as a bi~lary tree is a simple recursive algorithm. However, albeit elegant in form, such algorithms require considerable condition testing as well as the function call overheads implied by the use of recursion. An obvious alternative strategy is to carry out the same process as the recursive code, but avoid the actual recursive calls. However, an implementation of this approach (based on that of [5] with simple modifications to handle the function nodes) has shown that this results in no significant acceleration compared with the recursive code. This merely indicates that modern compilers produce near-optimal code for recursive procedure invocations. In the next section we will present an approach to carrying out evaluation of the expressions represented by such trees, which requires a complete alternative representation of the problem, btll [t/l'llS o u t [O be much more suited to vector parallel computation.
3. Operation storage methods In [6] it was shown that significant savings to linear algebra operations in dynamic simulation can sometimes be achieved by creating, storing and executing explicit lists of all arithmetic operations involved in matrix factorisations. In a similar vein, here we investigate the question of whether greater CPU time savings can be made by generating fiat storage structures to represent the operations required for the evaluation of the equation expressions.
Basic concepts We consider a set of equations as a 'forest' of binary trees. We define a leqfloperation to mean one whose operands are both leaf nodes. We can then collect all the leaf operations in the forest into separate lists, one for each type of arithmetic operation (e.g. addition, subtraction, multiplication, division, exponentiation and transcendental functional transformation).
69
In implementing the algorithm, it proves useful to have an additional memory location associated with each node of the tree, which is used to hold the value of the subtree rooted at that node: it is thus referred to as the v a l u e field of the node. When evaluating the residuals of the set of equations, the leaf operations are those that can immediately be executed since their operands are known constants and/or variables. Of course, once a leaf operation is executed, we can view it as a leaf operand itself since its value is now known. We can therefore start considering a second level of 'leaf operations' coral)rising all nodes where e i t h e r both operands were leaf operations in the original forest or one operand was a leaf operation and the other a leaf. All of these second-level leaf operations may be collected into lists analogous to those for the first level. The above procedure may be repeated until all the operator nodes in the original forest have been collected into lists of identical arithmetic operations. The maximum number of lists for any particular type of arithmetic operation is equal to the maximum depth of any binary tree in lhe forest. Once all the lists have been constructed, the set of equation residuals can be computed whenever necessary by evaluating all the elements of the first-level lists, then those in the second-level lists and so on. The representation of the set of algebraic expressions as lists of identical arithmetic operations immediately raises the possibility of vectorised execution of the equation residual evaluations. In particular, we note that each list essentially consists of 3 arrays a, b and c of pointers to real numbers. The latter are simply the V a l u e fields in the nodes of our binary trees. The evaluation of a list of, say, multiplications translates to a loop of the form shown in Figure 3. Here, b { i l and c [ i ] point to the v a l u e fields of the operands of the ith multiplication operation in the list while a[ i ] points to the Value field of its result. FOR
i:=l
a[i] ~
END
to
NumberO :=
fElement
( b [ i ] ~)
*
s InLis t
(c[i]~)
DO ;
Fi~oure 1" Execution of a list of multiplication operations Modern vectorising compilers have no difficulty with vectorising loops involving indirect addressing of the type appearing in Figure 1, provided they are informed explicitly that it is safe to do so.
Generation of operation lists Having described the basic ideas of our approach, we now turn to consider more formally an algorithm for the generation of the operation lists from a forest of equation expressions stored :~s binary trees. This is done by applying a recursive routine to each expression in turn in order to distribute each arithmetic operation in this expression to the appropriate list. The latter will depend (a) on the type of operator involved, and (b) on the height from the bottom of the tree at which the operation occurs I. Alihough, in principle, this algorithm is fairly straightforward, there is a possibility for some optimisation that may result in substantial benefits.
In this context, the height of all leaves in the tree is taken to be zero.
70
This is best explained with an example. Consider the arithmetic expression (x, + x 2 )• (x 3 + x 4) + xj • x s . A direct implementation of the operation lists idea would result in the following lists being generated: 9 l~evel l l i s t s - A d d i t i o n s : z ~ = x ~ + x 2 ; z 2 = x 3 + x 4 M u l t i p l i c a t i o n s : z 3 = x ] •
5
9 Level 2 l i s t s - Additions : NIL
a
9 Level 3 l i s t s - Additions : z,s =
Multiplications :
z 4 = z~ •
Multiplications : NIL
z4 + zs
Here.v are the original problem variables while z indicate intermediate calculation results. In I:he interests of clarity, we only show the additions and multiplications lists; all others are empty (NIL). Now suppose that the above lists are executed on a single vector processor, and that, at each level, we execute first the additions list and then the multiplications one. In this case, we can see that the single multiplication operation that appears in the level 2 list could, in fact, have been carried out at level 1 since the values of both its operands will have already been delermined by the execution of the level 1 additions. Thus, we could envisage a different slrucl:ure which involves two levels only: 9 Level 1 l i s t s - Additions : z~ = x~ +x2; z 2 = x 3 + x 4 m u l t i p l i c a t i o n s : z 3 = x~ xx5; z 4 = z] x z 2 9 Level 2 l i s t s - A d d i t i o n s :
zs
= z4 + zs
Multiplications: NIL
Of course, the above is based on the assumption that additions will always be performed before multiplications. There is really no fundamental reason why this should be so: we could ,just as well choose to execute the multiplications list at each level b e f o r e the corresponding additions list, and this will lead to a different list structure. Our experience, based on 'typical' process engineering problems, indicates that a good evaluation order is F , ^, x , / , +, -. The above considerations are important as the efficiency of the vectorised evaluation code will be higher if we have fewer levels of longer lists rather than more levels of shorter ones. iNUNCTION MinParentLevel(T:BinaryTree; 2 ParentOp:OperatorType) 3 LOCAL Level : INTEGER ; 4 IF T ~ . T y p e = L e a f THEN 5 MinParentLevel := 1 ; 6 7
8 9 i0
ELSE Level
:=
(T~.Left
MAX
( MinParentLevel
, T^.Operator), MinParentLevel (TA.Right, T~.Operator)) ;
ii 12 13 14 15
16 17
AddToList IF
(T ^ , T A . O p e r a t o r , Level) ; EvalOrder(TA.Operator) < EvalOrder(ParentOp) THEN MinParentLevel := L e v e l ;
ELSE MinParentLevel
18 END 19 END 20END
:=
Level
+
1
;
Figure 2 : Algorithm for allocation of binary tree nodes to operation lists With the above in mind, Figure 2 presents an algorithm that takes a given binary tree T and allocates its operations to lists of the appropriate type. The algorithm is i m p l e m e n t e d as a function which returns the m i n i m u m level for the parent node of T. The algorithm of Figure 2 does not actually do anything with leaf nodes, but insists that their parents be allocated to lists of level 1 or higher (line 5). For non-leaf nodes, it seeks to establish the level of list (Level) to which the current node should be added. This is done by referring to its left and right branches (lines 8 and 10), and taking the larger of the m i n i m u m level values dictated by them. Once the correct level for the current node is established, the node's operation is added (via an invocation of procedure AddToList) to the list that corresponds to its type of operator and level (line 11).
71 The rest of the algorithm of Figure 2 is concerned with establishing a minimum level for the parent node of tree T. It does this by comparing the evaluation order Eva-1 Order of the parent's operator to that of its own (see Table 1). If the parent operator has a higher evaluation order than T, then it can be allocated to a list at the same level as T itself (see line 15); otherwise, it must ~o to a list at the next level (line 17)
Vectorised residual evaluation Once the operations lists are constructed, they can be used to evaluate the residuals of all the equations incorporated in them. This can be achieved by a simple loop that processes all the lists for each level in turn, following the choice of evaluation order given earlier. The structure of each of these list processing operations is identical to that of the simple loop presented in Figure 1. We note that the process of evaluating function lists (corresponding to the /F operator) is unlikely to vectorise well given the fact that it may involve transcendental functions of different types; however, this is not a major concern as typical process engineering applications do not involve excessive numbers of such functions. On the other hand the vectorisation of the other evaluation procedures is straightforward and effective. The execution of this evaluation procedure will leave the v a l u e field of the root node of each binary tree containing the correct residual of the corresponding equation. The speed of execution of this algorithm will be influenced by the vector length of the machine for large problems, but also by the maximum height of any tree in the forest, which will determine the number of times the outer loop of needs to be repeated. It is interesting to note that reformulation of the problem (with intermediate quantities being assigned to additional unknowns) could affect the latter.
4. Numerical experiments This section presents some results obtained using two dynamic simulation examples. Problem I involved 84 equations, with the residuals evaluated 14008 times and the Jacobian 3401, while problem 2 was considerably larger with 1809 equations, 23694 residual evaluations and 2639 Jacobian evaluations. l~rob I 1 2 2
Algorithm Resid Jacobian Other CPU CPU CPU Recursive 4.3 1.0 6.0 List 1.2 0.6 6.2 Recursive 335.7 64.0 424.7 List 144.7 23.1 430.7
Table 1" CPU timings for test problems on a SUN UltraSparc 1
Prob 1 1 2 2
Algorithm Resid Jacobian Other CPU CPU CPU Recursive 43.0 9.4 39.6 List 4.6 3.3 39.5 Recursive 1955.7 467.7 1894.4 List 152.1 137.6 1920.4
Table 2: Table 2: CPU timings for test problems on a CRAY J90
Table 1 compares the performance of the recursive and operation list algorithms on a single 1)roces.s'or SUN UltraSparc 1 workstation. It can be seen that the operation list approach is at least twice as fast as the recursive method for both problems. However, an alternative approach presented in [7] shows that for a serial machine, a similar improvement is achievable with greater melnory efficiency. The speed up for Jacobian evaluations is generally similar to that for residuals. On the first problem, it is less noticeable, probably because the equations were largely linear, resulting in very simple Jacobian expressions.
72
Table 2 presents comparative results obtained on a low-end J90 CRAY machine. Comparing lhe acceleration obtained here with that on the Sun machine, we can clearly see that vectorisation is indeed a benefit. Our test problems involve a number of discontinuities which force changes to the form of a subset of the system equations. In the vectorised case, adding or removing a single equation will generally necessitate recalculation of the entire set of operation lists. For example, in problem 2 this occurs no (ewer than 216 times. Nonetheless, because each such recalculation is essentially no more complex than a single original recursive evaluation algorithm, its impact on the overall solution time is not significant. Overall, then, it is reassuring to note that the analysis stages recluired for the new methods have not had a significant effect on total execution time.
5. Concluding remarks This paper has demonstrated that alternative approaches to evaluation of expressions represented as binary trees are well worth considering. These methods can reduce the CPU demands of such evaluation to the point that they are relatively small compared with other costs involved in process simulation (e.g. linear algebra computations). The Jnethod presented for the vectorisation of equation residuals is of particular interest. It has been generally accepted until now that the equations arising from general process engineering models are too diverse to offer significant scope for vectorisation - as opposed, for instance, Io those arising from the discretisation of partial differential equations in computational fluid dynamics applications. Therefore, efforts for the exploitation of novel computer architectures in process simulation have mostly focussed on the use of multiple-instruction multiple-data (MIMD) type machines (see, for instance, [8]). However, as demonstrated in section 3 of this paper, vectorisation is possible provided one is willing to go to a sufficiently fine granularity. Given the extensive symbolic information held by modern equation-based modelling systems, l lais is a relatively straightforward task.
References 1. P.I. Barlon and C. C. Pamelides, Modeling o.fComhined Discrete/Continuous Processes, AICHE Journal, 2. 3. 4. 5. 6. 7.
g.
411. pp. 966-979 (1994) M. Andersson, Discrete Event Modelling and Simulation in Omola, IEEE Symposium on Computer-Aided
Cr162 System Design, Napa, California (1992) P. Picla, ASCEND - An Ol?/ect Oriented Environment /br the Development of Quantitative Models, Ph.D. Thesis. Carnegie Mellon University, Pittsburgh (1989) M. Oh and C. C. Pantelides, Modelling and Simulationfor Combined Lumped and Distributed Parameter 5,)',stems, Comput. chem. Engng., 20, pp. 611-633 (1996) I). J. Hatter, A generalised non-recursive binaw tree traversal algorithm, Computer Journal, 27, pp. 178-184 (1984) F;. R. Keeping, Efficient methods for tlle solution of large systems otdifferential-algebraic equations, Ph.D. Thesis. Universily o1"London (1996) B.R. Keeping and C. C. Pantelides, Novel Methods ti)r the Efficient Evaluation of Stored Mathematical l~:xprcssions on Scalar and Vector Computers, Paper presented at AIChE Annual Meeting, Los Angeles
(1997) .I.R. Paloschi, Steady state process simulation on MIMD machines: solving nonlinear equations, Comput. chem. Engng., 19S, pp. $721 -$728 (1995)
European Symposium on Computer AidedProcessEngineering- 10
S. Pierucci(Editor) 9 2000 ElsevierScienceB.V. All rightsreserved.
73
Global Optimization of Nonconvex Problems with Differential-Algebraic Constraints W i l l i a m R. E s p o s i t o and C h r i s t o d o u l o s A. F l o u d a s Department of Chemical Engineering, Princeton University, Princeton, N.J. 08544-5263,USA Differential-algebraic systems of constraints, in particular, initial value ordinary differential equations, appear in numerous optimization problems in the chemical engineering field. A difficulty in the solution of this formulation which has not been throughly addressed, is the problem of multiple local minima. In this paper, a novel deterministic global optimization method using a sequential approach will be presented.
1. Introduction The solution of optimization problems involving differential-algebraic constraints arises often in the chemical engineering field. Examples include the optimal control of batch and semi-batch processes as well as the determination of kinetic constants from time series data. Difticulties arrise from both numerical and optimization points of view. Two different approaches exist for the solution of the DAE system within the optimization problem. The first approach, referred to as a simultaneous method, involves the complete discretization of the dynamic system. The resulting formulation is algebraic in nature and can be solved using known nonlinear programming methods. A second approach, referred to as a sequential method, involves the solution of the DAE system through an integration routine at each iteration of the local solver. Control parameterization is also used when necessary. In each case, do to the nonconvex nature of formulation, multiple local minima arise. In this paper a deterministic global optimization method using the sequential approach will be presented for the solution of dynamic optimization problems. The method is based on the (~:BB (Adjiman et al., 1998b,a), a branch and bound algorithm for the determination of the global minimuln for twice continuously differentiable NLPs. 1.1. F o r m u l a t i o n
(1)
rain f ( x , v) xv
s.t. z j = g(z,v,~)
j<,]
0 = h(z,v,t)
~(to)
= ~o
t, c
[to, ts]
where z are the state variables, J are the set of states whose derivatives appear explicitly in the system, and 11I is the set of states which appear in the set of point constants P. v C Iv L, v U] are time invariant parameters which appear in the dynamic system, a: C Ix L, x U] are a set algebraic variables which do not appeal in the dynamic system, f (x, v) and c(x) are twice continuously ditTerentiable functions, g(z, v,/.) and h(z, v, t) are twice continuously differential functions with respect to the states, z and the parameters, v. Within (1), the control (if it exists) has already been parameterized by, u = /d(v, t) .
74
2. Global Optimization Approach The proposed approach is based on the oeBB (Adjiman et al., 1998b,a), for twice continuously differentiable problems. Within this branch and bound framework, a sequence of upper bounds on the global solution is obtained by solving the full nonconvex problem to local optimality from multiple starting points. A lower bound is determined by solving a valid convex underestimation of original formulation, e-convergence is obtained by successive subdivision of the original region at each level of the branch and bound tree. A through treatment of deterministic global optimization methods and applications can be found in the recent book by Floudas (2000).
2.1. Convex underestimation The key to the success of the approach is in the ability to generate a valid convex underestimation. The algebraic functions within the formulation (c,~,t,,(x) and f ( x , v)) are underestimated using techniques shown by Adjiman et al. (1998b,a). To underestimate the dynamic part, consider the differential-algebraic system of equations as a simple input-output map.
.+j = g(z, v, t~) j e J v
0 = h(z, v, t)
>
> z(t)
(2)
zj(to) = zo ~ e [to, t~] Pontryagin (1962) showed that under the assumptions given previously, this map is continuous and twice differentiable with respect to the parameters, v. Therefore, the states, z, at given time points, t/,, can be written as twice continuously differentiable functions: z(t,,)
=
a:(t,,v)
-
a:,~(v)
.
(3)
Substituting (3) into (1) results in: rain f ( x , v)
(4)
X~V
~t
~,.(~)+
7~,~(v)
= 0 ,~ c M ~ c p
The underestimator of this term is generated by adding a quadratic function in v
iCI
where I is the set of v variables, and s represents the underestimator of the function 2t-. A simplification of (5) has/3,,.,iL,i equal Vi C I. The value of these/3 parameters needs to be large enough to ensure convexity, but not too large as to overly underestimate the original function. The full convex underestimator takes the form:
rain ~.f(x, v)
(6)
X~V
9
t~. c,,\, ( ~ ) + c , p,
+
..~-rr~,
p,
(v) < o --
~
c~,(~)+c;: m,
t
,
(v) < o --
where 12(:+,,.,, is the underestimator of the function c,,.,l,., 12~.,,,.,L is the underestimator of the function -c:,,,,/, and 12+~m,., 12~-.~,,,, and 12.f are all similarly defined. It is necessary to split the equality point constraints into a positively and a negatively signed inequality, each being underestimated separately.
75
2.2. Determination of fi Parameters The/~ parameters are positive quantities calculated fiom the Hessian matrix of the function This matrix is generated using the second order sensitivities of the state z,,,,, with respect to the parameters v,
S,,,,/,(v).
7-L~,l~
0 2 Z,m
-
O v 2 (tlL)
(7)
.
In the case when the/3 parameters are equal for each variable, their values can be calculated by: /~,,,, t, > - 1/2 min~, ~,,~in '~,i,, (v) (Maranas and Floudas, 1994), where A''~i'~ is the minimum eigenvalue of the Hessian matrix 7-L,,~,z,. The difficulty arises from the fact that 7-L,~,z,,can not be written as an analytical function of v. The elements of the matrix, however, can be determined through an integration of the augmented system at given values of v. As a result of this, three different methods for the determination of/3 values have been developed. ,
,,
,
__
j
" m ~ I z
Constant or Semi-Constant Values: The values used are preselected and can either be a constant or a function of tree level. Sampling Approach: The values of the elements of 7-L are determinable at given values of the parameters v. In each region, a number of random points are selected to evaluate the Hessian matrix and calculate the eigenvalues of these matrices. The minimum of these eigenvalues is then used to calculate the value of/3. Sampling with Interval Calculations: In this approach, the values of each element of ?-L are determined at given values of the parameters, but the eigenvalues of the matrices are not directly determined. Instead, an interval Hessian matrix is generated by determining the minimum and maximum of every element over the sampled set. A valid lower bound on the minimum eigenvalue of this matrix can then by determined using methods presented by Adjiman and Floudas (1996); Adjiman et al. (1998b).
2.3. Illustrative Example In order to illustrate the above concepts, consider the system: =
',, -
z 3,
Z(to)
=
9
tE
[0,1]
(8)
where the control is bounded by ~t C [-5, 5], Consider the value of the state, z, at t = 1, which is an implicit function of the variable u, 2r(u). The first order sensitivity of the state with respect to the parameter, o~ is determined by integrating an additional equation with the one given above (Vassiliadis et al 1994) The second order sensitivity, 02~ is calculated using a finite difference approximation. The minimum of the second order sensitivity is found to be -0.2214. Therefore a/3 value of 0.1107 is needed to generate a convex relaxation of this t\~nction. The original function and the underestimator are plotted in Figure 1. Notice the continuity of the original function, and the convexity of the underestimator.
3. Algorithmic Outline S t e p 1." Initialize the problem:
Set the relative, e~d, or the absolute, e TM convergence tolerance. If a sampling method is being used to calculate the/3 values, set the number of points to use at the first iteration, ])i,,.i~,,z, and the minimum number at each subsequent iteration, pever~j, i t e r = O. S t e p 2." Calculate initial/3 values:
76
1.5 1 0.5 0
A(,
-0.5 -1 -1.5
...~..~'~7~........
......... ~ .....................
-2
. . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
. . . . . . . .
-2.5 -3
-4
-2
0 u
2
4
Figure 1 Function and Underestimator for the Illustrative Example.
A3"~k, ~ -~
A7
k3",7 ~ k4
kl Aj
/k k
\As k(,lk5 A4
Figure 2: Bifunctional Catalyst Reaction Scheme.
Integrate, with second order sensitivity evaluations, the system at f,
4. Example problems The solution of an optimal control problem and a parameter estimation problem are presented to illustration the performance of the algorithm.
4.1. Bifimetional Catalyst Problem This example concerns the optimization of a bifunctional catalyst in converting methylcyclopentane to benzene. The catalyst contains a hydrogenation component and an isomerization component. The objective is to determine the mixture of the two along the length of the reactor
77 which maximizes the concentration of the desired product, At, in the reaction scheme given in Figure 2. The formulation for this problem using a piecewise constant control profile on 10 equally spaced intervals can be found in the in Floudas et al. (1999) and Esposito and Floudas (2000a). The problem exhibits over 300 distinct local solutions. Using 1000 random starting points, only one resulted in the determination of the global solution to the problem. Using 1000 sampling points, the/~ value need for convexity was determined to be 0.0698. The problem was solved using a ,/~ value which started at 0.0698 and was reduced at each level of the tree. A relative convergence tolerance of 0.1% was used. The global solution determined had an objective value of 10.095 • 10 .3 with a control profile of: v = [0.66595, 0.67352, 0.67500, 0.9, 0.9, 0.9, 0.9, 0.9, 0.9, 0.9]. This example illustrates an interesting characteristic of the approach. The algorithm acts as a very effective search to determine the global solution. Initial points for the solution of the original problem are determined by solving a convex relaxation. This relaxation acts to smooth the nonconvex nature of the original formulation, thus supplying starting points which are relatively close to the global solution. Consider in this problem that using 1000 randomly chosen starting points only results in the global solution being identified once. In the proposed approach the global solution was identified in at most 169 iterations and more often less than 100 iterations. Each iteration produces two different starting points for the solution of the upper problem. Therefore, it took no more that 200 points (on average) to find the global solution. This is 5 times better than simply choosing random points. 4.2. Lotka-Voltera Problem This problem involves the estimation of parameters in the predator-prey model used in ecology. The model is described by two differential equations:
dzi
d~, = 0 1 z ~ ( 1 -
z2),
dz2
d~, - 0 2 z 2 ( z ~
-
1),
z 0 - [ 1 . 2 , 1.1],
t C [0, 10]
(9)
where z~ represents the population of the prey, and z2 the population of the predator. The solutions to these equations are cyclic in nature and out of phase with each other. The data used in the study was generated with parameter values of 0 = [3, 1] at 10 equally spaced time points with a small amount of normally distributed random error with o- - 0.01 and zero mean added. The problem is formulated as an error-in-variables estimation problem, and the full formulation appears in Floudas et al. (1999) and Esposito and Floudas (2000b). This problem has been shown to have at least 20 local solutions, with the most prevalent solution being the third best (Esposito and Floudas, 2000a). This problem was solved to global optimality using both of the sampling based approaches. The average and standard deviation of three runs with different numbers of sampled points are shown in Table 1 Notice how increasing the number of sampling points results in less variation within the algorithm. Also, the use of interval methods have been shown to result in looser underestimators. This gives slower convergence to global solution, which is clearly evident in the results. In every case, in spite of the large number of local minima, the global solution was obtained.
5. Conclusions In this paper a deterministic global optimization approach has been presented to address nonconvex problems with differential-algebraic constraints. The proposed method is based on
78
No. of Points
Sampled CPU sec.
l/'"iti('~llS"'<'J
Inter.
25/10 50/25 100/50
123-F 14 145 + 6 152 + 3
331.04+ 56.54 540.04 + 41.50 884.14 + 49.50
Sampled/Interval Inter. CPU sec. 168-F 4 195-+- 3 199-F 2
396.25-+- 20.00 699.73 + 13.24 1119.38-F 10.16
Table 1: Results for the Lotka-Voltera problem. a branch-and-bound fi-amework in which the solution of a convex relaxation is used to generate a valid lower bound on the global solution. Two examples, a parameter estimation problem and an optimal control problem, were presented to illustrate the computation and theoretical aspects.
6. Acknowledgments Financial support from the National Science Foundation is gratefully acknowledged.
References Adjiman C.S., Androulakis I.R, and Floudas C.A., 1998a, A global optimization method, (~BB, for general twice-differentiable NLPs - II. Implementation and computational results. Coral). Chem.. Engng. 22, 1159-1178. Adjiman C.S., Androulakis I.R, Floudas C.A., and Neumaier A., 1998b, A global optimization method, (~(BB, for general twice-differentiable N L P s - I. Theoretical advances. Comp. Chem. Engng. 22, l137-1158. Ac[jiman C.S. and Floudas C.A., 1996, Rigorous convex underestimators for general twicedifferentiable problems. Journal of Global Optimization 9, 23-40. Esposito W.R. and Floudas C.A., 2000a, Deterministic global optimization in nonlinear optimal control problems. Journal of Global Optimiz.ation, Accepted for Publication. Esposito W.R. and Floudas C.A., 2000b, Global optimization for the parameter estimation of differential-algebraic systems. I&EC Res., Accepted for Publication. Floudas C.A., 2000, Deterministic Global Optimiz.ation: Theory, Methods and Applications. Nonconvex Optimization and its Applications, Kluwer Academic Publishers. Floudas C.A., Pardalos RM., Adjiman C.S., Esposito W.R., Gtimti~ Z., Harding S., Klepeis J., Meyer C., and Schweiger C., 1999, Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers. Maranas C.D. and Floudas C., 1994, Global minimum potential energy conformations of small molecules. Journal of Global Optimization 4, 135. Pontryagin L.S., 1962, Ordinal. Differential Equations. Addison-Wesley Publishing Co., Translated from Russian by L. Kacinskas and W. B. Counts. Vassitiadis V.S., Sargent R.W.H., and Pantelides C.C., 1994, Solution of a class of multistage dynamic optimization problems 1. Problems without path constraints. I&EC Res. 33, 21112122.
European Symposiumon Computer Aided Process Engineering- 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
79
Scheduling to Minimize Expected Completion Time in Flowshop Plants with Uncertain Processing Times Jayanth Balasubramanian and Ignacio E. Grossmann* Department of Chemical Engineering, Carnegie Mellon University Pittsburgh, PA 15213, USA Email:
[email protected],
[email protected] Abstract We present a Mixed Integer Linear Programming (MILP) model for the scheduling of flowshop plants with uncertain processing times in order to minimize the expected completion time. The uncertainty in processing times, modeled using discrete probability density functions, results in a combinatorially explosive state-space. Model sizes and solution times increase exponentially with the number of scenarios and mulfiperiod formulations cannot handle even modestly large problems. We use an activity network to represent a schedule, which enables us to derive an analytical expression for the expected completion time. The nonlinear optimization model is reformulated as an MILP using exact linearization techniques to yield rigorous optimal schedules. Numerical results show that the solution times for the proposed method are several orders of magnitude smaller than those for multiperiod models. 1. Introduction Production scheduling is an important area in chemical engineering that has received significant attention over the last few years (Reklaitis, 1991; Pinto and Grossmann, 1998). However, most of the scheduling models that have been developed assume that all the problem data are known in advance. These models are termed deterministic. In reality, however, there can be uncertainty in a number of factors like equipment availability, processing times and costs. Thus, the solutions generated using the deterministic model may not be very helpful. In this paper we address the problem of scheduling flowshop plants for minimum expected completion time given uncertainty in processing times. Uncertainty in processing durations can have undesirable short-term and long-term implications for economics and feasibility. To handle the very large combinatorial state space that arises ~om the discretization of uncertainties into scenarios, we use an analytical approach based on the representation of schedules by directed acyclic graphs. The paper is organized as follows. The first section reviews the relevant literature. This is followed by a definition of the problem ARer a discussion of the schedule representation and the derivation of an expression for the expected completion time, the initial nonlinear optimization model is proposed. Finally, this model is reformulated as a MILP and results fi'om several example problems are presented.
2. Literature Review While there are a large number of publications in the general area of deterministic scheduling problems, there is comparatively little work dealing with uncertainty in processing times. Furthermore, most of this work (stochastic scheduling) has involved restrictions on the number of machines - for example, single-machines (Hamada and Glazebrook, 1993) and the type * Author to whom all correspondence should be addressed.
80
of probability density functions (pdj~), usually exponential, used to represent the processing times. A general overview of stochastic scheduling can be found in Dempster et al. (1982) and Pinedo (1995). In the literature, a rule usually provides the optimal solution for a very specific class of scheduling problems. For example, the longest expected processing time first rule (LEPT) minimizes the expected makespan in the class of non-preemptive static list policies when there are two machines in parallel and the processing times are exponentially distributed (Pinedo, 1995). Although a number of the scheduling rules are based on the expected values of the processing times, rules based on the variance of the processing time distributions also provide optimal solutions in certain cases (Pinedo and Weiss, 1987). A more recent work (Kamburowski, 1999) presents a sufficient condition on the processing time distributions that stochastically minimizes the makespan in two-machine flowshops with unlimited intermediate storage. In the chemical engineering literature, Honkomp et al. (1999) have developed a reactive scheduling framework to deal with uncertainties in processing times and equipment breakdowns in batch processing. The authors use a deterministic MILP optimizer coupled with a Monte Carlo simulator to assess the quality of a schedule over multiple replicates of a simulation. An important consideration is the use of statistical criteria for stopping the replication process. Schmidt and Grossmann (1996) proposed a deterministic continuous-time MILP model for scheduling of tests in the new product development area that can be easily extended as a multiperiod model. Schmidt and Grossmann (1999) also developed a graph-based approach for evaluating the distribution function of the completion time when the durations of the tests are described by delta and polynomial functions. In this paper we use this idea as a basis to selecting an optimal stochastic schedule in flowshop plants. 3. Problem Definition Given are N products (A, B...) and M stages (1, 2 ...M). Each of these products requires processing in all of the M stages and follows the same sequence of operations (i.e. a flowshop plant). All the stages have one machine. The processing time of product i on stage j is a random variable T0. We use discrete (delta) probability density functions to capture the uncertainty in processing times. Using the notation employed by Hsu (1999), the p d f o f the duration of product i in stagej and for ke K scenarios is given by f(~/)= Ec~/k6(t-di/k), where Ciik denotes the probability k and d~k the duration of the k th scenario. The processing times T/j are assumed to be mutually independent and the tlowshop has no intermediate storage between stages (zero-wait). It is also assumed that changeover times can be neglected. The problem is to determine a schedule for the flowshop (i.e. sequence ofjobs) that minimizes the expected completion time. 4. Representation of the schedule The Gantt chart (Figure 1) is one of the common ways of representing a schedule. However, since the task durations are stochastic in nature, we would require different Crantt charts for each scenario. To circumvent this problem we use directed acyclic graphs to represent a schedule, since we are interested in representing a sequence regardless of the actual processing times. It can be seen that the operations in the Gantt chart of Figure 1 can be translated into the activity network shown in Figure 2 (Muth, 1979). The activity network is a directed acyclic graph with the arcs representing the time required to carry out certain activities and the nodes representing points in time at which certain events occur. The horizontal arcs of the network represent the task durations while the vertical arcs represent dummy activities of zero duration.
5. Completion time For the detel~nistic case, the total completion time of the activity network is given by the path in the activity network with the longest total duration. When the task durations ~i are
81
uncertain, and hence not fixed, different paths may possibly define the critical path depending on the particular realization of the task durations. Thus, in order to evaluate the expected completion time, it is necessary to consider all possible paths of the graph. Fortunately, we do not need to consider the entire graph simultaneously as we can use graph-decomposition procedures. Thus, two tasks X l and X2 in series can be replaced by a single task with duration X I +X2 through a convolution operation. Similarly two tasks, X1 and X2, in parallel can be replaced by a single task of duration max (X1, X2) through a maximization operation. A graph is said to be series-parallel if it does not contain the interdictive graph (Valdes, 1978). Hsu (1999) showed that the overall duration of a series-parallel network could be effectively computed through a series of addition and maximization operations. While the activity network representation of the flowshop schedule is not strictly series-parallel, the arcs that potentially give rise to interdictive graphs have zero processing time. The following example illustrates the formulation of an expression for the expected completion time of a flowshop with three products and three stages. For the schedule in Figure 2, the expected completion time is given by, E L 1= E[TA11+E[max (TA2,TBI)1+ E[max (TA3, TB2,TCI)1+ E[max (TB3,TC2)1+ E[Tc3I
(1)
This simplifies to
E[tc]=~`cA~kdA~k+y~`~A2k~cB~k2max(dA2k~dB~k2)+~`~cA3k~B2k2cC~k3max(dA3k~dB2k2~d~k3) k klk2 klk2k3 + ~ ~CB3klcC2k2max(dB3kl,dC2k2)+ ~kCC3kdc3k kl k2 St 1
6 A
St 2
I
5 B 6
4 C [ 5
A
13
C
A
B
St 3
[
~
Time Figure 1: Gantt Chart
T
B
(2)
3
12
Figure 2: ActivityNetwork
6. G e n e r a l F o r m u l a t i o n
The previous section showed how it is possible to develop an analytical expression for the expected completion time of a given schedule, when the pdf of a task is given by delta functions. If the schedule is not fixed, then each of the parameters in the expression for E[tr is a variable and takes on different values depending on the schedule chosen. In this section we derive a general MILP formulation for selecting the optimal schedule with minimum completion time. Let p be the position of the product in the schedule. Let yip be a binary variable that is 1 if product i is processed in the pth position of the schedule. Let/, J and P denote the sets of products, stages and positions respectively. Let Tpj denote a random variable that is a linear combination of the position assignments of the products processing times in stage j. The representation of the scheduling problem for a four-product, two-stage problem is shown in Figure 3.
82 Yip
A
_-.
B
Position 1
Tll
T12
Position 2 Position 3 Position 4
Figure 3: Choosing a sequence for a four-product, two-stage problem. By generalizing (1), the expected completion time is given by, M +N-L
e[,c]= e[~i,]+ Zelm~(r, jvp+ e,j+ a Ip+/= s)]+e[ruMl
(3)
s'-3
Let there be/.,, combinations ofp andj such that p+j=s. Then, for delta functions, (3) yields, E~nax(Zpj )]= Z Z ' " Z CpljlklCp2J2k2 ""Cplsjt~kls "max(dplJlkl'd p2J2k2 ""dplsJlskL, ) (4) kl k2 kts where the probabilities are given by cpjk and the durations by dpik. Expressing these in terms of the 0-1 variables yip as linear combinations of the assignments of the products in the corresponding positions leads to the following, cplJlkl : ECijlkfYipl ..... cplsJz, kl., = Zcijl.,klsYipls and dplJlkl = E d i j l k l Y i p , ..... dplsJlsk, s = EdijlsklsYipls i i i i
(5)
The product Cp~/,kCp:hk~ ...Cp,,i,~k,~ in (4) is as shown below, ~_,E...Eci,,+,%=~, il
i2
<6)
...ci,/,,k,,yi, p~yi2p~ ...yi,,p,,
its
We can specify in (6) that il, i: . . . . iz,. are all different, thereby reducing the number of terms. This is justified because of the assignment constraints. With this, the problem of selecting a sequence of products (i.e. a schedule) to minimize the expected completion time may be posed as follows,
&]-EEc;..<..y;. i
+
k
i
k
~_~"'Z~_.Z"'~_.C,,j,k,C,.hk2""%j,.,k,.Y,2p, Y,.p.."'Y,,~p,..max(d,,j,k,, .... d.~.j,.,..) ~ kI k,=
.'~=3
s.t. Z Yo, =1
kt.~.
iI
i
2
Vp~ e
(Pl)
"
,
Z Ye =1
i
V i ~ l,
Yip ~ {0,1}
p
Using standard linearization techniques for the products of the binary variables (Glover and Woolsey, 1974) and the max terms, (P 1) can be reformulated as the MILP model (P2) shown below. Min E[,cl = E Z CilkdilkYil + E E CiMkaiMkYiN i k +
i k
ZZ...ZEZ...ZCilJIkICi2J2k2
s=3 ~,kI k2 kls i1 i2 sJt. Z Y i p = l i
gp~P
...CilsJlskls~Sklk2...klsili2...il.,.
ils ZYip=l p
Vi+I
Zsili2...il s >_YilPl +Yizp2 +...+yiL,.pl s -(/s-l) Zsili2...ils < Yill~ ..... Zsili2...its < yiL~.pls
Vs, il,i2...ils,Pl,P2 .... Pls,il # i2 4:... r Vs, il,i2...ils,Pl,P2 .... Pls,il * i2 4=... * ils
MAXsklk2...kl s > Z dijlkl Yipl ..... MAXsklk2...kls > Z dijl,,.klsYipl.,. Vs, kl,k2...kls i i
83 [
ZMAXsklk2...klsili2...il s >- MAXsklk2...kl s - U ' ( l - Z s i l i 2 . . . i l s Yip e
)
Vs'il'i2""ils'kl'k2 .... kls,i 1 # i 2 ~ ... ~ ils
{0,1}
(P2)
z,~i2...#, >_o, M~',klk2...kZ~ _>0, ZMAX,klk2...kZ,~I~2...iz~ >_0
Here ZMAX are positive variables used to linearize the products of the Z and MAX variables. The number of variables in this formulation is O(KU.~C+M).(M+N)), where C denotes the combinatorial symbol. It is interesting to note that in contrast to the MILP model (P2), the scheduling problem may also be formulated as a multiperiod MILP model (Balasubramanian and Grossmann, 2000) in which each scenario is replicated by a time period. The main drawback with this approach is that the size of the model increases rapidly since the number of time periods is equal to the number of scenarios. In fact, the number of equations, and the number of variables, is O(KUU.M. N). 7. Results This section focuses on the computational study of the MILP reformulation of the stochastic flowshop-scheduling problerlL Two test problems with different number of products and stages were modeled using the methods of the previous section. The effect of the total number of scenarios on the model size and solution time is compared with those of the multipefiod MILP formulation.
7 a. Example 1 - Four products, Two stages: The results obtained using CPLEX 6.5 on an HP9000/Cl10 to solve (P2) are shown in Table 1. In comparison with the multiperiod model (MMIP), our graph-based MILP reformulation (P2) has a much smaller number of equations and variables, and orders of magnitude smaller solution times. Table 2 presents the results for the (MMIP) models. It is worthwhile to note that the solver cannot even generate the multiperiod model when there are 4 scenarios per task (total number of scenarios 65536) while the graph-based model for the 12-scenarios-per-task case (total scenarios ~ 4.3"108) is solved to optimality in 1 minute. Furthermore, the solution time of the 12-scenarios-per-task graph-based model is two orders of magnitude lesser than the time required to solve the 3-scenarios-per-task multiperiod model. The (MMIP) models' solution was stopped when the relaxation gap was below 10 %. 7 b. Example 2 - Five products, Four stages: The results of the MILP (P2) are shown in Table 3. Once again, the solver is unable to generate the multiperiod models as a result of the size of the fonuulation. However, the graph-based model is solved to optimality even for the case where the total number of scenarios is 3"10 9. As mentioned earlier, the number of equations and variables is O(Ku .(~tC+M).(M + N)). In this problem, M is 4 and hence, even for the case of K=2, the number of variables required is fairly large and comparable to the case of K=12 for the four-product-twostage problerrL Table 1. Results for the Four product, Two stage problem - Graph-based model (P2) K 2 3 4 6 8 12
, ,Scenarios ....... Equations ~, Variables 256 290 214 . 6561 5OO 409 65,536 794 682 1,679,616 1634 1462 16,777,216 2810 2554 429,981,696 6170 5674....
Binaries .
.
.
16 16 16 16 16 16
c P u sec. .......Nodes 0.56 42 1.07 46 1.50 43 3.30 44 9.92 46 42.66 46
84
Table 2. Results for the Four product, Two stage problem - Multiperiod model (MMIP) K 2 3
Scenarios 256 6561
Equations 4617 118107
Variables 4113 104993
Binaries
16 16
CPU sec. 21.81 9903.35
Nodes 1 1
Table 3. Results for the Five product, Four stage problem - Graph-based model (P2) K 2 3
Scenarios 1,048,576 3,486,784,401
Equations 6971 25705
Variables 5770 24788
Binaries
25 25
CPU sec. 47.86 920.00
Nodes 234 238
8. Conclusions The key concept presented in this work is that of an MILP model based on an analytical expression for the expected completion time of a schedule when the task durations are described by delta distributions. The analytical expression was derived from a graph representation of the schedule, which was used as a basis to derive the MILP model. The graph-based models for two example problems were considerably smaller in size when compared with the traditional multiperiod formulations. Furthermore, the solution times for the graph-based models were several orders of magnitude smaller than their multiperiod counterparts. References Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G., Eds. Deterministic and Stochastic Scheduling; D.Reidel: Dordrecht, Holland, 1982 Glover, F.; Woolsey, E.. Oper. Res. 1974, 22, 180. Balasubramanian, J.; Grossmann, LE. Manuscript under preparation 2000. Hamada, T.; Glazebrook, ICD. Oper. Res. 1993, 41,924. Honkomp, S. J.; Mockus, L.; Reklaitis, G. V. Comput. Chem. Eng. 1999, 23, 595. Hsu, A. PD-type functions: Tractable system of probability distribution functions. Workingpaper 1999. Kamburowski, J., Eur. J. Oper. Res. 1999, 112, 304. Muth, E. J., Manage. Sci. 1979, 25, 152. Pinedo, M. Scheduling: Theory, Algorithms, and Systems; Prentice Hall: Englewood Cliffs, NJ, 1995 Pinedo, M.; Weiss, G. Oper. Res. 1987, 35, 884. Pinto, J. M.; Grossmann, I. E. Annals of Operations Research 1998, 81,433. Reklaitis, G. V. Perspectives on scheduling and planning of process operations, presented at the 4th International Symposium on Process Systems Engineering, 1991, Montebello, Canada. Schmidt, C. W.; Grossmann, LE. Ind. Eng. Chem. Res. 1996, 35, 3498. Schmidt, C. W.; Grossmann, I.E., to appear in Eur. J. Oper. Res. 1999. Valdes, J., Ph.D. Thesis, Dept. of Computer Science, Stanford University, Stanford, CA 1978.
European Symposiumon ComputerAidedProcess Engineering- 10 S. Pierucci (Editor) 9 2000 ElsevierScienceB.V. All rights reserved.
85
Automatic Re-Weighting of Maximum Likelihood Functions for Parameter Regression Yu Xin, Victor R. Vasquez, and Wallace B. Whiting Chemical Engineering Division, University of Nevada, Reno, Reno, NV89557-0136 USA An inside-variance estimation method (IVEM) for regression of the kinetic parameters in kinetic models and binary, interaction parameters in thermodynamic models is proposed. The new method substantially improves the model predictions when compared with traditional least squares regression methods.
Introduction Maximum likelihood regression functions are widely used for obtaining parameters of nonlinear models. Classical applications include the estimation of kinetic and thermodynamic model parameters [1,2]. Once the objective function is selected, most strategies include weighting the objective function by pre-selected values, usually are based on experimental error estimates (i.e., standard deviation). When this is done, the regression problem is effectively converted into a traditional weighted least squares minimization. The model parameter estimation process consists of the definition of the objective function and the use of an optimization technique to determine its extremum. Even if the optimization method guarantees finding the minimum or maximum, the parameters obtained are still not the optimal ones if the objective function is not appropriate. To achieve an accurate prediction, the effects of all errors must be incorporated appropriately in the procedure. The focus of this work is on the objective function definition, which is shown to have a substantial impact in defining the optimal parameters for prediction purposes. In this work, we present a method (IVEM) that re-weights automatically the regression function [3,4]. The method requires the same number of constraints as weights being calculated in order to guarantee proper convergence and stability. Some nonlinear regression study cases in the fields of kinetics and thermodynamics are presented to illustrate the method and to show its effectiveness under specific circumstances. The results show substantial improvement in the model predictions when compared with traditional least squares regression methods. We believe that the concepts and methods presented can be extended to solve a wide variety of nonlinear regression problems in chemical engineering.
Inside-Variance Estimation Method (IVEM) The focus of the IVEM technique is on the objective function definition, which automatically reweights the objective function based on variance estimation during the opti-
86
mization process. Traditionally, the vector 0 of unknown parameters in a given model with n measured quantities and m experimental runs is obtained through: min~ ,0
i=t .1=1
where f
(ziJO_~ij)2 "3
s.t.
f(zs 0 ) = 0
(1)
is the model, z is the n x m matrix of experimental measurements, and ~ is the
n x m matrix of estimated "true" values. The assumed standard deviations of the errors, cri ,
apriori,
are set, based on the experimental error. Now, we still assume that we have random normally distributed residuals between measured and true values (assuming no bias error and no modeling error). Then, the likelihood function is defined as:
(zi~176
_lnL = m___nln2~+m ln~o.~ +1 , 2 2 = 2 ~=1j--~
(2)
o'~
where ~ is estimated for each iteration, automatically re-weighting the objective function. Herein lies the difference between traditional approaches and IVEM. Traditional approaches are based on estimation of the experimental precision. Unfortunately, such an approach is internally inconsistent because these estimated o'~ are not (in general) equal to
a priori
the final values obtained from the residuals at the conclusion of the regression procedure. However, IVEM estimates ~ from each iteration in the regression procedure. Thus, at the end of the optimization process, it will guarantee that the most likely values for the O~are found. Kinetics Examples
GeneralCSTRModel: The proposed method was evaluated using simulated measurements for a common chemical engineering system: a steady state, adiabatic CSTR with an irreversible, first-order reaction [5]. The simulation for this system involved five simulated measurements (inlet temperature, outlet temperature, inlet concentration of A, outlet concentrations of A and B), two parameters (ko and E), and three algebraic constraints derived from a differential equation model for the system. The reaction rate constant was expressed as
The IVEM objective function (F) here is defined as:
minF=l- 2yre(As_As} 7 7 22"s~. (TJ-!!}2-+ + 2.=
o"A
.=
o"r
87 where Aj is the outlet concentration of A from run j and Tj is the outlet temperature from run j. The inlet temperature and inlet concentration of,4 were considered to be error-free. The simulated noise-free measurements are considered as the true data. Four different noise levels ((ya=5, Oa=0.05; OT=5, Oa=0.1; Oa=10, era-----0.05; CYT=10,era=0.1) were chosen to create experimental data sets of different precision. To examine qualitatively the goodness of fit for the resulting parameter estimates, plots of outlet concentrations vs. outlet temperature were generated for the four noise levels. Figure 1 shows the fit obtained using the IVEM and the traditional technique at the noise level (oT=10, (YA=0.1). For the traditional technique, we used Equation 1 with oi s equal to those of the chosen noise level. The IVEM results generally follow along the curve representing the noise-free data, labeled "true values." The sum of squared residuals can also be used to estimate the regression result. It is calculated as" m
t
j=l
j=l
where the * denotes the original noise free data. For the four noise levels, the sum of squared residuals are (17.58, 12.66, 5.74, 102.8) from IVEM and (17.57, 12.54, 8.84, 136.9) from the traditional method. Notice that, at the lower noise level, good agreement was found between the traditional method and the new IVEM approach. This shows that when traditional objective functions produce good results, so does the new approach. However at higher noise levels, the parameter set obtained with the new approach produces better results.
Kinetics of the Air Oxidation of l,2-Dichlorobenzene The products of the oxidation of 1,2-dichlorobenzene (o-DCB) are 2,3-dichloromaleic
anhydride (DCMA), 2-chloromaleic anhydride (MCMA), maleic anhydride (MA), and carbon dioxide. 1.0 ..... " 0.9 E <
~
o
estimationby IVEM
x
estimation by traditional o
o.8
9 Traditional o IVEM
4.0
e
|
9
e 2.0
,-
0.7
I
~176
o
8
o
U
0
o
8
-2.0 <
o
'
0
-5
0.6
9
t
~6
8 E
6.0
,o
true values
= measurements
, -4.0
0.5
640
660
680
700
720
740
760
Outlet Temperature (K)
Figure 1. Reconciled data for noise level
(~T=10, (SA=0.1)
~,o
~o
~o
6;o
'
620
Temperture (K)
Figure 2. Error predicted for different regression methods
640
88 The oxidation of o-DCB was studied at temperatures of 285, 300, 320, 330, 340, and 355~ and at different feed flow rates by Atlaly and Alpay[6]. They defined the reaction rate for o-DCB as ro-DCa = kmol o-DCB reacted per second / kg catalyst The overall oxidation scheme of o-DCB considered was: ' 4.5o~" >C4C12Q + 2C02 + 2HzO C6H4CI2 =
(6)
402 )C, HCl03 + 2C02 + HC/ + H20 3%
>C4H203 + 2C02 + 2HCI
6.502
>2HCI + 6C02 + 1120
Reaction rate expressions derived according to this redox mechanism were applied on the basis of the above-mentioned reaction scheme for parallel reactions. The kinetic model considered is represented by the relation ro_ocB =
(kl + k2 + k3 + k4 )Po_DcsksPo 2
(7)
(4.5k, + 4k 2 + 3.5k3 + 6.5k4)Po_Dc8 + ks Po2
where kl, k2, k3, and k4 are kinetic constants for formation reactions of DCMA, MCMA, MA, and CO2, respectively. The IVEM objective function is: m n((ro~ 2 2 2 ) 1 ~'(rMA--rMA)2j minF =-~ 1 -DCS "CrDCMA"Cr~c~ "Cr~ +-~ L , "_~--"
l~(ro + O ~ z . i=1
"- j = l
^ J: + _ I _DCS_--ro-DC,) _2 ()o-DCB
~
2 i=1
OMA
^ )j + _1~" (rDCMA--rDc~ 2
t:rSc~
z_J
2 i-q
(rMCMA_ _- ^rMCMA~
(8)
_2
O MC~
To examine qualitatively the goodness of fit for the resulting parameter estimates, plots of the difference between experimental and predicted reaction rates of o-DCB for different temperatures is shown in Figure 2. It is observed that the predictions made with the IVEM regression approach are substantially better than those from the traditional maximum likelihood method (with t~UA= 6o-DCB= t~DCUA= ~ MCMA),especially at the higher temperatures.
ThermodynamicsExample The inside-variance estimation method coupled with the maximum likelihood method is used for regressing binary interaction parameters of thermodynamic models for liquid-liquid equilibria predictions for a ternary system in this example. The approach to define the objective function is based on the minimization of the distances between experimental and estimated mole fractions. The objective function is defined as:
89
(X[j f(;~-t
minF = 1
Where
+
X~j is the mole fraction of component k in phase i for tie linej.
The main algorithm starts with an initial guess for the parameters, usually taken from the literature. A reasonable first approximation for the parameters is required because a binodal curve has to be generated in order to estimate the mole fractions for each iteration of the regression procedure. If a good initial guess is not available, the regression should be started using an objective function based on the minimization of activity differences, which is less sensitive to the initial guess of the parameters and has a faster convergence [7,8]. One nonlinear regression case using the UNIQUAC activity coefficient model is shown, involving liquid-liquid equilibria predictions for the ternary system methanol + 2-propanol + hexane [9,10]. LLE Methanol(1)-2-Propanol(2)-Hexane(3) at 5~
The equilibrium data used for this system are reported at 5~ [10]. The values of the objective function F resulting from three regression techniques (ASPEN, DECHEMA[9], and I V E M ) are - 2 . 9 7 8 3 , 4.94038 and - 2 0 . 2 8 1 6 separately. For each technique, F is calculated at the stopping point using the r s calculated at that stopping point. The IVEM technique results in a significantly better (i.e. smaller) value of the objective function. Figure 3 presents the experimental and predicted tie lines using the binary interaction parameters reported by S~rensen and Artl [9]. On the other hand, Figure 4 shows the experimental and predicted tie lines using the new regression approach based on the insidevariance estimation method (IVEM). 10
.................. ., .
~,
.
.......
. ...........
Experimental
-DECHEMA --- DECHEMA
~.8 v
~ 8
,6.
Experimental
-._.
IVEM
o c
~ P
6
o
4
"8 6 o ~
4
2
20
40
60
80
1O0
Mole Percent of (3)
Figure 3. Predicted phase diagram with BIPs reported by D E C H E M A
0
0
20
40
60
80
100
MoDe Percent of (3)
Figure 4. Predicted phase diagram with BIPs regressed using IVEM method
90 In general, the accuracy of the tie lines prediction is substantially improved with this new method, and so is the prediction of the phase envelope, in particular for the left phase.
Conclusions A new approach (IVEM) for regressing kinetic parameters in kinetics models and binary interaction parameters in thermodynamic models was developed. The method, based on the maximum likelihood principle, involves the recomputation of the variance for each iteration of the optimization procedure, producing better results than traditional least squares regression procedures. The automatic re-weighting of the objective function always gives more emphasis to those measured quantities with more error in their estimation. It was shown that traditional least squares based methods sometimes overlook the optimum found by the new proposed method, but the IVEM procedure reduces to the traditional regression methods when the latter work well. The improvement in the regression results obtained using the new approach for the objective function allows a better quantification of the kinetic and thermodynamic modeling errors present.
Acknowledgement This work was supported, in part, by U.S. National Science Foundation, grant CTS-9696192.
References: 1. Anderson, T.F., Abrams, D.S. and Grens II, E.A., AIChE Journal, 24 (1978) 20-29. 2. Prausnitz, J.M.,Reid, R.C. and Poling, B.E., The Properties of Gases and Liquids, 4th Edition, McGraw-Hill, New York, USA (1987). 3. Vasquez, V.R. and Whiting, W.B., Fluid Phase Equilibria (2000) in press. 4. Vasquez,V.R., Ph.D, Dissertation, University of Nevada, Reno (1999). 5. Kim. I., Liebman, M.J. and Edgar, T.F., AIChE Journal, 36 (1990) 985-993. 6. Atlaly, S. and Alpay, H.E., Ind. Eng. Chem. Res., 26 (1987) 2212-2215. 7. S~rensen, J.M., Magnussen, T., Rasmussen, P. and Fredenslund, A., Fluid Phase Equilibria, 3 (1979) 47-82. 8. Novak, J.P., Matous, J. and Pick, J., Liquid-Liquid Equilibria, Elsevier, New York, USA (1987). 9. SOrensen, J.M. and Arlt, W., Chemistry Data Series, DECHEMA, Frankfurt/Main, Germany, 5 (1980). 10. Radice, F.C. and Knickle, H.N., J. Chem. Eng. Data, 20 (1975) 371-376
European Symposiumon ComputerAidedProcessEngineering- 10 S. Pierucci(Editor) 9 2000 ElsevierScienceB.V. All rightsreserved.
91
E n e r g y cost m i n i m i z a t i o n in an e n e r g y i n t e n s i v e i n d u s t r i a l p l a n t : an MINLP approach J. Vin a, M.G. lerapetritou a'l, P. Sweeneyb and M. Chigirinskiy b aDepartment of Chemical Engineering, Rutgers University, Piscataway, NJ 088.54
l(marianth@~sol.rutgers. edu) bThe BOC Group, Murray Hill, NJ 07974
1. PROBLEM DEFINITION This work addresses the problem of determining the optimal operating schedule to minimize the operating cost in an energy intensive process separation plant. The difficulty arises from the fact that the energy cost is subject to high fluctuations, thereby, Significantly increasing the total production cost in the plant. To deal with such cost variability the plant can operate in three different modes (modes A, B and C)that vary with respect to operation efficiency and energy requirements. Mode A is the normal mode of operation. When the energy cost increases the plant can shitt to the alternative mode of operation B which is less expensive but also less efficient since it requires the consumption of one of the plant products. In some cases the pIant shifts to the mode C in which there is no production but the plant continues to satisfy the demand utilizing the storage capacity. Hence given a forecasted trend in the energy cost, it becomes important to determine the optimal operating schedule that would minimize the total operating cost of the plant over a given time frame and also meet the customer demand. Such a schedule would determine the mode of operation at each time step together with the amounts of products that must be produced. It is essential to keep the computation time within a reasonable time limit, since the problem needs tobe solved fast to be used for further management decisions. The focus of this work is to propose an efficient mathematical formulation and solution approach to obtain the optimal operating schedule using mathematical programming techniques. 2. MATHEMATICAL MODEL OF THE SEPARATION PLANT The proposed mathematical formulation involves the following constraints: Objective Function: minimization of cost OB = E (C(i) * Pvov~ ) + (Penalty) * ~st,i Sst(i) (1) The objective of the problem is to minimize the total cost of operation within the time horizon under consideration. In order to take into account the uncertainty in the storage levels, due to uncertainty in product delivery, an additional penalty term is added in the objective function to minimize the violation of storage safety levels. The process involves the separation of feed (f) into t!~ree different products, two liquids (sl={ sll, s12}) and one gas (sg). The following equations correspond to the material balances aroundthe process for modes A, B.
92 Material Balances for mode A: X .,,, d (i) = R ,4 * X A (i) sll f
(2)
X,,]z (i) + X .,g A (i) = R A a2 , X l (i) = X-4.,.,1(i) + w,a2 , X,.,2 A (i) Total Feed Material Balance ,4 B Xttotal(i) = X f (i) + X I (i)
Xliq(i)
(5)
(3)
Material Balances for mode B X B .a3(i) = R Bs13 * X Bf (i) XB ~ a2(i) + X , Bg ( i ) = R sl2 * X fB (i)
(4)
X ~l (i)
(7)
.a2(i)
= Wsl2 * X B
(6)
(8)
where X ~ (i) correspond to the amount of material (s) at time period (i) when the plant operates in the mode (j), R~ corresponds to the recovery of product (s) when the plant operates in mode (j), and ws corresponds to the relative cost of energy to produce the different products (s), These equations reflect the mass balances in the various processes that take place in the modes A and B. Capacity constraints for material (s) in mode (j) *l~(i) _< X~ (i) _< 13s* ~(i), Vs ~ S, Vj e {A,B} (9) These constraints are derived from the capacity limits of the equipment used in the two modes. Storage Constraints Lsl(i+l) = Lsl(i) + { X~r (i)- X,.~(i) - Qsl(i)- Vs~ }, sic {slt, sl2}, i e I, i r 1 (10) Lsl (i) = Lsl-i,utial, i= 1 (10a) These constraints connect time step (i+ I) with the previous time step (i). According to these constraints the level of liquid (sl) in the storage tank at time step (i+l) (Lsl(i+l)), equals the level of liquid (sl) in the tank at the previous time step (Lsl(i)), adjusted by the amounts produced and delivered (Q~a(i)L during the time step (i). A small correction term that reflects material loss during distribution is also added, (Vsl.). Storage tank level bounds A sl high , , sic {sll,sl2} , i 6 I, (11) S.,Imm + "--^,4t~ - Ssl(i+l) -< Lsl(i+l), Lsl_initia I _< S s T " ,-These constraints express the requirement for a minimum level of liquid (sl) in the storage tanks (S ~ ), to enable trailer filling from the tank. The maximum level constraints (S.,.~x) arise from the storage tank capacity limits. Remark 1" Note that the A parameters used in equations (11), have been derived by considering a stochastic chance constraint programming fommlation (Charnes and Cooper, 1959) with a subsequent transformation to a deterministic problem, The use of stochastic modeling was required to account for uncertainty in the distribution of liquid (sl) over a time step (i). Remark 2: Slack variables Ssl(i)are introduced to allow the minimum safety levels in the storage tanks to be dynamically violated for short time periods, and ensure the problem is feasible in the uncommon case when total demand exceeds plant production capability.
93 Logical Constraints; pA(i) + pB(i)+ pC(i)= 1 ; (12) This constraint ensures that only one mode of operation is selected at an~' time step. For example, if the plant operates in A operation mode, then pg(i) = 1 and pD(i) = 0 and pC(i) =0 and constraints (9) for mode A correspond to the upper and lower bounds on the production rates for the various products, whereas constraims (9) wri~en for modes B and C result in. zero production variables for the corresponding production variables. Switch variable constraints: The variables SwD(i) and SwC(i) are introduced into the system to account for the switching between the operating modes. Swa(i) takes a value of 1, whenever the mode of operation shifts from either A or C at time step (i-1) to B at time step (i) (which means that there is a 'switch to B mode) and is 0 otherwise. Similarly swC(i)-takes a value of 1 whenever the mode of operation shifts from A or B at time step (i-l) to C at time step (i) and is 0 otherwise. Notice that although Sx~ and Swc are not defined as binary variables, they take the values of either 0 or 1 from the way they are defined by the following constraints. SwB(i) > pg(i-1)+ pC(i-t) + pB(i)---1 (13) SwB(i) <_ pa(i) (14) SwS(i) _< pA(i-1) (t5) SwC(i) >_ pA(i-1)+ pn(i-1) + pC(i)--1 (16) SwC(i) _ pC(i) (17) SwC(i) <_ pA(i- 1) + pB(i-1) (18) Equations (13)-(15) define the value of SwB while equations (16)- (18) define the value of
swC.
.
.
.
.
Constraints to satisfy specific operating conditions Based on the requirements of the plant, two operating critefiahave been introduced imo the model. These are: * If the plato switches imo B (C) mode of operation, then it must remain in that mode for a minimum number of time steps, NTb .('NTc). The condition for operating mode B is satisfied using the following condition" i+ N'l;, -1
~.(pA(i,).+ pC, (i')) < 2*NTb [l-Sw"(i)]
(19)
i'--i
If the. mode. of operation switches to B at time step ' i , i.e SwB(i) = 1, then the LHS of equation (19) becomes zero, forcing all pA and pC variables for the next NTb time steps to be zero. This ensures that the plant remains in B mode for the next NTb time steps. If SwB(i)= 0, then the condition is redundant. The requirement for operating mode C is satisfied by a similar condition: i+NTr-1
~ ( p A (i') + p~ (i')) _ 2*NTc.[1- SwC(i)]
(20)
i'-i
If SwC(i) = l, this forces all p variables on the LHS to be zero, thus ensuring that the plant remains in C mode for the next NTc time steps. If SwC(i)= 0, the condition is relaxed.
94 Energy Definitions PrOTAL(i) = Pl(i) + P2(i) + [ 1-pC(i)] *(Pn~sc) (2 i) Pl(i) = oq *[ 1-pC(i)] - ~1 *Xn,,t~l(i)+ '~1 *(Xn,,t~'(i))2 (22) P2(i) = o~2 *[ 1-pC(i)] + 132*XHq(i)+ T2 *(XHq(i)) 2 (23) where p variables are binary, X variables are continuous and positive, mad (x,13,7 parameters correspond to the energy consumption per unit material processed. The model proposed corresponds to a Mixed Integer Nonlinear Programming (MINLP) problem. The nonlinearities in the problem arise only in the objective function. Quadratic relationships are chosen for this study to assure model convexity.
3. MINLP SOLUTION APPROACHES Two algorithmic procedures are used for the solution of the proposed MINLP model presented in the previous section, namely the Generalized Benders Decomposition (GBD) algorithm and the Omer Approximation (OA) solution approach (Floudas, 1995, Biegler et. al., 1997). For this purpose two modeling environments are used GAMS and MINOPT. It must .be noted here that since the proposed formulation is convex ,on all continuous variables and separable in continuous and binary variables, both algorithmic procedures guarantee to obtain the global optimum solution. Table 1 shows some results for computational times for the MINLP using GAMS (for different scenarios) and a comparison between OA and GBD algorithms. Table 1" Comparison of MINLP solution approaches GAMS/DICOPT (0A_alg_orithm)___ -. . . . . . . Time Initial storage levels as Major CPU time as Horizon percentage of maximum Iterations multiple of tank capacity . . . . . . . . . . . . . . allotted time 24 time steps Lsil.initial=65%, Ls12.initial=97.5 40(limit) 4x 48 time steps Lsll_tmt~=83%, Lsiz_mi~al=97.5 40(limit) 19 X 72 time steps Lsll_initial= 100%, Ls12_initial=97.5 > 30X ,, MINOPT (24 time steps, Ls!!.iaitiat= 65~ Lm-ialtia!7' - 97%)_ Major Iterations CPU time OA GBD
31 18
0.9 X 1.4 X
4. MILP APPROXIMATION OF THE MODEL As shown in the previous section the proposed MINLP formulation performs well in terms of computational efficiency if time horizon is considered up to 24 time steps. However, when longer time horizons are considered, the problem becomes too expensive to solve. For comparison an alternmive Mixed Integer Linear Programming (MILP) model is described in order to solve the problem in an efficient way. As shown above, the only nonlinearities in the formulation occur in the objective function in the form of quadratic expressions at equations (22), (23).
95
Using the capacity constraints we can linearize the quadratic terms between the bounds. The MILP approximation thus-, has the same constraints, and objective function, except the fact that all quadratic terms in the power function have been linearized. The MILP problem was solved using GAMS/CPLEX as the solution algorithm and the results are presented in the next section and compared to the MINLP solution. 5. RESULTS AND DISCUSSION MILP problems were solved to optimality using GAMS/CPLEX. MINLP problems were solved using GAMS/DICOPT and MINOPT. All computations were carried out using a SUN'ULTRA 60 Workstation. The 'real time optimization requirement imposes a time limit on the computational time for solving the optimization/scheduling problem. In this work, time is expressed as multiple of this allotted time. A typical case that has been solved is shown in Figures 1 and 2. In particular Figure 1 shows the demand of liquid products that must be met, and Figure 2 shows the energy cost variability together with the predicted mode of operation.
~ool 90 80 7O 6O 5O
!
~ Qsll(i) 9Qsl2(i) , ,
204~ ltllltlli i l,l 0
Time Step
Fig. 1" Product Demand
I
)
. Scaledprice
ii
Ii
li
i'
I ~
ll, l
::::::::::::::::::::::::::::: t' '~ 1'I~......|i~~ ..... i
::::::z:___. -~ti.:!._
Time steps Fig. 2:Power costs and operating modes
A few of the computational results are tabulated in Table 2. As seen from Table 1, the MINLP approximation becomes computationally very expensive for 72 time steps and beyond. The MINLP model was also found to be sensitive to the input parameters to the problena- initial levels of liquid products in tank, distribution of product demand and power cost variation with time. All cases in Table 2 refer to 72 time steps. It is seen that the MILP approximation solves well within the allotted time for most of these cases (even for a 120 time steps, the computational time remains within the allotted time). Also, the values of the optimum obtained by the MILP approximation are very close to those found by the MINLP. For the case when L~H and Lm are 79% and 73% of their naaximtma values respectively, the MhNLP was solved to optimality within the allotted time. This corresponds to the Global Minimum. We see that the solution obtained by the MILP (34905) is extremely close this Global Minimum (34904). It is worth noting that the MILP took about one fortieth the time to solve compared to the MINLP. This is also shov~aa in the case when Lsn and L~2 are 79% and 97% of their maximums. In this case the MILP is solved to optimality within the allotted time (31608)
96 however the solution yielded by the MINLP (32114) within this time is suboptimal compared to this (the MINLP was allowed to proceed to 25 iterations i.e about 30 times the allotted time, but could not yield a solution better than 32114). These results show that for most cases the MILP formulation yields satisfactory results both in terms of computational times and also in terms of being very close to the Global Optimum. To verify this, an analysis was done to evaluate the average and maximum difference between the objective function values as calculated by the MILP versus MINLP approaches and this showed that on an average, this difference would be approximately 7%. This means that the MILP results in a solution that is very close to the Global Optimum.
Initial levels (Lsli, Lm) % of max 100% 97% 79% 97% 100% 73% 79% 73% 100% 88%
Table 2: Comparison of MILP to MINLP approach . . . . . Objective Time taken for Objective function after function MILP problem running as MINLP for the from MILP (multiple of allotted allotted time time) 15461.53 5.9 X No solution within time limit 31608..4
0..06.3 X
32114.04
22195.16
0.0045 X
34905.8
0.014 X
No solution found within time limit 34904.74
22319.6
0.0082 X
No solution found within time limit
6. CONCLUSIONS It has been shown that the problem of Power Consumption Optimization and Scheduling c,an be solved efficiently by using Mathematical Programming techniques. The formulation leads to a MINLP problem which is guaranteed to yield the Global Optimum solmion. However the MINLP formulation results in very high computational times. Since this might not be efficient in practice, due to the relative small time frame of the decision making process an alternative MILP approach was developed which was very efficient computationally and yielded solutions very close to the Global Optimum.
References Biegler, L.T., I.E. Grossmann and A.W. Westerberg, Systematic Methods of Chemical Process Design, Section A.3.4, Prentice Hall, 1997. GAMS Solver Manual 9 GAMS Development Corporation, November 1998. Charnes, A. and W.W. Cooper, Chance-constrained programming. Manag. Sci. 5:73-79, 1959. Floudas, C.A., Nonlinear and Mixed Integer Optimization: Fundamentals and Applications, Oxford University Press, 1995.
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
Generic object-oriented dynamical systems
modelling,
simulation
97
and
optimization
of
Dipl. Phys. T. Wack, Dr.-Ing. G. Deerberg and Dr.4ng. S. Schltiter Fraunhofer-Institute for Environmental, Safety, and Energy Technology, Osterfelder Strasse 3, 46047 Oberhausen, Germany 1. INTRODUCTION Dynamic simulation is an important tool for the design, optimization and control of nonlinear dynamic or complex systems as they appear in chemical engineering. Such simulations are based on detailed mathematical models, which are much more effective than conventional models (i.e. perfect mixed reactors) regarding a precise description of reality. The editing of such highly detailed models belongs usually to the most laborious and tedious tasks of technical and chemical engineering. Objective of the presented work is the development of a general modelling tool, that is able to generate model components automatically, which are documented as well as they are provided with a self-generated GUI interface for model parameterization. Intended starting point for this automated model generation is an OOA (object-oriented analysis) of the process to map, which itself is supported by interfaced knowledge-bases and exchangeable expert system instances. There are two major advantages of this architecture. On the one hand the models are very transparent because of their implicitly simultaneous formulation on mathematical side, on the documentation side and also within the context-sensitive layout of the graphical user interface (GUI). On the other hand there results an abstract model formulation, which ensures a high degree of reuse for single components. Furthermore the exchangeable expert system component offers the possibility to use the same modelling tool for mapping different complex systems (as regards the particular requirements of different disciplines), without decreasing the degree of specialization. This aspect leads directly to the opportunity of hybrid model formulation. In general there results a significantly less time-consuming generation of models.
2. MASSIVE RAPID PROTOTYPING To realize this approach it is necessary to develop a problem-related strategy which takes into account modern software engineering techniques, i.e. object orientation, rapid prototyping etc. to minimize developing time without decreasing run time quality and stability of the modelling system. This newly created concept of class generation we labeled Massive Rapid Prototyping (Figure 1).
98
Figure 1. Concept of Massive Rapid Prototyping as a new method for fast model development by using a reduced set of objectoriented techniques. The basic advantage of this concept is the high degree of abstraction in the lower layers. That ensures the implicit implementation of the basic functionality.
The software GenOOM is provided with a set of superclasses to ensure that the user is able to build up models only by connecting the components. The MRP concept has the advantage that the user must not be familiar with the complete method of object oriented modeling because he uses object frameworks that are filled with the mathematical knowledge. For the description of the components on this mathematical level we developed an equation-editor. This step is supported by an interfaced expert system. On the one hand the formula knowledge is stored in relational databases as binary trees and on the other hand the inference mechanism takes place through docked algorithms which work on the database structure. In the first step the user has to determine the model complexity. Therefore he navigates through decision trees as introduced by Marquardt et al. [1], [2] and selects the correct balancing equations for mass, energy and momentum: d d t Iv ~(r, t)dv =--~FJ(r, t) 9nF(r)df + ~vq(r,t)dv dE
P
(1)
q
dt - E F j E j - E F k E k j=l k=l
+W P
d M _ M(i) M(0) + ~ Fk dt k=l _
dm i P q dt - ~ f i , j - E fi,k + gi j=l k=l
(2) (3)
(4)
The second step is the formulation of constitutive relations and closure constraints e.g. mass transfer rate, energy transfer, reaction rates and component properties as presented in the work of Jensen [3]. These equations are imported from the knowledge database and therefore
99 easily expansionable and customizable regarding the special tasks. This second step is completely assisted by the expert system. The resulting modular submodels are merged in a flowsheet editor. The connections between them give information about coupling variables. This is necessary to link different DAE (differential algebraic equation) systems of the submodels to an aggregated DAE-system which is solved numerically.
Figure 2. Interaction of the several clients of the GenOOM-framework Figure 2 shows the workflow through the several components of GenOOM. Gray boxes without shadow represent hidden clients which work in the background without interaction with the user. 3. STRUCTURE OF THE SOFTWARE GENOOM
GenOOM's architecture is based on the concept of distributed applications which at the moment is limited to DCOM clients in a local area network and TCP IP clients on wide area networks. A future perspective is the expansion to ActiveX on wide area networks which means that flowsheeting can take place via W W W or internet on small clients and model aggregation, generation and finally simulation is done on a high performance computing machine. Currently implemented components are: flowsheet editor which uses modem software technologies (i.e OLE, drag and drop of components from a tool box, multi layer concept and component aggregation and segregation by group and ungroup functionality) DAE-system solver (DASSL, LIMEX, LIMEXS, LSODI, RADAU5, RADAUP, RADAU, RODAS, ROS4, SDIRK4, SEULEX, SODEX)
100 component properties database (ASPEN PROPERTIES PLUS, Data Compilation Table, DIPPR) formula knowledge database knowledge based equation editor regression tool PAREG for offiine parameter estimation model, code (FORTRAN 90, C++, java) and documentation generator (HTML, MATHML) Figure 3. Structure of the software GenOOM: Distributed clients communicate via DCOM or TCP IP in a local or wide area network. The service clients (optimizer, expert system, solver , compounds and other distributed components) provide the framework (in the middle) with data and functions which the model developer or the model user are able to use in their projects
One important part in the model generation is the model ~>debugging~ where the user can gather information about the consistence of his model. At the moment this debugging step consists of: dimension analysis of the used equations analysis of the degrees of freedom of the whole aggregated matrix analysis of the incidence matrix index analysis analysis of time constants and eigenvalues A very important aspect is the integrated environment the user works with from problem definition over model construction until model validation. Only in the background this integrated environment decomposes into several tasks on different machines where clearly defined component interfaces ensure an exchange or expansion of single parts.
101 4. PROTOTYPE AND FUTURE PERSPECTIVES
The data exchange with several simulation programs (Speedup, gProms etc.) is planned. This presupposes the development of translation-clients which work between GenOOM's mathematical formulation of models and the solver-specific problem representation. Additionally the support of formulation of Partial Differential Equation systems (PDE) is planned.
Figure 4. Flowsheeting environment of the GenOOM-prototype 5. REFERENCES
[1]-
[2] [3]
Marquardt, Towards a process modeling methodology RWTH Aachen 1993 R. Bogusch, B. Lohmann, W. Marquardt, Ein System zur rechnergesttitzten Modellierung in der Verfahrenstechnik Jahrbuch der GVC, VDI Verlag 1997 Anne Krogh Jensen, Generation of Problem Specific Simulation Models within an Integrated Computer Aided System Ph.D. Thesis Technical University Of Denmark 1998
This Page Intentionally Left Blank
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
103
Detecting outliers in multivariate process data by using convex hulls J. P. Bamard and C. Aldrich Department of Chemical Engineering, University of Stellenbosch, Private Bag X1, Matieland, Stellenbosch, 7602, South Africa Email:
[email protected] (secretary of Prof. Aldrich)
In this paper the problem of near-real-time detection and removal of up to 15% radial outliers from large data sets (10000 or more records) is investigated and a practical solution demonstrated. The proposed method was compared to the Rocke and Woodruff algorithm in an example of elliptically arranged random data and applied successfully to test data recorded of a flotation plant. The technique has the benefits of low computational cost with minimal operator input, and can be implemented as a real-time outlier detection tool. 1.
Introduction
Each radial outlier lies in a different direction, with its mean offset from that of the good data. There are several classes of outliers. Shii~ outliers, i.e. outliers that has a mean that is offset from that of the good data, but with the same covariance matrix, are the most difficult to detect. On the opposite end, radial outliers are easiest to detect. It often occurs that an outlier is not revealed by inspection of the individual components (limit checking) of a multivariate data vector, since for each component the extreme points are within acceptable limits. However, in a two-dimensional phase plot, the outlier may become apparent when the vector containing the outlier components protrud.es significantly from the neighbourhood of data vectors. Human judgement has often proved to be subjective and quite inconsistent, hence many mechanistic means have been proposed so far to detect multiple outliers in multivariate process data. Amongst these methods are, for example, the interpretation of principal component residues [ 1], the projection of data onto two- or threedimensional co-ordinates by principal component analysis [2]; cluster analysis, without necessarily visualizing the data. Direct statistical approaches such as probability plots can facilitate discovery of outliers that distort location, scale and correlation estimates of data. The efficiency of some of these techniques can be severely limited when high-dimensional data are considered. In order to distinguish between valid observations and outliers, it is required to estimate characteristic parameters of the distribution of observations as well as calculate a test statistic. Often the probability distribution of the data is unknown, and consequently one attempts to find a robust estimator of the location and shape of the multivariate data. Examples are search algorithms to find the minimum volume ellipsoid [3] or minimum covariance determinant [4]. Most methods are affine equivariant, which means they are invariant in terms of outcome under linear transformations. Rocke and Woodruff [5] constructed a generalized, two-phase method that estimates the location and shape (phase one) and determines outliers by applying a X2 outlier criterion (phase two). In the first phase the
104 location and shape are initially calculated by sequential point adding, using the minimum covariance determinant as initial estimation of shape. Finally shape is estimated using bi,weight M estimation. In the second phase a cutoff point is determined by simulation and the location and shape are updated using the (l-c~) fraction of points falling within the cutoff region. Observations whose Mahalanobis square distance, using the updated location and shape, is larger than ~ 2p,l-,~ (P is the dimension of the data) are rejected as outliers. Arguing that shift outliers are the hardest to locate, they showed successful results based mainly on this class of outliers. A practical limit to the ability of this algorithm, in terms of required data and processing time, is a maximum of about 35% outliers in 20-dimensional data. However, linearly extrapolating the results in table 5 of [5] suggests that computational cost of this method may be prohibitively high for application to large data sets (size of order 10 000 records) often found in industry. Detecting radial outliers in data does not require the sophisticated search for location and shape of generalized outlier detection algorithms. Therefore, it is suggested here that a convex hull can indicate the position of radial outliers and that the true location and shape of the data can be estimated after removing the hull from the data. The indicated outliers are qualified as true or false using a test statistic based on statistical properties of the retained data. This method is compared to the Rocke and Woodruff algorithm [5] in an example of elliptical random data and applied successfully to test data recorded on a flotation process. The technique has the benefits of low computational cost with minimal operator input and can be implemented as a real-time outlier detection tool.
2. Detecting radial outliers using convex h u l l s Formally, the convex hull of a point set P is the smallest convex set that contains P. If P is finite, the convex hull defines a matrix A and a vector b such that for all x in P, Ax+ b < - [0]. A convex set can be defined as the intersection of a set of half-spaces, that is the set of points on one side of a plane. The convex hull with maximum possible volume is co-planar with the outer data points in the set, and is by definition convex everywhere"along its surface. For a detailed treatment of convex hulls, the reader may refer to [6]. Suppose one can visualize the data space, X ~ 9~m, then outliers tend to stand out from the local trend in the data. A convex set of the data space will be coplanar with at least some of the outlier vectors. The authors suggest that for data that are grouped into a number of distinct clusters, and fall along a piecewise smooth manifold, it is possible to improve the success of outlier detection by constructing the convex hull on the first difference of the data. Inspecting first differences of such data, the incongruity of outliers with normal data should be more pronounced than when inspecting the data itself. On the other hand, the detection of radial outliers in Gaussian data does not respond well when applied to first differences of the data. Detecting outliers in data requires a criterion by which an outlier can be qualified as a true outlier. Removal of valid data is undesirable. A convex hull does not distinguish between outliers and valid data along the perimeter of data space. Therefore, such a criterion will be defined in the procedure described in the following section.
3. Procedure for radial outlier detection method Assume a data set, X~9~ m, with radial outliers.
105 1. Scale the data by standardizing to zero mean and unit standard deviation. Then normalize each component Xi to have unit length (llXill = 1). Standardization and scaling ensure that all data components are of the same order of magnitude, otherwise a multidimensional outlier detection algorithm would disregard outliers in components of comparatively small magnitude. 2. Depending on the class of data, calculate the first difference, X', of the data, X. 3. Construct a convex hull Q0 around X' (or X). The algorithm and code by Barber et al. [ 1996] can be used for this purpose. Let d 2 be the squared distance of each vertex on the convex hull to the location of the remaining data, and dl 2 the mean square distance of the remaining data to its location/z. 4. Remove Q0 from X' (or X) to give X1. 5. Calculate the Mahalanobis distance from vertices of Q0 to the mean of X~. The Malahanobis distance between points x and y in ~}~m is defined as d~(x, y ) - ( x - y ) r f2-1 ( x - y ) , where the metric f2, is the p x p covariance matrix of the data. 6. A hull vertex qualifies as an outlier if the following inequality is satisfied:
d~ (Qoi,/zl) > sd~ (X1,/z 1), where d(.) is the Mahalanobis distance normalized with the covariance matrix of the remaining data, Q0;e 9~m a vertex of the convex hull, X1 e 9V' the remaining data and s a sensitivity factor.
4.
Demonstration of outlier detection method
The outlier detection method is demonstrated in two examples. The first is a random data set containing known outliers. The second example is a data set recorded of flotation process, without a priori knowledge of possible outliers. The results from the gocke and Woodruff algorithm were taken as comparative standard. Visualization was acfiieved by projecting the data space onto the first two principal components of the data.
4.1. Random data containing outliers To enable an objective evaluation of the outlier detection technique, a two-dimensional Gaussian data set was intersected with data describing an ellipse to produce a data set of 533 records. Six outliers were manually created by moving six arbitrary points in an A'T phase plot to outside the elliptic boundary. None of the outliers could be detected as such from inspection of the X and Y components of the data set, since they were within the range {-2.5, +2.5 } spanned by each component. However, in a phase plot the outliers were clearly visible. As a first approach, a convex hull was constructed around first differences of the data and then removed. After two iterations only two out of the six outliers were removed from the first differences of the data. The authors therefore conclude that for random data, it appears that extreme values in first differences of data generally do not coincide well with extreme values in the data themselves. When applied to the data, instead of first differences of the data, the outlier detection scheme correctly detected four out of the six outliers, with the two least severe outliers remaining after one iteration. The cost of outlier detection was five false outliers identified at the ends of
106 the long axis of the ellipse. This is due to the spherical outlier criterion applied to a data set that is very non-spherical in terms of distribution. A default sensitivity factor, s = 1, was used in this example. However, since the motivation behind the convex hull method is fast detection in large data sets, this cost is very low at 0.9% of sample size. By comparison, the Rocke and Woodruff algorithm detected the same outliers as our technique, also failing to detect the two least severe outliers. Their algorithm incurred zero detection cost by not indicating any false outliers. Finally, the computational cost in terms of time required to process 10000 elliptically distributed random data points was investigated. The convex hull technique took 1.0 second to complete one iteration of detection while the Rocke and Woodruff technique needed 660 seconds, running ANSI C code for both algorithms under Microsoft | NT4 on an Intel | PII 400 Celeron TM processor with 256 MB RAM. 4.2.
Flotation process data
As a second example, the convex hull technique was applied to data recorded of a flotation process, used for the recovery of base metals. Five independent variables representing visualization data of the process as well as the percentage lead recovery were combined into a six-dimensional data space, containing 1425 data points. Table 1 Summary of results of outlier detection on flotation process data. Algorithm Convex hull Rocke and Woodruff
Outliers indicated 115 60
Common Outliers 35 35
Relative detection cost 5.6% 0
computation time [s] 3 36
A principal component analysis was performed first. Plotting the first versus the second principal components indicated two distinct clusters. The Rocke and Woodruff algorithm identified 60 outliers in the data, and took 36 seconds to run. These outliers coincided with data lying beyond the 95'th percentile in terms of Hotelling's T-squared statistic, calculated from the data. The convex hull outlier detection procedure was iterated once with a detection sensitivity, s = 3, and indicated 115 outliers. Figure 1 shows the outliers identified by the convex hull algorithm as well as the Rocke and Woodruff algorithm. The results are summarized in Table 1. 5.
Conclusions
In this paper the proposed outlier detection method for the near real-time detection of radial outliers was effectively achieved by way of an algorithm that incorporates the construction of a convex hull and the removal of points supporting the hull. The method was demonstrated successfully on artificial random data, as well as real process data. Our investigation into computational cost showed the convex hull technique to be up to two orders of magnitude faster than the generalized Rocke and Woodruff algorithm. Compared to the Rocke and Woodruff algorithm, the cost in terms of number of false outliers detected was higher on the random data, owing to the less sophisticated shape estimator in the convex hull technique.
107 015
01
,~+,
.+.. o
.
L
#, 9162 9 ,qlqj. 9 9
0.05
A
4D
~
4,
9
(D 13.. _
-0.05 -
@
-0.10 .2
I
-0.15
_0~.1
~(~
~ -0.05
• - convex hull algorithm + - Rocke and Woodruff
9
0, PC 1
~ 0.05
0 ~.1
O.'15
0.2
Figure 1 Projection of flotation data onto first and second principal components, showing outliers detected by the convex hull algorithm, and Rocke and Woodruff algorithm.
The results for the flotation process data were satisfactory in that the indicated outliers, common between the two algorithms, were the major ones along the perimeter of the data space. [ 1] D.M. Hawkins, Identification of outliers, Chapman and Hall (London), 115, (1980). [2] R. Gnanadesikan, Methods for statistical data analysis of multivariate observations, Wiley and Sons, 292, (1977). [3] F.R. Hampel, E.M. Ronchetti, P.J. Rousseeuw and W.A. Stahel, Robust Statistics: The approach based on influencedfunctuions, John Wiley (New York), (1986). [4] P.J. Rousseeuw, A.M. Leroy, Robust regression and outlier detection, John Wiley (New York), (1987). [5] D.M. Rocke, D.L. Woodruff, J. Am. Stat. Association, 47(435), 27, (1996). [6] J. O'Rourke, Computational geometry in C, Cambridge University Press, (1994).
This Page Intentionally Left Blank
European Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
109
M I N L P O p t i m i z a t i o n of S e v e r a l P r o c e s s S t r u c t u r e s for t h e S e p a r a t i o n of A z e o t r o p i c T e r n a r y M i x t u r e s D. Brusis a, Th. F r e y a, J. Stichlmair a, I. Wagner b, R. Duessel c, F.-F. Kuppinger c a L e h r s t u h l fuer F l u i d v e r f a h r e n s t e c h n i k , Technische U n i v e r s i t a e t M u e n c h e n , B o l t z m a n n s t r . 15, 85747 Garching, G e r m a n y Email:
[email protected] b W e l C h e m GmbH, B o l t z m a n n s t r . 15, 85747 Garching, G e r m a n y c D e g u s s a - H u e l s AG, P a u l - B a u m a n n - S t r . 1, 45764 Marl, G e r m a n y
Abstract - For m a n y separation tasks in chemical i n d u s t r y there exists a variety of different processes to meet the desired product specifications. This paper presents a comparison between four different process alternatives for the separation of the t e r n a r y mixture methanol/2-propanol/water. To create a reliable basis for the evaluation of these different processes a rigorous M I N L P optimization is carried out.
1. INTRODUCTION The separation of multi component mixtures is of great interest in i n d u s t r y as well as in scientific research. To achieve high product purities distillation often is the appropriate unit operation. In doing so, the separation of azeotropic m i x t u r e s is m u c h more complicated t h a n the separation of zeotropic mixtures, as azeotropes form barriers t h a t cannot be crossed by distillation. Often, there exists a variety of different processes to perform the separation but with rising n u m b e r of required fractionations the n u m b e r of suitable unit operations and their possible combinations rises significantly. Due to a lack of quantifying methods, up to now the decision for a particular process is often based on the design engineer's preferences and experiences or on heuristic rules. This s t r a t e g y can lead to significant losses in either operating or i n v e s t m e n t s costs. This paper presents a comparison between four different process alternatives for the s e p a r a t i o n of the t e r n a r y mixture methanol/2-propanol/water. Because of the m i n i m u m azeotrope between w a t e r and 2-propanol and the resulting distillation boundary, the recovery of all pure components by distillation is difficult (see Fig.l). Potential process alternatives discussed in the paper are pressure swing distillation, azeotropic and extractive distillation and p e r v a p o r a t i o n . To create a reliable basis for the evaluation of these processes a rigorous M I N L P optimization of each process is carried out. Depending on the feed composition, the best process can be determined with respect to the a n n u a l
110 methanol (a) 64,5 ~
water (c) 100 ~
-
IF-
.
.
.
.
l u
80,7~
-.~
2-propanol(b) 82.6 ~
Fig. 1. T r i a n g u l a r diagram of the mixture methanol/2-propanol/water costs, which are calculated using industrially applied cost functions. As this m a t t e r is of special interest for the industry, this work is a cooperation of L e h r s t u h l fuer Fluidverfahrenstechnik, TU Muenchen, Degussa-Huels AG and WelChem GmbH.
2. S U P E R S T R U C T U R E S
AND MODELS
A basic r e q u i r e m e n t for a MINLP optimization is the creation of an appropriate process superstructure. To g u a r a n t e e t h a t the superstructure comprises all relevant process structures, it is developed on the basis of t h e r m o d y n a m i c information t h a t can be retrieved from the phase equilibrium of the m i x t u r e to be separated. Only in this way the variety of imaginable processes can be limited to a reasonable n u m b e r with respect to ensure t h a t all relevant v a r i a n t s including the optimal one are contained. Thus, it is obvious t h a t each of the four process alternatives t h a t are discussed in the paper requires a different method to create an adequate superstructure, which is presented in the following. Azeotropic or extractive distillation is often used for the separation of azeotropic mixtures. Both have in common t h a t an additional e n t r a i n e r is necessary to fulfill the separation task. For azeotropic distillation the e n t r a i n e r m u s t be immiscible with one of the components of the original mixture [1]. Extractive distillation is an essence combination of physical absorption and distillation. Thus, a high boiling e n t r a i n e r is required which does not form additional azeotropes and which selectively absorbs one of the components of the original
111 mixture. The s u p e r s t r u c t u r e s for azeotropic and extractive distillation t h a t are applied in this paper are based on those t h a t have been developed by Bauer [2] and Glanz [3]. Bauer and Glanz restricted their s u p e r s t r u c t u r e s to the separation of b i n a r y m i x t u r e s with an additional entrainer. To apply these s t r u c t u r e s to this t e r n a r y mixture an additional column is required to s e p a r a t e the low boiler methanol. This leads to a binary m i x t u r e for which a s u p e r s t r u c t u r e can be determined according to the rules of B a u e r and Glanz. This methodology has two inherent advantages: First, the p r e s e p a r a t i o n of the low boiler reduces the a m o u n t of feed to the subsequent process which leads to smaller column diameters. Second, it is much easier to find an appropriate e n t r a i n e r for the separation of the r e m a i n i n g binary mixture. The s u p e r s t r u c t u r e for the azeotropic distillation is shown in Figure 2. It applies for any e n t r a i n e r t h a t forms a miscibility gap with water. The question which e n t r a i n e r is best suited for the separation can only be answered by a rigorous optimization of the whole process. Feasible entrainers are toluene, cyclohexane or benzene [4]. The s u p e r s t r u c t u r e of extractive distillation is shown in Figure 3. Appropriate e n t r a i n e r s would be ethyleneglycol and dimethylformamid. Besides the first two process alternatives t h a t require an e n t r a i n e r there exist also processes without any entrainer. The third possibility to be studied is the so called generalized process [5] which includes the v a r i a n t of a pressure swing distillation shown in Figure 4. The last process to be considered is a hybrid pervaporation process. The s u p e r s t r u c t u r e is shown in Figure 5. Here, only one column is necessary to separate the mixture in three pure components. Methanol is s e p a r a t e d at the top of the column and 2-propanol is w i t h d r a w n at the bottom. The high boiler w a t e r is drawn off as a side s t r e a m t h a t is split within a pervaporation unit into pure w a t e r (permeate) and a r e t e n t a t e which is recycled into the column. Polymeres or anorganic m a t e r i a l s can be used as m e m b r a n e s . The m a s s t r a n s f e r through the m e m b r a n e depends on t e m p e r a t u r e . Therefore, the feed m i g h t be passed through an additional h e a t e r to achieve a constant p e r m e a t e flow and to supply the h e a t required for the vaporization of the permeate. D1 (a)
F a+b+c
r
I
I
|I I I i I i
I
'~
I
I
c
I I
I
r" ~
1
1~
D3
entrainer makeup
e
F L2
B2 (c)
E-1
II B3 (b)
Fig. 2. S u p e r s t r u c t u r e of the azeotropic distillation
B1U
B2T
I
e
Fig. 3. S u p e r s t r u c t u r e of the extractive distillation
112
a
D1
D3
F
~
F ~ a+b+c
P+CL~
L ~ c
b
b
Fig. 4. S u p e r s t r u c t u r e of the pressure swing distillation process
Fig. 5. S u p e r s t r u c t u r e of the m e m b r a n e process
3. R E S U L T S OF T H E M I N L P O P T I M I Z A T I O N
For each of the four processes a M I N L P optimization with respect to the a n n u a l cost h a s been carried out. During the optimization the total n u m b e r of stages, the feed stages, the recycle s t r e a m s as well as reflux and boil-up ratios are determined. The results for a feed s t r e a m of 10 mol/s with a composition of 9.4 mol% water, 11.3 mol% 2-propanol and 79.3 mol% methanol are shown in Figures 6-9. The specified product purities are 99.4 mol% for 2-propanol as well as for m e t h a n o l and 99.9 mol% for water. The columns in the figures are scaled r e g a r d i n g to t h e i r height and diameter. D1 (a)
I
~ "[.776
(: D2
C-1
~ 19
38 ~ 7 7 7
I
2~
I
KW
C-2 ~ i
287kW ID~
~
KW
E-1 L1-0,59F
C-3
~_6KW L2=0,1F 26
B2(c~
12 ... ~.
7 KW
IJ. B3(b)
Fig. 6. Optimized process structure for the azeotropic distillation
113
D2 ~ b " ~ 8 9 kW 3~
~D1 -- -766kW F 15
-
~
46 777 kW 1
c
I 16T:
E=0,12/~ C-2 ~.~-15 kW
C-1
38 T
entrainer makeup
93
_
kW
B2
Fig. 7. Optimized process structure for the extractive distillation
S=2,4F
~
~D
a
.~-816 kW
7
F
C-1 C-2 1 bar
15
29 38 ~
777 kW
31
c
C-3 3 bar ~
C-1
kW
F ,.. 2422 kW
40 2519kW
Fig. 8. Optimized process structure for the pressure swing distillation
30 ~ L ~J
855 kW
F2=0,26 F
Fig. 9. Optimized process structure for the membrane process
A comparison of the total costs, operating costs and annualized investment costs can be seen in table 1. The values include the costs for the column shells, the heat exchangers and the costs for the steam and coolant. The results show that the azeotropic and extractive distillation are mutual comparable in their specific costs and more favourable than the other two processes. The pressure swing
114 Table 1 Comparison of the four different processes Azeotropic distillation
Extractive distillation
Pressure swing Membrane distillation process
Operating costs [TDM]
47.9
38.6
276.9
96.7
Investment costs [TDM]
65.3
59.14
144.6
86.8
Total costs [TDM]
113.2
98
421.5
183.5
distillation needs high recycle streams due to the small variation of the azeotropic composition by the pressure change. This leads to much higher operating and investment costs due to larger columns and higher steam flows. It is obvious that this process is not competetive with the other ones. The pervaporation process is more expensive due to the higher costs for the coolant which is needed for the permeate and due to higher investment costs which include additionally the costs for a vacuum pump. In case the price for the special coolant could be reduced the total costs will become more comparable with the other processes. Nevertheless, as the concentration of methanol in the feed was very high, the total mole flow within the azotropic and extractive process was very low. It is assumed that the costs of these processes will rise and approach the costs of the membrane process if the concentration of methanol is smaller. In contrast the total costs of the pervaporation will be r a t h e r equal as long as the amount of water is approximately the same. Then the costs for the single column and the operation costs for the membrane will not change dramatically.
RERERENCES
[1] Stichlmair, J.; Fair, J.R.: Distillation - Principles and Practice, Wiley-VCH, New York 1998 [2] Bauer, M.H.: Synthese und Optimierung nichtidealer Rektifizierprozesse, PhD thesis TU Muenchen; 1997 [3] Glanz, S.: Synthese und Strukturoptimierung von Prozessen zur Trennung heterogener Fl~ssigkeitsgemische, PhD thesis TU Muenchen, 1998 [4] Pham, H.N.; Doherty, M.F.: Design and Synthesis of Heterogeneous Azeotropic Distillation - I I I Column Sequences; Chem. Eng. Sci.; 45 (1990) 7; 1845-1854 [5] Stichlmair, J.: Distillation and Rectification; in Ullmann's Encyclopedia of Industrial Chemistry; B33; 4; 1-94; VCH Verlagsgemeinschaft; Weinheim; 1988
huropean Symposium on Computer Aided Process Engineering - 10 S. Pierucci (Editor) 9 2000 Elsevier Science B.V. All rights reserved.
115
MINLP Optimization of Reactive Distillation Columns Th. Frey and J. Stichlmair Lehrstuhl ffir Fluidverfahrenstechnik, TU Mfinchen, Boltzmannstr. 15, D-85748 Garching, Germany, email:
[email protected] Reactive distillation, i.e. the simultaneous implementation of reaction and distillation in a counter current column, has proven to be quite advantageous for several reasons. The whole capacity of reactive distillation and its potential for chemical processes can only be shown at optimized reactive distillation processes. This requires a rigorous simulation and optimization of reactive distillation processes which leads to a Mixed Integer Non Linear Programming (MINLP) problem. This MINLP model is based on the concept of equilibrium stages. In addition to the rigorous formulation of the thermodynamic equilibrium it is necessary to develop an appropriate superstructure for the process to be optimized. To guarantee that the superstructure contains all physical relevant process alternatives, the definition of the superstructure is based on a thermodynamic background. The MINLP optimization can be performed with respect to minimum energy requirement or minimum total annual costs. The results are presented for the synthesis of methyl acetate. 1. I N T R O D U C T I O N In the last decade the interest in reactive distillation has continuously grown. The reasons therefore are quite advantageous synergy effects that arise from the simultaneous implementation of reaction and distillation in a single apparatus and the inherent superimposition of chemical equilibrium upon the vapor liquid equilibrium. Some of these effects are [ 1]: 9 Continuous withdrawal of products from the reaction section can lead even to total conversion of the reactants. 9 Undesired side reactions can be suppressed. 9 Heat of reaction can be utilized for the simultaneous distillation. Furthermore, it must be stated that conventional distillation boundaries, as azeotropes or border distillation lines, can be overcome by reactive distillation. As a negative side effect the superimposition of two equilibria may lead to so called reactive azeotropes [2]. In analogy to conventional distillation these reactive azeotropes form a barrier for reactive distillation. Thus, one of the necessary conditions for process synthesis and for the synthesis of appropriate superstructures for the MINLP-optimization is the determination of the location of reactive azeotropes and, in turn, the determination of possible products within a reactive distillation column. Until now, most of the works dealing with reactive distillation apply so called transformed compositions for the representation of the thermodynamic equilibrium [2,3]. The advantage of these transformed variables is that reactive distillation can be described in close analogy to conventional distillation, because the dimension of the valid concentration space is reduced by the number of chemical reactions. But the use of transformed compositions implies a severe disadvantage as a lot of information about the vapor-liquid equilibrium is lost. In an early stage of process design, as it is for the definition of a process superstructure for a MINLP-optimization, the use of transformed compositions may lead to structures that do not
116 comprise the optimal process configuration. Thus, a novel method for the determination of reactive azeotropes has been determined that is based on the collinearity of distillation and reaction steps [4]. Knowledge of the location and the type of reactive azeotropes is a necessary condition for the determination of possible products within a reactive distillation column and can be used for the design of appropriate superstructures. In previous works the methodology has been presented in detail for equilibrium and non equilibrium reactions [4,5]. In this paper the method is applied to the synthesis of methyl acetate. 2. D E T E R M I N A T I O N OF PROCESS STRUCTURES
The determination of the location and the type of potential reactive azeotropes leads to the definition of a process structure since possible products can easily be determined. This is to be presented for the synthesis of methyl acetate [6], which is one of the most important reactive distillation processes in industry and thus, experimental results are available and can be compared with the results of an optimization. Nevertheless, the method is generally applicable to multicomponent mixtures and even to kinetically controlled reactive distillation processes [5]. Figure 1a shows the tetrahedron of the mixture methyl acetate (a), methanol (b), water (c) and acetic acid (d). The letters a to d denote the substances in the order of increasing boiling temperatures. The mixture contains two minimum azeotropes, one between the methyl acetate and methanol, the other one between methyl acetate and water. Between these azeotropes there exists a distillation boundary. This distillation boundary together with a tangential pinch at the water edge impede the synthesis and purification of methyl acetate in a sequential process. Figure 1A also presents the chemical equilibrium saddle plane for the esterification of methanol and acetic acid towards methyl acetate and the by-product water. With the considered phase equilibrium the condition of collinearity between stoichiometric lines and tangent to residuum lines leads to no lines of possible reactive azeotropes. This condition is met only at the methanol/methyl acetate minimum azeotrope, that lies on the chemical equilibrium surface, i.e., this non reactive azeotrope is also a reactive azeotrope. All reactive distillation lines run on this equilibrium surface. They start at the high boiler acetic acid and end at the reactive minimum azeotrope. It can be seen that the desired products methyl acetate (a) and water (c) are no starting or ending points of reactive distillation lines. In Figure 1B this can be emphasized using the transformed compositions mentioned above [3]. This transformation is equivalent with a projection of the equilibrium plane along the main stoichiometric line on a two dimensional plane. Thus, the saddle surface of Figure 1a transforms into a square in Figure lB.
117
Figure 2: Superstructure for the synthesis of methyl acetate. In Figure 1B the course of the reactive distillation lines upon the chemical equilibrium plane is obvious. The desired product methyl acetate (a) and the byproduct water (c) do not lie on the same distillation line. Thus, the separation in a single feed reactive distillation column is not possible, as the reactive distillation line represents the liquid concentration profile of a reactive distillation column for total reflux. In conventional distillation, this limitation can be overcome by introducing a second feed stream into the column, as it is done in extractive distillation. In contradiction to the usual temperature profile within a distillation column, the high boiler is fed near the top of the column and the low boiler near the bottom. Between the two feed stages a physical absorption takes place and, in turn, products can be reached that do not lie on the same distillation line. The same can be done in reactive distillation. Figure 2 shows the structure of the column for the synthesis of methyl acetate. The high boiler acetic acid is fed near the top of the column. The low boiling reactant methanol is fed near the bottom of the reactive column, preferably as vapor. Within the reactive column, three different sections are necessary: a reactive section between the two feed stages, a conventional rectifying section above the acetic acid feed to separate methyl acetate from acetic acid and a conventional stripping section beneath the methanol feed to separate water from methanol. The degree of freedom that remains for a process optimization is still considerably high. There are three operating parameters that have to be optimized (condenser and reboiler duty together with the temperature of the liquid feed) and five geometric variables (total number of stages, number and location of reactive stages together with two feed stages). This problem has been formulated as a MINLP-problem. 3. M I N L P - M O D E L L Until now there are only a few works dealing with the MINLP-optimization of reactive distillation columns. Ciric and coworkers presented a MINLP-model for the optimization of the ethylene glycol production [7], but under the assumption of ideal vapor-liquid equilibrium.
118
Figure 3: Model of a reactive equilibrium stage. The MINLP model is based on equilibrium stages with the use of efficiencies when required. The model for the distillation sections has been taken from [8] and includes the MESH-equations on every stage with a rigorous description of the vapor-liquid equilibrium using the Wilson approach. The thermodynamic equilibrium upon a reactive stage is not calculated using a simultaneous approach as proposed in [9]. As we use an OuterApproximation/Equality-Relaxation/Augmented-Penalty algorithm for the solution of the M1NLP-problem [ 10], it is necessary to define a maximum number of possible stages, as well tbr reactive as for non reactive sections. Thus, there must be several stages within the column that have been defined as possible reactive stages but as a result of the optimization they turn out to be conventional distillation stages. A different description of a single phase equilibrium and a combined phase and chemical equilibrium would lead to a large number of equations on these trays that have to be solved during optimization although they are not relevant for the solution and therefore only deteriorate the convergence. Thus, the combination of two different equilibria occurring on a reactive stage has been split in two sub-problems (Figure 3). First the liquid xn-l,i from the stage above undergoes the chemical reaction. The equilibrium composition x i~q" that can be reached in this stage is calculated with respect to all nonidealities, i.e. also including the activity coefficients: K,~ = l-[ (x2'*' 9y,)"
(1)
i
In total, the number of equations that have to be solved for the chemical equilibrium section including the calculation of the value of temperature dependant equilibrium constants and the heat of reaction is 4n + 5. For a quaternary mixture this means that 21 additional equations have to be solved on each reactive stage. The liquid stream that leaves the reaction stage is calculated according to: iHI (2) X ,,I __ X , - l , i + breac.t,i 9 ,.tx~,, equ - x,_,j) where b,-~aa,, denotes the integer variable that represents the chemical reaction. If the integer variable b,.~aa,, equals 0, the term in brackets is not considered, i.e., no reaction occurs on this stage and, in turn, this stage is treated as a conventional distillation equilibrium stage. If the integer variable b,.ea~t,, equals 1, the equilibrium composition x2q" after chemical reaction is reached and, in combination with the following distillation section, the stage represents a reactive distillation stage. A sequence of these reaction and distillation sections combined in a reactive stage represents the model of a reactive distillation line as mentioned above and therefore is appropriate to describe the concentration profiles within a reactive distillation column.
119 A second advantage besides the decrease of the number of equations is, that this model can also be used to optimize kinetically controlled reactive distillation columns. Therefore, equation (2) must be rewritten into int
equ
x ,,,, = x ,_~,, + b ..... ,,, 9rl " ( x , , ,
- x
~,, )
(3)
The parameter r/represents the ratio of residence time of the liquid upon a reactive stage to the reaction rate. This ratio can also be expressed by a Damk6hler-Number. r/=
Da ~
(4)
Da+l
In contrast to a Damk6hler-Number, 77 is only defined for values between 0 and 1. In addition to the calculation of the equilibrium constant and the equilibrium composition, expressions for the reaction rate of the reaction have to be included. 4. RESULTS Figure 4 presents the results of an economic optimization of the superstructure presented in Figure 3. The objective function is the minimum of the total annual costs of the process, with the use of industry relevant cost functions [8]. It is assumed that a heterogeneous catalyst is applied, i.e., the reaction section can be located anywhere within the column. Each reactant is fed in an amount of 10 mole/s. The distillate contains 99 mole percent methyl acetate, the bottom product contains 96,3 mole percent water. The total annual costs of the column are 430 000 $. The total number of stages is 45. The reactive stages are located between the 10th and the 40 th stage. The condenser and reboiler duties are 788 kW and 606 kW, respectively. The liquid acetic acid is fed on stage 6 at a temperature of 349 K. It is quite advantageous to feed the vapor methanol at several stages between the 36 th and the 40 th. Looking at the concentration profiles published by [6,11] there are always two points of intersection between the water and the methanol concentration near the bottom of the column, i.e., on several stages near a single methanol feed the amount of methanol is higher than the amount of water. This ratio changes if one approaches the bottom of the column, as the whole methanol is vaporized and moves upwards the column to react with the acetic acid and the bottom products is almost pure water. This disadvantage can be overcome by multiple vapor feeding. Figure 4 presents the optimal solution which includes five methanol feed stages. Limiting the number of feed stages to two leads to similar results as shown in Figure 4. The methanol is introduced at the 35 th stage with an amount of 4.6 mole/s and at the 40 th stage with an amount of 5.4 mole/s. The total annual costs of the process increase by less than one percent. Similar to the results presented by [6,11 ] there exists an extractive section between the liquid acetic acid feed on stage 6 and the reactive section beginning on stage 10 (Figure 4a). Looking at the concentration profiles there is nearly no change in concentration on these four stages. In order to determine whether or not this extractive section is necessary for the separation or only advantageous as the costs for a reactive stage is higher than the cost for a conventional distillation stage, an energetic optimization has been carried out where the number of stages has been fixed to 45. As a result of this optimization the number of reactive stages is increased and the reaction section is located between stage 5 and stage 40. The liquid acetic acid is fed at stage 5 and 6, the methanol is fed between the stages 33 and 38. This implies that the extractive section in usual column designs is not necessary. Due to the multiple feeding of the reactants the energy demand is decreased by 11 kW to 595 kW.
120
Figure 4: Results of a rigorous economic optimization for the synthesis of methyl acetate together with the concentration profiles OUTLOOK As mentioned above, the model is formulated to consider further chemical reactions or reactions that do not reach equilibrium but are limited by their reaction kinetics. In this case the liquid holdup, i.e. the residence time of the liquid in the column plays a important role for the calculation of reactive distillation processes. This is to be shown for several kinetically controlled reactive distillation processes in near future. REFERENCES
1.
Doherty, M. F.; Buzad, G.; Reactive Distillation by Design; Trans I Chem E, Vol. 70 (1992) Part A, pp. 448-458 2. Barbosa, D.; Doherty, M. F.; The Influence of Equilibrium Chemical Reactions on VaporLiquid Phase Diagrams; Chem. Eng. Sci. 43 (1988), pp. 529-540 3. Ung, S.; Doherty, M. F.; Vapor-Liquid Phase Equilibrium in Systems with Multiple Chemical Reactions; Chem. Eng. Sci. 50 (1995) 1, pp. 23-48 4. Frey, Th.; Stichlmair, J.; Thermodynamische Grundlagen der Reaktivrektifikation; Chem. Ing. Tech. 70 (1998) 11, pp. 1373-1381 5. Frey, Th.; Stichlmair, J.; Reactive Azeotropes in Kinetically Controlled Reactive Distillation, Chem. Eng. Res. Des. 77 (1999) A7, pp. 613-618 6. Agreda, V. H.; Parin, L. R.; Heise, W. H.; High-purity methyl acetate via reactive distillation; Chem. Eng. Progr. 86 (1990) 2, pp. 40-46 7. Ciric, A. R.; Gu, D.; Synthesis of Nonequilibrium Reactive Distillation Processes by MINLP Optimization; AIChE Journal 40 (1994) 9, pp. 1479-1487 8. Bauer, M. H.; Synthese und Optimierung nichtidealer Rektifizierprozesse, PhD thesis, Technische Universitaet Muenchen, 1997 9. McDonald, C. M.; Floudas, C. A.; GLOPEQ: A New Computational Tool for the Phase and Chemical Equilibrium Problem, Comp. Chem. Eng. Vol. 21 (1997) 1, pp. 1-23 10. Viswanathan, J.; Grossmann, I. E.; A Combined Penalty Function and OuterApproximation Method for MINLP Optimization, Comp. Chem. Eng., 14 (1990) 7, pp. 769-782 11. Perrv. R. H-: Green-DW: Perry's Chemical Engineers' Handbook ,-]th ed McGraw-Hill
European Symposiumon ComputerAidedProcessEngineering- 10 S. Pierucci(Editor) 9 2000ElsevierScienceB.V. All rights reserved.
121
Batch Distillation Optimization with a Multiple Time-Scale Sequential Approach for Strong Nonlinear Processes M. Wendt, P. Li and G. Wozny Institut ftir Prozeg- und Anlagentechnik, Technische Universit~it Berlin, Sekr. KWT 9 Strage des 17. Juni 135, 10623 Berlin A multiple time-scale sequential strategy is proposed to solve batch distillation optimization problems possessing strong nonlinear properties. Large time intervals are allowed in the optimization layer for the sensitivity computation, while small intervals are adjusted to make sure the convergence of the Newton method in the simulation layer. This makes it possible to optimize batch distillation processes with an abnormal phase equilibrium behavior. The column pressure policy, which is usually a variable during the batch operation in the industrial practice, can also be optimized by the multiple time-scale framework. The results of an industrial batch distillation show the effectiveness and efficiency of the approach. 1. I N T R O D U C T I O N Batch Distillation is one of the most common processes in industry for separating liquid mixtures. Mostly batch distillation columns are still run by conventional policies derived by heuristic rules. Nevertheless, many investigations on new optimization strategies for batchdistillation have been done recently. Usually a large-scale dynamic optimization problem will be formulated for such processes. Methods to solve such a problem can be classified into simultaneous (Cervantes & Biegler, 1998) and sequential (Vassiliadis et al., 1994) methods. In the simultaneous methods, there is mathematically no real distinction between the state and the control variables. The model equations, which reduce the de