COMPUTER-AIDED CHEMICAL ENGINEERING, 26
19th EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING Edited by
. Jacek Jezowski Rzeszów University of Technology Al. Powsta´nców Warszawy Rzeszów Poland
and
Jan Thullie Faculty of Chemistry The Silesian University of Technology Poland
Amsterdam – Boston – Heidelberg – London – New York – Oxford Paris – San Diego – San Francisco – Singapore – Sydney – Tokyo
Elsevier Radarweg 29, PO Box 211, 1000 AE Amsterdam, The Netherlands Linacre House, Jordan Hill, Oxford OX2 8DP, UK First edition 2009 Copyright © 2009 Elsevier B.V. All rights reserved No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means electronic, mechanical, photocopying, recording or otherwise without the prior written permission of the publisher Permissions may be sought directly from Elsevier’s Science & Technology Rights Department in Oxford, UK: phone (+44) (0) 1865 843830; fax (+44) (0) 1865 853333; email:
[email protected]. Alternatively you can submit your request online by visiting the Elsevier web site at http://elsevier.com/locate/permissions, and selecting Obtaining permission to use Elsevier material 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 British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress ISBN (volume): 978-0-444-53433-0 ISBN (CD): 978-0-444-53441-5 ISSN: 1570-7946 For information on all Elsevier publications visit our web site at books.elsevier.com
Printed and bound in Hungary 09 10 11
10 9 8 7 6 5 4 3 2 1
xxi
Preface This book contains papers presented at the 19th European Symposium on Computer Aided Process Engineering ( ESCAPE-19 ) held in Cracow, Poland from 14th to 17th June 2009. Poland has the privilege to host the Conference for the first time but the Symposia have a long history and well-established tradition. The ESCAPE series started in 1992 at Elsinore, Denmark on a strong foundation of 23 events of the CAPE Working Party of European Federation of Chemical Engineering. The first event was organized in Tutzing, Germany, in 1968. The most recent ESCAPE symposia were organized in Garmisch-Partenkirchen, Germany, 2006, Bucharest, Romania, 2007 and Lyon, France, 2008. The series of ESCAPE symposia serves as a forum for engineers, scientists, researchers, managers and students, who are active in research and application of CAPE. Leading scientists from academia and practitioners from industry took part together with young researchers and PhD students. The works presented were often the mile-stone achievements in a steady progress of CAPE. The papers in the ESCAPE-19 Proceedings are organized in the following themes: product and process design, process control and operation, modelling, simulation, optimisation and process integration, new frontiers in CAPE, CAPE in sustainable development and, finally, energy systems and CAPE. About 350 abstracts were submitted to the conference. Out of them 303 authors were invited to submit an extended abstract (6 pages) and 233 were finally selected for oral or poster presentation. In addition to these contributions several plenary and key-note lectures by highly esteemed scientists and practitioners were invited. The review of abstracts and full version manuscripts were carried out by the members of International Scientific Committee and a group of the invited reviewers. We would like to thank all of them. Their effort was crucial in ensuring a high quality of ESCAPE 19 Symposium. This book is the tenth ESCAPE Symposium Proceedings included in the series on ComputerAided Chemical Engineering. We hope that it will serve as a valuable reference document and will contribute to the progress in computer aided process and product engineering.
Jacek JeĪowski Jan Thullie ESCAPE-19 Co-Chairmen
xxiii
International Scientific Committee Conference Co-chairmen Jacek JeĪowski, Rzeszów University of Technology, Poland Jan Thullie, Silesian University of Technology, Poland
Themes Coordinators Product and Process Design Lorenz T. Biegler, Carnegie Mellon University, USA Rafiqul Gani, Technical University of Denmark, Denmark
Process Control and Operation Johan Grievink, Delft University of Technology, The Nederlands Guenter Wozny, Berlin Institute of Technology, Germany
Modelling, Simulation, Optimisation and Process Integration Wolfgang Marquardt, RWTH Aachen University, Germany Natalia Menshutina, Mendeleyev University of Chemical-Technology, Russia Efstratios N. Pistikopoulos, Imperial College London, UK
New Frontiers in CAPE David Bogle, University College London, UK Andrzej Kraslawski, Lappeenranta University of Technology, Finland
CAPE in Sustainable Development Peter Glaviþ, University of Maribor, Slovenia BoĪenna Kawalec-Pietrenko, Technical University of GdaĔsk, Poland
Energy Systems and CAPE JiĜi Klemeš, University of Pannonia, Hungary Sandro Macchietto, Imperial College London, UK Toshko Zhelev, University of Limerick, Ireland
Members Serban Agachi, Babes Boyai University, Romenia Ana Barbosa-Povoa, Instituto Superior Tecnico, Portugal Bertrand Braunschweig, IFP, France Luis Cisternas, Universidad de Antofagasta, Chile Guido Dünnebier, Bayer Technology Services GmbH, Germany
xxiv
International Scientific Committee
Sebastian Engell, TU Dortmund, Germany Antonio Espuña, Technical University of Catalonia, Spain Michael Fairweather, University of Leeds, UK Georg Fieg, Hamburg University of Technology, Germany Christodoulos Floudas, Princeton University, USA Dominic Foo, University of Nottingham Malaysia, Malaysia Ferenc Friedler, University of Pannonia, Hungary Ignacio Grossmann, Carnegie Mellon University, USA Andrzej Górak, Technische Universitaet Dortmund, Germany Georges Heyen, Universite de Liege, Belgium Zdzisław Jaworski, Szczecin University of Technology, Poland Xavier Joulia, Université de Toulouse, France Sten Bay Jorgensen, Technical University of Denmark, Denmark Zdravko Kravanja, University of Maribor, Slovenia Milan Kubicek, Institut of Chemical Technology, Prague Thokozani Majozi, University of Pretoria, South Africa Henrique Matos, Instituto Superior Tecnico, Portugal François Marechal, Ecole Polytechnique Fédérale de Lausanne, Switzerland Claudio Oller Nascimento, Polytechnic School of University of Sao Paulo, Brazil Ka Ng, Hong Kong Univ of Science and Technology, China (Hongkong) Zdzisław Pakowski, Technical University of Lodz, Poland Sauro Pierucci, Politecnico di Milano, Italia Valentin Plesu, University Politehnica of Bucharest, Romania Heinz A. Preisig, Norwegian University of Science and Technology, Norway Luis Puigjaner, Universitat Politecnica de Catalunya, Spain Yu Qian, South China University of Technology, China Gintaras Reklaitis, Purdue University, USA Rajagopalan Srinivasan, National University of Singapore, Singapore Gennadiy Statyukha, National Technical University of Ukraine, Ukraine Andrzej Stankiewicz, Delft University of Technology, The Nederlands Natasha Vaklieva-Bancheva, Bulgarian Academy of Sciences, Bulgaria
Additional reviewers Joaquin Acevedo, Tecnologico de Monterrey, Mexico Cristhian Almeida-Rivera, Unilever Food & Health Research Institute, The Nederlands Harvey Arellano-Garcia, Berlin Institute of Technology, Germany Ton Backx, Eindhoven University of Technology, The Nederlands Paul I. Barton, Massachusetts Institute of Technology, USA George M. Bollas, Massachusetts Institute of Technology, USA Peter Bongers, Unilever Food & Health Research Institute, The Nederlands Neima Brauner, Tel-Aviv University, Israel
International Scientific Committee
Heiko Briesen, Max-Planck-Institute for Dynamics of Complex Technical Systems, Germany Jaime Cerdá, Intec, Argentina Paul Dalby, University College London, UK Loïc d'Anterroches, Céondo Ltd, UK Serge Domenech, LGC – INPT – ENSIACET, France Mario Eden, Auburn University, USA Mahmoud El-Halwagi, Texas A&M University, USA Eric Fraga, University College London, UK Duncan Fraser, University of Cape Town, South Africa Anton Friedl, Vienna University of Technology, Austria Mamdouh Gadalla, University Rovira i Virgili, Spain Michael Georgiadis, University of Western Macedonia, Greece Jacques Gouws, University of Pretoria, South Africa Bernhard Gutsche, Cognis Deutschland GmbH & Co. KG, Denmark Andre de Haan, Eindhoven University of Technology, The Nederlands Istvan Heckl, University of Pannonia, Hungary Tibor Holczinger, University of Pannonia, Hungary C.W Hui, Hong Kong Univ of Sci. & Tech., China (Hongkong) Laureano Jiménez, University Rovira i Virgili, Spain Eugeny Y. Kenig, University of Paderborn, Denmark Tony Kiss, AkzoNobel Chemicals, The Nederlands Antonis Kokossis, University of Surrey, UK Hon Loong Lam, University of Pannonia, Hungary Jean-Marc Le Lann, LGC - INPT – Ensiacet, France Patrick Linke, Texas A&M University at Qatar, Qatar Carlos Mendez, Intec, Argentine Alexander Mitsos, RWTH Aachen University, Germany Michael Modigell, RWTH Aachen University, Germany Eugeniusz Molga, Warsaw University of Technology, Poland Iqbal Mujtaba, University Of Bradford, UK Zoltan K. Nagy, Loughborough University, UK Zorka Novak-Pintaric, University of Maribor, Slovenia Nuno Oliveira, University of Coimbra, Portugal Sunwon Park, Kaist, Korea Alexandra Elena Plesu, University Politehnica of Bucharest, Romania Naveed Ramzan, University of Enginering and Technology, Pakistan Susana Relvas, Instituto Superior Tecnico, Portugal Jens-Uwe Repke, Berlin Institute of Technology, Germany Jan Schoeneberger, Berlin Institute of Technology, Germany Panos Seferlis, Aristotle University of Thessaloniki, Greece Mordechai Shacham, Ben-Gurion University of the Negev, Israel Gurkan Sin, Technical University of Denmark, Denmark Kai Sundmacher, Max-Planck-Institute for Dynamics of Complex Technical Systems, Germany Raymond Tan, De La Salle University-Manila, Philippines
xxv
xxvi
International Scientific Committee
Constantinos Theodoropoulos, The University of Manchester, UK Zoltán Varga, University of Pannonia, Hungary Xue Wang, University of Leeds, UK Werner Witt, Brandenburgicshe Technische Universität, Germany John M. Woodley, Technical University of Denmark, Denmark En Sup Yoon, Seoul National University, Korea
xxx
xxvii
National Organising Committee Co-chairmen Jacek JeĪowski , Rzeszów University of Technology, Poland Jan Thullie, Silesian University of Technology, Poland
Scientific Secretary Krzysztof Piotrowski, Silesian University of Technology, Poland
Members Jacek Kocurek, Silesian University of Technology, Poland Andrzej Gierczycki, Silesian University of Technology, Poland Łukasz Kurowski, Silesian University of Technology, Poland Janusz Wójcik, Silesian University of Technology, Poland Jerzy Raczek, Silesian University of Technology, Poland Robert Kubica, Silesian University of Technology, Poland Roman Bochenek, Rzeszów University of Technology, Poland Grzegorz Dzido, Silesian University of Technology, Poland Grzegorz Poplewski, Rzeszów University of Technology, Poland Agata KuĞ, Silesian University of Technology, Poland Magdalena Tuszkiewicz, Silesian University of Technology, Poland Marcin Lemanowicz , Silesian University of Technology, Poland
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
1
On the appropriate architecture of the water/wastewater allocation problem in process plants Miguel J. Bagajewicza and Debora C. Faria b a b
University of Oklahoma, 100E. Boyd St, Norman 73019, USA,
[email protected] University of Oklahoma, 100E. Boyd St, Norman 73019, USA,
[email protected]
Abstract We discuss the definition of the water/wastewater allocation problem as it was originally defined by Takama et al (1980), how this concept was modified and simplified through time, as well as additional issues that are still not properly addressed. We review a few attempts where parts of our view were pointed out and we further investigate the impact that proper modeling has on predictions of freshwater consumption and total annual cost. Keywords: water/wastewater allocation problem, recycle, end-of-pipe treatment
1. Introduction Water allocation problems (WAP) have been extensively studied and several approaches to solve it have been presented. A comprehensive review of methods presented up to 2000 is given by Bagajewicz (2000); additional overviews can be found in few books (Mann and Liu, 1999; Sikdar and El-Halwagi, 2001). In general, the methods can be divided into two big classes: those based on mathematical programming, and those based on graphical, heuristic or algorithmic methods. The most promising class is the one based on mathematical programming, originally proposed by Takama et al. (1980). Mathematical programming has become the procedure of choice, especially because of the inability of graphical, heuristic or algorithmic procedures to effectively provide rigorous solutions to multiple contaminant problems. In addition, objective functions like cost, number of connections, etc. are easier to handle using mathematical programming approaches. Although they were not exhaustively detailed, Takama et al. (1980) included a recycle of the water treated by the wastewater treatment. They also used discharge concentration limits that the involved regeneration processes have to comply. This was ignored by Wang and Smith (1994), the work that gave rise to the “water pinch” method, and by several subsequent papers (Doyle and Smith, 1995; Polley and Polley, 2000; Bagajewicz et al., 2000; Hallale, 2002; Koppol and Bagajewicz, 2003; Prakotpol and Srinophakun, 2004; Teles et al., 2008), including the review made by Bagajewicz (2000). All works that have omitted using discharge concentration limits when including regeneration units implicitly used the assumption that there is an end-of-pipe treatment that is able to bring the concentration of the contaminants down to these discharge limits. Among the works that have omitted the existence of discharge concentration limits, some do not consider any regeneration processes and others have included de possibility of having intermediate regeneration processes. In fact, the
2
M.J. Bagajewicz and D.C. Faria
former perform the optimization of the water-using subsystem, the work by Wang and Smith (1994) (water pinch) being among the first. The authors defined three possibilities of reducing freshwater consumption/wastewater (reuse, regeneration reuse and regeneration recycle) and then solve the problem by first allowing only the first possibility, which is reuse. For the second and third wastewater minimization possibility, Wang and Smith (1994) extend their method to allow regeneration-reuse and recycles. Even though they (and others) considered regeneration processes without considering discharge limits, there is no guarantee that the final stream does not need any further treatment. Thus, an implicit end-of-pipe treatment must exist to assure that the final wastewater is discharged with a concentration lower than the maximum allowed by environmental regulations. Although all these methods do not considered discharge limitations, the ones based on mathematical programming can more easily be adapted to include discharge limits. In the graphical approach used by Wang and Smith (1994) this task may not be simple. Although we are not the first to do it, we argue that if end-of-pipe treatment is included in the model, it should also be available as an option of reuse/recycle. In fact, there is no water system without any kind of regeneration process (even those that were classified as “end-of-pipe”). Thus, all water allocation problems must at least include one treatment unit. This conclusion was not made in previous literature. Many authors, however, have considered discharge concentration limits (Takama et al., 1980; Kuo and Smith, 1998; Gunaratnam et al., 2005; Karuppiah and Grossmann, 2006; Alva-Argáez et al., 2007; Ng et al.,2007a,b; Putra and Amminudin, 2008). In reality, the addition of discharge limits constraint normally assumes all the reuse/recycle opportunities without clearly defining or singling out specifically an end-of-pipe treatment. To consider discharge limits and more than one regeneration unit, Kuo and Smith (1998) adapted the method presented by Wang and Smith (1994). They addressed the issue as an interaction among the water-using subsystem, regeneration subsystem and effluent treatment subsystem. The proposed approach can only handle water-using units with fixed mass load. Later, Ng et al. (2007a, b) presented a new graphical procedure to deal with water-using units with fixed flowrates. The intricacies that arise over this issue have not been thoroughly made clear in previous work. In addition, recently developed mathematical programming modeling techniques have not been used to obtain networks with such recycle. Thus, in this article we discuss the consequences of ignoring the existence of at least an end-of-pipe treatment (and consequently the reuse/recycle of the stream treated by it) and the different architectures the WAP problem models can be based on. We also discuss the addition of another subsystem giving raise to a more comprehensive definition of the water allocation problem. The paper is organized as follows: we first present the problem statement and discuss different superstructures. We then discuss previous work and later present the corresponding mathematical model. Finally, several examples are presented to illustrate the differences.
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
3
2. Water System Architecture We define the problem first: Given a set of water using units, a set of freshwater sources with corresponding contaminant concentrations (some usually zero), potential intermediate regeneration processes and a wastewater end-of-pipe treatment unit, one wants to obtain a water/wastewater-reuse/regeneration network that optimizes a given objective with any discharged water (if any) complying with contaminant discharge limits. The above problem statement has different forms depending on the level of detail of the model and the nature of the objective function. In its simplest form, the most popular objective function is the freshwater consumption with an implicit end-of-pipe treatment and no regeneration: This is one of the problems addressed by the now popular technology called “water pinch” (Wang and Smith, 1994) applied to single component cases. The above definition, which has been used by several researchers, implicitly assumes that the end-of-pipe treatment is able to reduce the contaminants concentrations to their discharge limits, and it does not include specifically the possibility of re-using water from the end-of-pipe treatment, although it does not exclude it. Thus, the simplest form of the problem is a water/wastewater reuse system with an assumed end-of-pipe treatment to adjust water to discharge limits (Figure 1). This allows the decomposition of the problem into two parts: Water using Subsystem and End-of-Pipe treatment. Wang and Smith (1994) and several subsequent articles used this assumption.
Figure 1 – Water/wastewater reuse system with end-of-pipe treatment.
Takama et al. (1980) discussed a typical system used in refineries (Figure 2) in which the two subsystems, water-using subsystem and wastewater treating subsystem, are individually optimized regardless of the interaction introduced by the recycle. It shows a recycle of non-treated water and mix it with the freshwater, a scheme that is not necessarily general enough to cover the concept of reuse as we understand it nowadays. In addition, the recycle of treated water is not taken from the discharge stream, possibly indicating that the concentration of pollutants in this stream does not have to be necessarily the same as in the discharge stream. In turn, they suggest the integration of both systems in a total system without define an end-of-pipe treatment. Instead, they handle the regeneration processes that compose the end-of-pipe treatment individually and add discharge limits to the problem. This is what is called “integrated system” or
M.J. Bagajewicz and D.C. Faria
4
“total water system”. Although their model allows connections from any process (waterusing or treatment units) to any other, the solution presented by them did not show any regeneration reuse/recycle. Despite the early appropriate architecture posed by Takama et al. (1980), Wang and Smith (1994), the paper that revived the field did not include the aforementioned recycle from all existing treatments (specifically the end-of pipe treatment in this case).
Treated Water Non-treated Water
Freshwater
Water Using Subsytem
Wastewater Treatment Subsystem
Discharge
Figure 2 – Independently distributed freshwater and wastewater networks (Adapted from Takama et al., 1980).
Later, Kuo and Smith (1998) have pointed out the importance of the interaction of the three subsystems (water-using system, regeneration system and effluent treatment system) as an improvement of the work presented by Wang and Smith (1994). The later had only considered the interaction between water-using and regeneration systems. In reality, the use of the stream treated by the end-of-pipe treatment starts to play an important role not only from the freshwater consumption point of view, but also in the costs of the whole system. Increasing of freshwater costs, declining of water quality in the available freshwater sources and costs ratio between end-of-pipe treatment and intermediate regeneration processes can influence the trade-offs of recycling or not the stream treated by the end-of-pipe treatment. End-of-pipe treatment recycling can also show enormous advantages when retrofit projects are analyzed. For this case an end-ofpipe treatment already exists and therefore eventually no or very small capital cost is required. Not only the possibility of recycling the stream treated by the end-of-pipe treatment may be an alternative to be analyzed, but also different network structures of the wastewater treatment subsystem may be preferred for technical and/or layout issues. We now discuss some of these possibilities: First, consider a water/wastewater reuse system and a centralized as well as sequential wastewater treatment subsystem with a recycle of water that complies with discharge limits. Another possibility is a centralized but distributed wastewater treatment subsystem. In both cases, the centralization is more than geographical: it includes collecting all wastewaters and mixing them in one single stream before treatment. As an alternative, one can envision a centralized and distributed treatment system in the sense that no mixing of all wastewaters takes place and multiple streams feed it. Finally, one can consider a completely decentralized treatment, which is known as integrated
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
5
system (or total water system). We note that allowing flows from any treatment unit in the previous case to be recycled is equivalent to the integrated system. In the limit, the integrated system may become a zero-liquid discharge cycle. These are extensions of the classification proposed by Bagajewicz (2000). Indeed, several researchers have included a regeneration step aiming at reusing the water, but still assuming that the end-of-pipe treatment is present to render a stream with pollutants concentrations below discharge limits. In most cases, this is assumed and not included in the model as no recycle of the stream treated by the end-of-pipe treatment is added. Thus, definitions of the problem are related to the configuration of each subsystem, but also they can be related to its boundaries. Without loss of generality, the evolution of the water allocation problem is presented in Figure 3. This figure shows the different definition of the water allocation problem related to the boundary assumed for the system. Each of the subsystems can exhibit the different options of reuse/recycle previously discussed. An additional structure that has not been investigated yet can generate further trade-offs in the water allocation problem. Although all the definitions of the problem state a set of freshwater sources, the issue of having more than one freshwater quality sources with different costs associated has not been widely studied. In fact, we can define these different freshwater qualities as part of another subsystem: the water pretreatment subsystem. Figure 3c exemplifies the suggested new water allocation problem structure that should be solved to completely include all the possibilities of water integration. As in the wastewater treatment subsystem, both capital and operating cost are associated to the existence and capacity of water treatments that determine the available capacity for each freshwater source. One of the reasons of omitting this subsystem is the fact that such analysis only becomes relevant when cost is analyzed. Otherwise, when freshwater consumption is the target, the source with highest quality (that is, lowest contaminant concentration) is the preferred one and this issue becomes irrelevant. It is also important to note here that the different freshwater sources are not only competing with each other, but more important, they are competing with water reuse and/or recycles from intermediate regeneration processes. In fact, the idea of complete water integration system is to break the boundaries of the subsystems and make use of all available regeneration processes, including the ones available in the water pre-treatment system. We discuss several instances of articles that have discussed some of the aforementioned architectures, explicitly or implicitly, next. We later present the model and we show some examples of grassroots and retrofit cases where the use of an appropriate architecture makes a big difference.
M.J. Bagajewicz and D.C. Faria
6
Figure 3 – Evolution of water allocation problem (a – Optimization of water-using subsystem; b – Integrated system; c – Complete water integration).
3. The Non-linear Model The non-liner model to solve the water allocation problem is given by: Water balance at the water-using units
¦ FWU
w,u
w
+
¦ FUU
u *,u
+
u*
¦ FRU
r ,u
r
=
¦ FUS
u,s
s
+
¦ FUU
u ,u *
u*
+
¦ FUR
u ,r
∀u (1)
r
where FWU w ,u is the flowrate from freshwater source w to the unit u, F U U u *, u is the flowrates between units u* and u, F R U r , u is the flowrate from regeneration process r to unit u, FUS u *, s is the flowrate from unit u to sink s and FU Ru *, r is the flowrate from unit u to regeneration process r. Water balance at the regeneration processes
¦ FUR
u,r
u
+
¦ FRR
r *, r
r*
=
¦ FRU u
r ,u
+
¦ FRR
r ,r*
r*
+
¦ FRS s
r ,s
∀r
(2)
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
7
where FRR r *, r is the flowrate from regeneration process r* to regeneration process r and F R S r , s is the flowrate from regeneration process r to sink s. Contaminant balance at the water-using units
¦ ( CW
w, c
w
(
)
(
)
out FWw ,u ) + ¦ FUU u *,u , c Cuout *, c + ¦ FRU r ,u , c CRr , c + Δ M u , c
(
u*
)
(
r
)
(
out out = ¦ FUU u ,u *, c Cuout , c + ¦ FUS u , s , c Cu , c + ¦ FURu , r , c Cu , c u*
s
r
)
∀u , c
(3)
where C W w , c is concentration of contaminant c in the freshwater source w, Δ M u , c is the mass load of contaminant c extracted in unit u, Cuout,c is the outlet concentration of contaminant c in unit u, and CRrout , c is the outlet concentration of the not treated contaminant c in regeneration r . Maximum inlet concentration at the water-using units
¦ ( CW
w ,c
w
FW w , u ) +
¦ ( FUU
where C u.
) ¦ ( FRU
C uout * ,c +
u*
in, max § ≤ C u,c ¨ ©
in, max u,c
u *, u , c
¦
r ,u , c
r
FUW w , u +
¦
FUU u *, u +
u*
w
¦ r
CR rout ,c
)
· FRU r , u ¸ ¹
(4) ∀u, c
is the maximum allowed concentration of contaminant c at the inlet of unit
Maximum outlet concentration at the water-using units out, max Cuout ∀u , c * ,c ≤ Cu,c
(5)
out, max where C u,c is the maximum allowed concentration of contaminant c at the outlet of unit u.
Capacity of the regeneration processes FRr =
¦ FUR + ¦ FRR u, r
u
r *, r
∀r
(6)
r*
where FRr is capacity of regeneration process r. Contaminant balance at the regeneration processes F R r , c C R rin, c =
¦ ( FU R u
u ,r ,c
) ¦ ( FR R
C uout + ,c
r *, r , c
C R rout *, c
r*
in out CRrout , c = CRr ,c (1 − XCRr ,c ) + CRFr ,c XCRr ,c
∀r, c
)
∀r, c
(7) (8)
where CRrin, c is the concentration of contaminant c at the inlet of regeneration process r,
CRFrout , c is the outlet concentration of contaminant c in regeneration process r and X C R r ,c
is a binary parameter that indicates if contaminant c is treated by regeneration
M.J. Bagajewicz and D.C. Faria
8
process r. We assume that CRFrout , c , the concentration of the treated contaminant is known and constant. Maximum allowed discharge concentration
¦ ( FUS
u , s ,c
) ¦ ( FRS
out Cu,c +
u
r , s ,c
r
out discharge , max § CRr,c ≤ C s,c ¨ ©
)
¦ FUS u
u,s
+
¦ FRS r
r ,s
· ¸ ¹
∀s , c (9)
discharge , max where Cs,c is the maximum allowed concentration at sink s.
Minimum flowrates It is well known that many solutions of the water problem may include small flowrates that are impractical. To avoid these we use the following constraints FWU w,u ≥ FWU wMin ∀w, u ,u YWU w,u
(10)
FUUu,u* ≥ FUUuMin ,u* YUUu ,u* ∀u, u *
(11)
FUSu, s ≥ FUSuMin ∀u, s , s YUSu , s
(12)
FURu ,r ≥ FUR
Min u ,r
FRUr,u ≥ FRU
Min r ,u
YURu,r ∀u, r
YRUr,u ∀r, u
(13) (14)
FRRr , r* ≥ FRRrMin , r * YRRr , r * ∀r , r *
(15)
FRSr , s ≥ FRSrMin ∀r , s , s YRS r , s
(16)
which uses a set of binary variables ( YWUw,u , YUUu,u* , YUS u , s , YURu , r , YRU r ,u , YRRr , r* and YRS r , s ) that are equal to one when the corresponding flowrate is different from zero and zero otherwise. Maximum flowrates To ensure that the connections do not surpass maximum values, we use the following constraints:
FWUw,u ≤ FWUwMax ,u YWUw,u ∀w, u FUUu,u* ≤ FUUuMax ,u* YUUu,u* ∀u, u *
(17) (18)
FUSu,s ≤ FUSuMax ,s YUSu,s ∀u, s
(19)
FURu,r ≤ FURuMax ∀u, r , r YURu , r
(20)
FRUr ,u ≤ FRUrMax ,u YRUr ,u ∀r, u
(21)
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
9
FRRr ,r* ≤ FRRrMax , r * YRRr , r * ∀r, r *
(22)
FRSr ,s ≤ FRSrMax , s YRSr , s ∀r, s
(23)
Objective functions Minimum freshwater consumption: Min
¦¦ FWU w
(24)
w,u
u
Minimum total annual cost: ª Max « OP «¬
º § § ·· ¨¨ ¦¦ α w FWU w, m + ¦ OPN r ¨ ¦ FUN m , r + ¦ FNN r *, r ¸ ¸¸ − af FCI » »¼ r r* © m ¹¹ © w m
(
)
(25)
where OPN r are the operational cost of the regeneration processes, FUNm,r are the flowrates between the water using units and the regeneration process r and FNNr*,r are the flowrates between two regeneration processes. OP is the hours of operation per year. The last term is the annualized capital cost, where FCI is the fixed capital cost and af is any factor that annualizes the capital cost (usually 1/N, where N is the number of years of depreciation). The fixed capital of investment is calculated using the sum of the piping costs and the new regeneration units costs as follows: § YWU w, m ICWU w, m + (YUN m,r ICUN m, r + YNU m ICNU m ) · ¨ w∈W ¸ r∈R FCI = ¨ ¸ YUU m, m* ICUU m, m* + YUSm ICUSm m∈M ¨ + ¸ © m*≠ m, m*∈M ¹ § · 0.7 + ¨ YNN r , r * ICNN r ,r * + YNSr ICNSr + ICN r ( RegCapr ) + YNSr ICNSr ¸ ¨ ¸ r∈R © r *≠ r ; r *∈R ¹
¦
¦
¦
¦
¦ ¦
(26)
All the above equations need to be tailored to the specifics of each system: 1 - In the case of the system of a centralized sequential treatment system with fixed structure, we set FUS u , s to zero and we consider only one treatment with all fixed outlet concentrations, which can be the called end-of-pipe treatment. Thus, equations (7) and (8) are not necessary and CRrout , c can be substitute by
CRFrout , c , which is a parameter. When recycle is not allowed, F R U r , u is also set to zero. 2 - In the case in which the treatment is centralized but distributed, the wastewater treatment system can be individually optimized. In fact, for this system, the water using subsystem could be first optimized and then the treatment subsystem is
M.J. Bagajewicz and D.C. Faria
10
optimized using the output of the water subsystem as input of the treatment subsystem. However a better procedure would be to individually optimize both systems while a connection between them still exist. To achieve that, we introduce a fictitious unit uf. This unit is actually a mixer and have all ΔM u f ,c =0. The connection between the two system is done allowing only the fictitious unit to send water/wastewater to the regeneration processes: FUSu , s = 0 ∀u, s, FURu,r = 0 ∀u ≠ u f , r . In addition, the distributed treatment system has also to be individually optimized and may render concentrations that are smaller than the discharge limits. Thus, we also introduce a fictitious regeneration unit rT with all XCRr , c =0 (no treatment) and we then make T
Max r,s
FRS
= 0 ∀r ≠ rT , s as well as FRUrMax ,u = 0 ∀r ≠ rT , u
. 3 - In the case of decentralized system without regeneration reuse/recycle, we keep the concepts presented for the centralized distributed system, but the fictitious unit is no longer needed. On the other hand, the fictitious regeneration is still needed. In the case of an integrated system, we keep all our equations.
4. Illustrations To illustrate our point of view we first present a single contaminant case, which was originally solved as a water-using unit subsystem problem (no regeneration processes and consequently no discharge limits). With this example we show that freshwater consumption can be reduced if the recycle of the end-of-pipe treatment is allowed. Then a lager multiple contaminant problem is analyzed. This problem was originally solved without discharge limits (but allowing intermediate regeneration processes). With this example we present networks that have different arrangements of the wastewater treatment subsystem and show that the recycle of the stream treated by the end-of-pipe treatment can also reduce costs. In a third example, we return to a case of single contaminant and show the impact of considering the freshwater treatment subsystem. 4.1. Example 1 This is a single contaminant network adapted from Wang and Smith (1994), which was solved by them through pinch analysis. The limiting process data for this problem are shown in Table 1 and it has a freshwater consumption without reuse (conventional network configuration) of 112.5 ton/hr.
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
11
Table 1 - Limiting data for Example 2. Process Number
Mass load of contaminant
Cin (ppm)
Cout (ppm)
1
2 kg/hr
0
100
2
5 kg/hr
50
100
3
30 kg/hr
50
800
4
4 kg/hr
400
800
When the end-o-pipe recycling is not allowed, the freshwater consumption can reach a minimum of 90 ton/hr. With the recycle (assuming an end-of-pipe exit concentration of 5 ppm), the minimum consumption is 20 ton/hr. This could be calculated using the “water-pinch” graphical method. However, here we would like to further analyze cost and thus mathematical programming seems to be more appropriate. Freshwater is assumed to be Įi($/ton)=0.3 and the system operates OP(hours/year)=8600. There is one freshwater source free of contaminants and the end-of-pipe treatment has an outlet concentration of 5 ppm, which is the maximum concentration allowed for disposal. The operating cost of the end of pipe treatment is OPN r ($ / ton ) = 1.0067 and the investment cost is ICN r ($ / ton 0.7 ) = 19,400. The capital costs with connections are presented in Table 2. Table 2 - Capital costs of the connections. Unit 1
Unit 2
Unit 3
Unit 4
End-of-pipe treatment
FW
$39,000
$76,000
$47,000
$92,000
-
Unit 1
-
$150,000
$110,000
$45,000
$83,000
Unit 2
$50,000
-
$134,000
$40,000
$102,500
Unit 3
$180,000
$35,000
-
$42,000
$98,000
Unit 4
$163,000
$130,000
$90,000
-
$124,000
EoPT
$83,000
$102,500
$98,000
$124,000
-
We first analyze the grassroots design case. The network with minimum total annual cost (TAC) without allowing the recycle of the stream treated by the end-of-pipe treatment is presented in Figure 4. This network has a total annual cost of $1,105,352.
Figure 4–Example 1 -End-of-pipe recycling not allowed – Minimum TAC at minimum consumption.
12
M.J. Bagajewicz and D.C. Faria
Allowing the option of recycle the stream treated by the end-of-pipe treatment reduces the minimum freshwater consumption to 20 ton/hr. This represents reduction of approximately 78%, with is very significant. Figure 5 shows the minimum TAC network for the grassroots when end-of-pipe recycling is allowed, which costs $826,091.
Figure 5 –Example 1 - End-of-pipe recycling allowed – Minimum TAC at minimum consumption.
4.2. Example 2 We consider the refinery case presented by Koppol et al. (2003). This example has four key contaminants (salts, H2S, Organics and ammonia) and six water-using units. The limiting data of the water-using units are shown in Table 3. This network without reuse (conventional network) consumes 144.8 ton/hr of freshwater. Unlike the original problem, the following discharge limits are included I this problem: 15ppm for salts, 5ppm for H2S, 45ppm for organics and 20ppm for ammonia. It is also considered the existing end-of-pipe treatment is able to reduce the contaminant to these discharge limits (what is the assumption used when the end-ofpipe treatment is not explicitly included in the model) and no concentration limit is imposed at its inlet. Some of the different cases of recycle previously described are discussed in this example: First we analyze the network without the addition of any regeneration processes; Then, the addition of regeneration processes is allowed and the different structures are analyzed (centralized systems and total water system). End-of-pipe treatment recycling and not recycling options are analyzed for all the aforementioned cases.
4.2.1. No additional regeneration process In this case only the water-using units and the conventional end-of-pipe treatment are assumed. The minimum freshwater consumption achieved when end-of-pipe recycling is not allowed is 119.33 ton/hr. The minimum total annual cost (TAC) is found to be $2,291,654, which is also a network that operates at the minimum freshwater consumption. This solution is presented in Figure 6.
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
13
Table 3 – Limiting data of Example 4. Process
1 - CausticTreating
2 - Distillation
3 – Amine Sweetening
4 - Merox-I Sweetening
5 - Hydrotreating
6 – Desalting
Contaminant Salts Organics H2S Ammonia Salts Organics H2S Ammonia Salts Organics H2S Ammonia Salts Organics H2S Ammonia Salts Organics H2S Ammonia Salts Organics H2S Ammonia
Mass Load (kg/hr) 0.18 1.2 0.75 0.1 3.61 100 0.25 0.8 0.6 30 1.5 1 2 60 0.8 1 3.8 45 1.1 2 120 480 1.5 0
Cin,max (ppm) 300 50 5000 1500 10 1 0 0 10 1 0 0 100 200 50 1000 85 200 300 200 1000 1000 150 200
Cout,max (ppm) 500 500 11000 3000 200 4000 500 1000 1000 3500 2000 3500 400 6000 2000 3500 350 1800 6500 1000 9500 6500 450 400
Figure 6 –Example 2.1 -Only end-of-pipe treatment, End-of-pipe recycling not allowedMinimum Consumption
When recycling from end-of-pipe treatment is allowed, the minimum consumption can reach 33.57 ton/hr, which is approximately 72% lower than the earlier solution. The minimum TAC ($2,062,799) for this case is also found at the minimum freshwater consumption. Figure 7 shows the network corresponding to this solution. Note that this solution does not need any additional regeneration processes. However the end-of-pipe
M.J. Bagajewicz and D.C. Faria
14
capacity is significantly increased. Thus, cost analysis may favor the addition of intermediate regeneration process that specifically treat one (or more) contaminant(s) and consequently require lower capacities. This issue is analyzed next.
Figure 7 – Example 2.1 - Only end-of-pipe treatment - End-of-pipe recycling allowed -Minimum Consumption
4.2.2. Additional regeneration processes The example previously presented is now solved for a case in which there are other three regeneration processes available: Reverse osmosis, which reduces salts to 20 ppm; API separator followed by ACA, which reduces organics to 50 ppm; and, Chevron wastewater treatment, which reduces H2S to 5 ppm and ammonia to 30 ppm. First we present solutions for a centralized sequential wastewater treatment system. For both solutions (allowing and not allowing the end-of-pipe recycling) the minimum freshwater consumption is 33.57 ton/hr. Besides minimum freshwater consumption, total annualized cost can be further analyzed as a competitive advantage. Freshwater cost is $0.32/ton and the plant operates 8600 hours/year. The end-of-pipe treatment has a capital cost of $30,000/ton0.7 and an operating cost of $1.80/ton. The costs of the potential additional regeneration processes are presented in Table 4. To cost with connections are presented in Table 5. Here only the costs from the units to the centralized system are considered. The costs with connections between regeneration processes are ignored. The minimum TAC obtained for the case in which the end-of-pipe recycling is allowed is presented in Figure 8. Note that the minimum TAC for this case happens at a freshwater consumption other than the minimum (38.983 ton/h). This network has a total annual cost of $1,351,250 and uses two of the three available additional regeneration processes. Table 4 – Costs of the potential regeneration processes. Regeneration Process API separator followed by ACA Reverse osmosis Chevron wastewater treatment
Capital Cost ($/ton0.7)
Operating Cost ($/ton)
$25,000 $20,100 $16,800
0.12 0.56 1.00
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
15
Table 5: Capital costs of the connections. $(x103)
U1
W1
23
50
18
63
16
25
-
-
U1
-
50
110
45
70
42
53
53
U2
50
-
34
40
11
35
51
51
U3
110
34
-
42
60
18
62
62
U4
45
40
42
-
23
34
78
78
U5
70
11
60
23
-
28
58
58
U6
42
35
18
34
28
-
22
22
Centralized System
53
51
62
78
58
22
-
-
EOP
53
51
62
78
58
22
-
-
U2
U3
U4
U5
U6
Centralized System
EOP
Figure 8 –Example 2.2 -centralized sequential scheme when end-of-pipe recycling is not allowed – minimum TAC.
The minimum total annual cost obtained using the centralized sequantial scheme when end-of-pipe recycling is allowed is presented in Figure 9. This network has a total annual cost of $1,292,431 and operates at the minimum freshwater consumption. Note that, allowing the end-of-pipe recylcing, only API separator is needed as additional regeneration process. The centralized distributed system is analyzed next. This scheme corresponds to the one presented in Figure 4. The solution for minimum TAC without recycle of the end-ofpipe treatment is presented in Figure 10. Not that again the minimum TAC for this case does not happen at the minimum freshwater consumption of the system. This network also operates at 38.983 ton/h and has a TAC of $1,330,124. Like the previous case, the suggested network has two regeneration processes. The major difference is due to the distributed system that allows different flowrates to be treated by the different regeneration processes.
16
M.J. Bagajewicz and D.C. Faria
Figure 9–Example 2.2 - Centralized sequential scheme -End-of-pipe recycling is allowed.
Figure 10 –Example 2.2 -Centralized distributed scheme -End-of-pipe recycling is not allowed – Minimum TAC.
When end-of-pipe recycling is allowed, the minimum TAC is found at the minimum consumption. This network is the same as the one found when centralized sequential system was analyzed (Figure 9). 4.2.3. Integrated system (or Total water system) Now the integrated system is considered. The optimum solution for both cases, allowing and not allowing the recycle of the stream treated by the end-of-pipe treatment, is able to reach the minimum freshwater consumption of 33.571 ton/hr. The optimum network without end-of-pipe treatment recycling (Figure 11) has a total annual cost of $1,093,018 and a freshwater consumption of 38.876 ton/hr, which is higher than the minimum possible. Once again, forbidding the recycle of the stream treated by the end-of-pipe treatment requires two of the three regeneration processes available. When end-of-pipe recycling is allowed in the total water system scheme, the minimum total annualized cost can reach $1,065,449. This solution (Figure 12) is referred to a network that operates at the minimum freshwater consumption of the system (33.571 ton/hr). Different from the previous cases that handle end-of-pipe treatment recycling, this network has two regeneration processes in which different flowrates are treated.
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
17
Figure 11 –Example 2.3 - End-of-pipe recycling is not allowed – Minimum TAC.
Figure 12 – Example 2.3 - End-of-pipe recycling allowed – Minimum TAC.
4.3. Example 3 In this example we show the simplest form of the suggested complete water integration system. We use a single contaminant problem to illustrate and assume that the water pre-treatment subsystem cannot receive water from the other two subsystems. The limiting data is presented in Table 6. Note that unit two has a maximum outlet concentration of 20ppm and the end-of-pipe treatment has an outlet concentration of 25ppm, which coincides with the discharge limit. We used the same capital and operating cost of the end-of-pipe treatment as well as connection costs of example 1.
M.J. Bagajewicz and D.C. Faria
18
Table 6 - Limiting data for Example 2. Process Number
Mass load of contaminant
Cin (ppm)
Cout (ppm)
1
2 kg/hr
0
100
2
5 kg/hr
20
100
3
30 kg/hr
50
800
4
4 kg/hr
400
800
Two different qualities of freshwater are available at different costs. At the moment we only assume the pre-treatment subsystem as a sequential system that does not necessarily need to treat all freshwater to the highest quality. This scheme is presented in Figure 13.
Figure 13 – Water pre-treatment subsystem.
Note that we also do not consider the possibility of recycling water from the waterusing subsystem and/or wastewater treatment subsystem to the water pre-treatment subsystem. Although these possibilities may offer important advantages, this is not analyzed in this paper and will be detailed investigated in a future work. We assume that the pre-treatment 1 can bring the freshwater down to 10ppm and pretreatment 2 can further treat it down to 0ppm. Pre-treatment 1 has an operating cost of $0.30/ton and a capital cost of $8,500/ton0.7. The operating cost of pre-treatment 2 is $0.50/ton and the capital cost is $10,500/ton0.7. Figure 14 shows the solution found when the complete water integration system scheme is applied and total annual cost is minimized. Recycles from the water using units to the water pre-treatment units is not allowed. Note that both types of freshwater are used and that freshwater treated by only pre-treatment 1 is mixed with the recycle of the end-of-pie treatment before it feeds unit 2. This network has a TAC of $1,258,480.
Figure 14 – Example 3 - Complete water integration system scheme – Recycle of end-of-pipe treatment allowed (WPT: Water pre-treatment process).
On the Appropriate Architecture of the Water/Wastewater Allocation Problem in Process Plants
19
If the same problem is solved considering only freshwater 2 (that is, solved as an integrated system), the minimum TAC found was $1,289,870. This network is presented in Figure 14. The network found in this case only differs from the previous one exactly in the water pre-treatment subsystem. This is an indication of the importance of this issue on the water allocation problem. Moreover, if one looks at this problem from the freshwater consumption point of view, the solution presented in Figure 15 is better than the one in Figure 14. However, in Figure 15 the overall cost of the water pre-treatment system is higher the one in Figure 14. This new trade-off created by the addition of the water pre-treatment subsystem is one of the reasons why the complete water integration system become very important when costs are analyzed.
Figure 15 – Example 3 - Integrated system scheme - Recycle of end-of-pipe treatment allowed (WPT: Water pre-treatment process).
We also investigate the previous cases forbidding the recycle of the end-of-pipe treatment. Figure 16 shows the solution found when the complete water integration system scheme is used. This network has a total annual cost of $1,318,436. For the integrated system scheme case, the optimum network found has a TAC of $1,536,684 and consumes 90ton/h of freshwater. This network has the same structure presented in example 1 (Figure 4).
Figure 16 – Example 3 -Complete water integration system scheme – Recycle of end-of-pipe treatment not allowed (WPT: Water pre-treatment process).
5. Remarks We have discussed some of the different structures used to model the water allocation problem. These structures vary with the different assumption used in each of the subsystems as well as with the recycles that are allowed. We have shown through examples that different structural choices can make significant changes. In essence, we conclude that when the proper architecture is used, i.e. all recycles among the originally proposed subsystems are allowed and the treatment systems are distributed (not sequential), then the boundaries among these subsystems can be erased, reducing the problem to one big superstructure where all connections are allowed. This is the only route to achieve zero liquid discharge cycles.
20
M.J. Bagajewicz and D.C. Faria
References Alva-Argáez, A., Kokossis, A.C. and Smith, R. (2007). A conceptual decomposition of MINLP models for the design of water-using systems. International Journal of Environment and Pollution, 29, 177-105. Bagajewicz, M.J. (2000). A review of recent design procedures for water networks in refineries and process plants. Computer and Chemical Engineering, 24, 2093. Bagajewicz, M. J., Rivas, M. And Savelski, M. J. (2000). A robust method to obtain optimal and sub-optimal design and retrofit solutions of water utilization systems with multiple contaminants. Computer and Chemical Engineering, 24, 1461-1466. Doyle, S. J. and Smith, R. (1997). Targeting water reuse with multiple contaminants. Process Safety and Environmental Protection, 75, 181-189. Guanaratnam, M., Alva-Argáez, A., Kokossis, J., Kim, K. and Smith, R. Automated design of total water system. (2005). Ind. Eng. Chem. Res, 44, 588-599. Hallale N (2002). A new graphical targeting method for water minimization. Adv Env Res, 6, 377–390. Karuppiah, R., Grossmann, I.E. (2006). Global optimization for the synthesis of integrated water systems in chemical processes. Computers and Chemical Engineering, 30, 650-673. Koppol, A. P. R., Bagajewicz, J.M., Dericks, B. J. and Savelski, M. J. (2003). On zero water discharge solutions in process industry. Advances in Environmental Research, 8, 151-171. Mann, J. G. and Liu, Y. A. (1999). Industrial water reuse and wastewater minimization. New York: McGraw Hill. Ng, D.K.S., Foo, D.C.Y. and Tan, R.R. (2007a). Targeting for Total Water Network. 1. Waste Stream Identification. Industrial and Engineering Chemistry Research, 46, 9107-9113. Ng, D.K.S., Foo, D.C.Y. and Tan, R.R. (2007b). Targeting for Total Water Network. 2. Waste Treatment Targeting and Interactions with Water System Elements. Industrial and Engineering Chemistry Research, 46, 9114-9125. Polley, G.T. and Polley,H.L. (2000). Design better water networks. Chemical Engineering Progress, 96, 47. Prakotpol, D. and Srinophakun, T. (2004). GAPinch: genetic algorithm toolbox for water pinch technology. Chemical Engineering and Processing, 43 (2), 203-217. Putra, Z.A., Amminudin, K. (2008). Two-step optimization approach for design of a total water system. Ind. Eng. Chem. Res., 47, 6045-6054. Sikdar and El-Halwagi, (2001). Process Design Tools for the Enviroment. Taylor & Francis. Takama, N., Kuriyama, T., Shiroko, K. and Umeda, T. (1980). Optimal Water Allocation in a Petroleum Refinery. Computers and Chemical Engineering, 4, 251. Teles, J., Castro, P. M. And Novais, A. Q. (2008). LP-based solution strategies for the optimal design of industrial water networks with multiple contaminants. Chemical Engineering Science, 63, 367 – 394. Wang, Y. P. and Smith, R. (1994). Wastewater minimization. Chemical Engineering Science, 49 (7), 981 – 1006.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
21
Perspectives of Application of Computer Aided Process Engineering Tools in Clinical Medicine Eugene J. Kucharz Department of Internal Medicine and Rheumatology,Medical University of Silesia, Katowice, Poland
Introduction Computers are commonly applied in a range of fields of contemporary human activity, including clinical medicine. Effectiveness of computer application depends on a number of factors of technological, social, psychological, financial and other nature, especially related to the specific features of the field of the application. The present study was designed to evaluate the possible and predictable perspectives of application of computers in clinical medicine. The assessment is based on specification of intrinsic features of clinical medicine. These characteristics may limit application or may indicate new areas or forms of further investigations on computer applications to clinical medicine. They also describe differences in characteristic pattern between medical and industrial application of computers. The next step of investigation is classification of areas of computer application in clinical medicine. The classification may be a base for listing potential subjects of research activity, and will facilitate the mutual understanding of physicians and computer experts. It will also reveal educational needs of both sides. Determination of detailed list of needs and opportunities is the best way for mutual recognition of fields of research interest with possible practical applications. Evaluation of medical problems that can be solved with assistance of computer engineering is more that simple application of computer science to clinical practice. It may be beneficial for both sides as well. Medicine recognizes and modifies a very special part of human nature, the human health. Human health is considered as health of individuals as well as health of the population. Better understanding of these problems that are almost perfectly regulated by the evolutiondeveloped complex mechanisms may be a model for technological systems. Creation of such computer tools as the Artificial Neuronal Network is an example of application of nature-imitating systems in the computer technology.
1. The typical characteristics of clinical medicine Clinical medicine is a professional knowledge focusing on prevention, diagnostics and therapy of diseases of humans. There are several specific intrinsic features characterizing clinical medicine. They include: (a) unique nature of every patient, both in terms of unique human nature (psychological) and in terms of biological nature (inherited genetic material, features resulted from influence of the environment), (b) limitation of physician action due to respect of the human nature of the object of the activity, and limitation in the methods used by the physician, (c) lack of adequate data for majority of clinical situations, (d) non-specificity of majority of data referring to clinical situations. a) It is clear that each patient is the unique human being in terms of biological as well as psychological nature. On the hand, diagnostics and therapy are based on probability
22
E.J. Kucharz
modeling that is dynamic collection of data (from patient’s history, physical examination, laboratory tests, imaging investigations) resulting or aiming to classify the individual unique patient within frames of known of medical nosological units, i.e. specific diseases. The higher level of probability that the individual patient is classified to proper nosological unit the better correctness of diagnosis is achieved. It is directly related to proper treatment and determination of prognosis. In general, the system of diagnostics due to natural variability of human beings is less efficient than standardized procedures used in technology. b) The procedures apply in medicine are limited with respect to human being as the person. Their application requires keeping to ethical rules and obeying the law. Application of almost all medical procedures requires the patient’s previous informed consent and the patient has right to refuse the best diagnostic or therapeutic method due to his preferences or moral values. The old medical rule regulating all forms of physician’s activity towards the patient “first do not harm” must be considered as an important principle. In practice, it distinguishes clinical medicine from majority of industrial and technological activities that are as well human-oriented and ethical forms of creativity but deal with inanimate matter. c) A limited number of clinical situations have been investigated according to scientific standards. It applies almost exclusively to evaluation of new drugs, other therapeutic methods, and a few diagnostic tools. In everyday physician practice, most of the patients produce clinical problems that have not been adequately investigated. The most common example is coexistence of two or more disorders in the same patient. Almost all research dealt with a single disease and has been carried out on highly selected groups of patients. Physician has to transfer those “pure” results to significantly more complex clinical practice situations. d) Majority of parameters that are determined by physician have low level of precision. It is resulted from the nature of these parameters (e.g. pain, stress, anxiety, depression, mood cannot me measured with medical equipment) or several parameters that can be measured with technological devices are determined physically (i.e. with hands and senses of physician only) because the more accurate measurement will not provide any applicable results affecting on the physician’s diagnostic or therapeutic decision (e.g. determination of cutaneous elasticity or perspiration, characteristic of cough, color of the skin, properties of the discharge fluids, etc.). There is also other important factor responsible for difficulties in application of computers in clinical medicine. It should be taken into consideration that majority of physicians (especially those who are engaged into clinical practice) have little education in basic sciences, especially in mathematics. Medical education is oriented towards natural sciences (medical biology) and behavioral sciences (psychology). Lack of understanding of problems that are basic for computer applications and sometimes reluctance of physicians towards theoretical problems of sciences may create difficulties in mutual cooperation or at least indicate for the need of further education.
2. Medicine: learning and art. Evidence-based medicine As mentioned above, majority of practical clinical problems that physician are dealing with in everyday practice have not been properly evaluated according to
Perspectives of Application of Computer Aided Process Engineering Tools in Clinical Medicine
23
standards of scientific research. It is caused by a complex of medical problems and a very high number of variables, including the natural diversity of human beings. Of course, the medical knowledge that accumulated through centuries provided several more or less detailed indications and rules for physician’s work but in most of the situations physician have to make an individual synthesis of medical knowledge applicable to the individual patient. The most common example is the patient receiving medication for a few chronic diseases. There is no scientifically proven data that indicate what physician have to do in such situation. The only rational method is deduction based on available medical knowledge and physician’s own experience. In this meaning, medicine is still the art though based on the results of scientific research. One of the problems of contemporary medicine is the avalanche of information. Number of medical publication is huge and constantly increasing. In recent years, a new technique to evaluate the medical information has been elaborated. It is termed “evidence-based medicine”. The main principle of this technique is estimation of the value or strength of medical item of information. The description of a single case has the lowest strength of information while meta-analysis of double-blinded, randomized, multi-centered, prospective studies has the highest available strength of information. Special techniques have been introduced to evaluate from the point of view of the evidence-based medicine the medical handbooks, state-of-art papers, recommendations, guidelines and results of studies on new medications. Application of evidence-based medicine into clinical practice is one of the main aspects of contemporary medicine.
3. Main problems of clinical medicine that may be solved with application of computers Deep detailed analysis of clinical medicine revealed a number of problems that can be solved with computer-assisted systems. These problems should be considered in further studies. In general, these problems are classified into two subgroups: (a) problems related to a high number of data that can be evaluated with computers only, and (b) problems related to the complexity of medical phenomena that need computer-assisted evaluation. The first subgroup include the following problems: investigation of unexpected adverse reaction of the medication that can be detected on the base of national and international registers of therapy, computer-assisted diagnostics and management of some common diseases with application of recommendations or guidelines elaborated by international societies or committees, analysis of a number of so-called anecdotal data referring to so-called orphan diseases, analysis of data detected by some modern devises (e.g. 24 hrs monitoring of heart rhythm disturbances, long-term monitoring of pH changes in esophagus, determination of gastric or intestinal motility, long-term electroencephalography recordings, circadian changes of blood pressure, sleepassociated disturbances – polysommographical studies). The second subgroup of the medical problems includes: multivariable analysis of risk factors of several diseases, analysis of disorders probably caused by coexistence of a few etiological factors, design of new chemical substances (potential medicines) based on computer-assisted structural analysis of biological receptors, design of technologies for production of so-called biological drugs (i.e. produced by living genetically modified organisms or cell cultures), analysis of environmental or geographical factors affecting the development or course of disorders, analysis of genetic, epigenetic or proteomic phenomena related to several disorders (including diseases that are inherited by an assemblage of genes or are caused by impaired post-translational modification of
24
E.J. Kucharz
proteins), so-called personalized medicine i.e. design of therapeutic methods for individual patient on the base of analysis of his/her metabolic pathways or genetic susceptibility to various agents, elaboration of the most effective forms of medical activity with application of the system theory (the Dietrych’s theory), analysis of costeffectiveness aspects of medical procedures, including the quality of life of the patients.
4. Conclusions Clinical practice is always focused on the human being, the individual unique patient. The personality of physician is a potent therapeutic tool, and any other medical personnel cannot substitute physician in his/her discussion with and examination of the patient. In this aspect, any technological product cannot substitute the physician as the person. On the other hand, the excess of knowledge and constantly increasing technological opportunities unambiguously indicate for the need of supporting the physician with technological resources. Moreover, it is easy to imagine that in the nearest future, the physician cannot work properly without computer support. These finding has a profound effect on the direction of research. Specification of problems that can be solved with computers and elucidation of specific characteristics of medical problems as well as their limits (mostly due to human nature of the target of action) are necessary for development of research projects that hoped for significant improvement in efficacy of clinical medicine.
References Kucharz E.J.: Man is the way of medicine. Polskie Archiwum Medycyny WewnĊtrznej, 2006, vol. 116, no 6(12), p. 1229-1243. Kucharz E.J.: Internal medicine: yesterday, today, and tomorrow. I. Origin and development: the historical perspective. European Journal of Internal Medicine, 2003, vol. 14, no. 3, p. 205-208. Kucharz E.J.: Internal medicine: yesterday, today, and tomorrow. II. Definition and development in the 20th century. European Journal of Internal Medicine, 2003, vol. 14, no. 4, p. 272-274. Kucharz E.J.: Internal medicine: yesterday, today, and tomorrow. III. Specialists versus generalists or hospitalists. European Journal of Internal Medicine, 2003, vol. 14, no. 5 p. 344346. Kucharz E.J.: Rheumatology: dreams and reality. Terapia, 2007, vol: 15, no 12 (203), p. 5-6 [in Polish]. Kucharz E.J., Kotulska A., Zmysłowski A.: Application of the methodology of Dietrych in analysis of medical diagnostic and therapeutic procedures. WiadomoĞci Lekarskie, 2006, vol: 49, no 3-4. p. 125-126 [in Polish].
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
25
The Development of an Advanced Systems Synthesis Environment: Integration of MI(NL)P Methods and Tools for Sustainable Applications Zdravko Kravanja University of Maribor, Faculty of Chemistry and Chemical Engineering, P.O. Box 219, 2000 Maribor, Slovenia,
[email protected]
But the creative principle resides in mathematics. In a certain sense, therefore, I hold true that pure thought can grasp reality, as the ancients dreamed. Albert Einstein
Abstract The use of the mathematical programming approach to the synthesis of chemical processes and other systems has many advantages: feasibility, optimality, integrality and flexibility of solutions. Since the synthesis activity deals with the generation and selection of design alternatives, it involves discrete/continuous decisions, giving rise to a mixed-integer nonlinear programming (MINLP) class of problems. Although several efficient MINLP solvers have been developed in the last two decades, hardly any academic or professional MINLP synthesizer has been developed so far. The present contribution wishes to shed light on some important issues relating to different challenges that had to and still have to be mastered, and various capabilities which in turn were rewarded by mastering some of the challenges during the development of the advanced systems synthesizer MIPSYN, the successor of the process synthesizer PROSYN (Kravanja and Grossmann, 1994). The primary aim of future research is oriented towards the development of an even more advanced and robust synthesizer shell, capable of solving large-scale sustainable applications in different engineering domains. Keywords: process synthesis, process synthesizer, MIPSYN, synthesizer shell, MINLP.
1. Introduction Our global system is currently facing financial, production, social and environmental crisis. Globalization alone with increasing competition has thus proved to be insufficient for fostering steady economics. On the contrary, globalization based on unsustainable principles can only deepen and prolong the crisis. The community strives for sustainable development in general and sustainable chemical and bio-chemical industries in particular. Sustainable system synthesis in general and process synthesis in particular are for this reason of paramount importance in the area of Process System Engineering (PSE). The synthesis deals with the integration of constitutive elements (e.g. process units), material and energy streams into production plants, and plants into networks. The synthesis can therefore be considered a core innovative activity in developing or reconstructing new chemical and other plants. In the last decades many important achievements were accomplished in the area of synthesis, design and optimization of process and other systems. The methods rely on
26
Z. Kravanja
different solution concepts: either on heuristics (intuition, engineering experience), thermodynamics (physical insight) or mathematical programming. Whilst the former heuristic concept is becoming more and more redundant, efficient available optimization techniques, solution algorithms and strategies enable us to solve a wide range of problems arising in chemical engineering (see e.g. Grossmann and Kravanja, 1997; Biegler and Grossmann, 2004). Logic-based modelling representations and optimization techniques (e.g. Grossmann and Biegler, 2004; Sawaya, 2006) can be regarded as one of the most important achievements in the mathematical programming approach to the synthesis of discrete-continuous problems. However, with respect to process synthesis and systems synthesis in general there are many important challenges that still need to be mastered in order for complex problems of today to be solved more efficiently and integrally. This paper presents various challenges and capabilities related to the development of a unique process synthesizer MIPSYN, the successor of the MINLP synthesizer PROSYN (Kravanja and Grossmann, 1994). In addition it aims at shedding light on some important aspects associated to sustainable process synthesis.
2. Mixed-integer process synthesizer MIPSYN: challenges and capabilities 2.1. System synthesis based on the mathematical programming approach A definition of the synthesis activity by A. W. Westerberg (1991) is as follows: synthesis is the automatic generation of design alternatives and the selection of the better ones based on incomplete information. With respect to the cited definition for performing a synthesis in an equation oriented modular environment like MIPSYN, it is necessary to define: i) the superstructure from which design alternatives can be generated, ii) an efficient model formulation, and iii) a solution procedure based on advanced mathematical programming techniques which gives rise to the well-known superstructure approach. The relying solution algorithm should be capable of automatic generation of alternatives and of selecting the best one. The synthesis can be carried out for problems ranging from a simple subsystem synthesis to the synthesis of complex heat-integrated and flexible overall process schemes. It is interesting to note that although several general-purpose MINLP solvers (www.gamsworld.org/minlp/solvers.html), including the logic-based solver LOGMIP (Vecchietti and Grossmann, 1997) were developed in the last two decades, there are hardly any professional or academic discrete-continuous synthesis environments relying on recent techniques. As the development of such a synthesizer is an extremely challenging task and requires interdisciplinary skills of its developers, it provides the users with a set of various advanced capabilities by means of which problems can be solved which could probably not be solved any other way. Challenges in developing solution methods and tools for process synthesis are mostly related to the manifolds nature of the synthesis problems: • There are many complex interactions between subsystems most of which are mostly hidden to the human mind. • Decisions, carried out during the synthesis activity, are discrete and continuous. • All process parameters are uncertain to a certain degree. • Chemical processes are dynamic systems. • Many decisions are rule-based, represented by more or less complex logics. In order to capture these different aspects of problem's nature, different modelling representations, different algorithms and tools have been developed for various
The Development of an Advanced Systems Synthesis Environment: Integration of MI(NL)P Methods and Tools for Sustainable Applications
27
synthesis applications. Table 1 shows a variety of model complexity ranging from a simple steady state continuous LP process optimization to a flexible dynamical multiperiod entire life-cycle MINLP process synthesis. It is apparent that the numerical and methodological capabilities of our tools are still insufficient for solving complex synthesis problems as shown in the left-bottom corner of Table 1. Thus, very important challenges are associated with our attempts to raise the numerical capabilities of our current solution methods and tools, where the synthesizer MIPSYN is not an exception. Table 1. Variety of model complexity
Types of variables
Certainty variables Continuous, x discrete, y 0-1 logical Y x, y x, Y Uncertain parameter, Ĭ
Equations, Models, Examples Linear Nonlinear Difference Differential Steady state Multiperiod Dynamic Continuous processes Life cycle Batch or cont. processes Nominal LP NLP e.g. e.g. ILP INLP DisLP DisNLP MILP MINLP Mul. MINLP Dyn. MINLP MDisLP MDisNLP Flexible
2.2. Description of the MIPSYN synthesizer Figure 1 shows the flowchart of the synthesizer. Different methods and related components are integrated in this synthesizer's equation-oriented modular environment: i) GAMS with a variety of different NLP and MILP solvers ii) different versions of the OA algorithms, including the modified OA/ER algorithm and a new logic-based OA/ER algorithm, which are supervised by MIPSYN command files, iii) a simple simulator as initializer which is used to provide NLP subproblems feasible or near-feasible starting points, iv) a library of process unit and interconnected nodes models, different simultaneous models for heat integration, mass integration, and a physical property database for the most common chemical component, and v) a hybrid modelling environment with a link to external FORTRAN routines through procedures for solving the implicit part of synthesis models. MIPSYN can be used at different levels of problem abstraction as: • an MINLP solver for more general problems, • process synthesizer for the synthesis of process flowsheets, and as • a synthesizer shell for applications in different domains other than chemical engineering, e.g. the synthesis of mechanical structures. Since the execution of the NLP and MILP steps in OA algorithms are performed through the use of GAMS saving/restart capabilities, MIPSYN can run in automated or interactive modes of operations. The interactive mode is especially important since it enables the user to interfere and assist the optimization steps, which significantly improves the robustness of the MINLP search. Capabilities like initialization of NLP subproblems, calling different NLP and MILP solvers in a sequence with different option files, efficient modelling formulations, different strategies, e.g. multilevel MINLP, a possibility of solving feasibility problems with augmented penalty objective functions, multi-objective optimization, integer-infeasible path optimization, multiperiod optimization, and flexible synthesis in cases of uncertain parameters have been
Z. Kravanja
28
implemented thoroughly in the synthesizer. Some of them are briefly discussed in the following sub-chapters.
Figure 1. Integration of methods and tools in the MINLP synthesizer MIPSYN.
2.3. Feasibility, optimality and integrality of a solution Why is the mathematical programming approach to the synthesis so important? It is because of the various important advantages inherently present in the approach. Having the ability of obtaining solutions that are feasible and yet optimal seems to be the main capability. A solution is feasible when it satisfies all the imposed constraints. The analysis steps, in other approaches performed after the solution step, thus become redundant. Being optimal means that the appropriate trade-offs are appropriately established for a given optimality criterion. Also, during the selection procedure only the better design alternatives are generated to compete for the final solution since in practice bad alternatives are hardly ever generated. It should be noted that optimization can be performed only if interactions taking place between subsystems (reaction paths, separations, and auxiliary operations) can be appropriately accounted for. Thus, all the subsystems have to be considered simultaneously, which gives rise to the simultaneous type of optimization based on algorithmic mathematical programming techniques. However, since the subsystems are merged together, their integrated models are harder to solve than when the subsystems are solved sequentially. In many cases such integrated models are even too complex to be solved directly. Special decomposition techniques have to be employed, e.g. the ones based on the Lagrangian suboptimization schemes or multi-level MINLP, in order not to compromise the simultaneity of the solution. Since different subsystems can thus be solved simultaneously considering the various aspects imposed in the constraints and defined in the objective function, the
The Development of an Advanced Systems Synthesis Environment: Integration of MI(NL)P Methods and Tools for Sustainable Applications
29
obtained solutions are truly integrated. Simultaneous heat integration and the synthesis/optimization of process schemes is such an example where the ultimate effect of the simultaneous approach is not only the expected reduction of utility consumption but surprisingly, an increase of the process overall conversion with reduction of raw material usage (Lang et al, 1988). Thus, appropriately exploring all the interactions between the subsystems, the simultaneous approach is capable of capturing different synergistic effects that are hidden below the surface of the studied systems. Important new insights can be created in this way. There is thus a challenging incentive to apply the simultaneous approach to the synthesis of process schemes. 2.4. Discrete/continuous decision making Besides more usual continuous decisions (operating conditions, sizes, etc.) the synthesis of process schemes and other systems involves many discrete decisions, like selection of different technologies, process units and other constitutive elements, connectivity, selection of standard dimensions, material of constructions, different exclusive operation conditions, etc. The capability of performing discrete decisions simultaneously with the continuous ones enables one to obtain process solutions that are optimal with respect to topology and flowsheet parameters, as well as feasible in logical constraints when logics is modelled through discrete decisions. In the last half century several techniques for solving MINLP problems have been developed, see e.g. a survey by Grossmann and Kravanja (1997), starting with the Generalized Benders Decomposition method by Benders (1962), some of them being very efficient. The Outer-Approximation algorithm (OA) by Duran and Grossmann (1986) and its various extensions can be regarded as the most effective ones for solving complex, highly nonlinear synthesis problems that are characterized by dense row/column matrices. For solving combinatorially more complex problems different multilevel MINLP strategies were developed, e.g. the multilevel tree search by Daichendt and Grossmann (1997) and the multilevel hierarchical MINLP by Kravanja and Grossmann (1997). Besides the reduction of combinatorial complexity, multilevel MINLP strategies allow one to perform hierarchical decomposion at various levels of model aggregation and complexity, starting with larger superstructures and more aggregated models, and progressing toward smaller superstructures, represented with more detailed models. In this way, one can skip expensive modeling of a good number of details in the superstructure. Other very efficient multi-level MINLP strategies which were implemented in the process synthesizer MIPSYN are the Linked Multilevel Hierarchical Strategy (LMHS) and the Reduced Integer Space (RIS) strategy (Kravanja S. et al., 2003). The LMHS strategy is rigorous and can solve convex problems to global optimal solutions. On the other hand, when the RIS strategy is applied for the solution of large combinatorial problems, global optimality cannot be guaranteed, but very good solutions can be obtained. The LMHS strategy was successfully applied to a synthesis problem in mechanics – to a roller steel gate for a hydroelectric power station with 19623 binary variables, whilst the RIS strategy was used to solve the synthesis problem of a heat exchanger network comprising different types of exchangers with 1782 binary variables. Other advanced modelling representation and optimization techniques that are also implemented in MIPSYN are the ones based on logic-based programming by which problems are formulated in a more sophisticated way by global (in)equality constraints, logical disjunctions and logical constraints. The development of logic-based programming also revealed some very important insights into the structure of MINLP
30
Z. Kravanja
problems: at the level of non-linear programming (NLP) subproblems, only the existing part of the superstructure is solved, while at the level of mixed-integer linear programming (MILP) linearizations for disjunctions are derived without big-M scalars, which significantly improve the performance of the MINLP techniques, especially of the Outer-Approximation/Equality-Relaxation (OA/ER) algorithm by Kocis and Grossmann (1987) and its extensions. Since NLP subproblems are executed only for existing units, many numerical problems that can be caused by zero conditions are circumvented and NLP subproblems are easier to solve since they are smaller in size. In order to obtain outer approximations for the whole superstructure, the first NLP is solved only for the initial flowsheet while the rest of the units are solved by the Langrangian suboptimization scheme. The main challenge here was related to the development of MILP master problems based on the accumulation of outer approximations derived from solutions of different-size NLPs. Most recently, the alternative generalized disjunctive programming (GDP) formulation, convex hull representations, and the logic-based outer-approximation algorithm for process synthesis problems were proposed (Ropotar and Kravanja, 2008) and implemented in the synthesizer MIPSYN. A special discrete/continuous translation of variables enables modelling and solving process alternatives in a narrowed space of variables, defined by non-zero lower and upper bounds. Initial research indicates that the proposed alternative convex hull representation usually outperforms the conventional one when solving large combinatorial process networks problems. However, in spite of the progress in computational speed, computer architecture and the efficiency of optimization techniques, strategies and computer codes, the solving of large combinatorial problems in general with for instance 1000–20000 of binary variables still remains a major challenge. 2.5. Towards obtaining global or near-global solutions Due to the presence of nonconvexities the OA/ER algorithm does not generally guarantee the globality of solutions. Undesirable effects of noncovexities are twofold: at the level of NLP subproblems the optimizations can get stuck at poor local optima while at the level of MILP master problems part of the feasible region and, hence the global optimum can be cut off. In order to reduce the effects of the nonconvexities involved at NLP subproblems, global NLP solvers like GAMS/OQNLP can be employed, while at the level of the master problem, various structured modifications, rooted in logic-based disjunctive model formulations and non-structured modifications can be applied in MIPSYN. The most important non-structured modifications are: • deactivation of linearizations, • decomposition and deactivation of the objective function linearization, • use of the penalty function, • use of the upper bound on the objective function, and • global convexity test and validation of the outer approximations. In order to handle nonconvexities most efficiently, non-structured modifications were implemented directly in the MIPSYN's MINLP solvers. 2.6. Uncertainty and flexible synthesis The synthesis of large flexible process flowsheets with a significant number of uncertain parameters (say 20 to 100) is still a challenging problem. The main reason is that such problems are usually solved by the discretization of an infinite uncertain space, which causes an enormous increase in the problem’s size and prevents the solving of problems even with a moderate number of uncertain parameters. Since most of the engineering structures we wish to synthesize or optimize in practice have much larger numbers of
The Development of an Advanced Systems Synthesis Environment: Integration of MI(NL)P Methods and Tools for Sustainable Applications
31
uncertain parameters than we can handle, we are faced with the following two problems: their designs can be either i) nonoptimal if we enlarge their design variables by some ad hoc safety factors in order to make them flexible or ii) infeasible if we optimize them at nominal conditions and the solutions obtained are incapable of tolerating variations of a large number of uncertain parameters. Thus, a capability of performing flexible synthesis enables one to obtain flexible and yet optimal solutions. Different methods and strategies were recently developed and implemented in the synthesizer MIPSYN in order to overcome the two problems. They were developed in order to overcome the following two problems: • Approximate stochastic optimization. In order to a large extent to overcome the problem of nonoptimality an appropriate trade-off between the operating cost and the revenues, on the one side, and the investment cost, on the other side, has to be established by employing the expected objective function. For problems with a large number of uncertain parameters a strategy for the approximate stochastic optimization was developed (Novak-Pintariþ and Kravanja, 2004). Rather than integrating the objective value over ranges of uncertain parameters to obtain the expected objective value, the expected objective function is approximated at a special single point – the central basic point. In this way, the exhaustive calculation at numerous Gaussian quadrature points is avoided and the model is significantly reduced. • A-priori identification of critical points. An approach for the a-priori identification of critical points, either vertex or nonvertex, was developed for the synthesis of flexible flowsheets in order to overcome the problem of infeasibility caused by a large number of uncertain parameters. A set of critical points is determined by merging of critical values of uncertain parameters that are obtained by maximizing the design variables one-by-one, while simultaneously optimizing the economic objective function (Novak-Pintariþ and Kravanja, 2008). The set of critical points is then used to assure the feasibility of the design. An important feature of the approach is that the dimensionality of the model depends only on the number of design variables, which is usually quite modest for the majority of chemical processes. A multi-level MINLP methodology for the approximate stochastic synthesis of process flowsheets with a large number of uncertain parameters was then proposed (NovakPintariþ and Kravanja, 2007). The methodology is a reasonable combination of the above two approaches which significantly reduces a problem’s size. The methodology was applied to the synthesis of a flexible heat-integrated methanol process with 24 uncertain parameters. 2.7. Hybrid modeling and solution environment for disjunctive models In many applications models can be too large and complex to be solved if they are entirely written explicitly in an equation-oriented (EO) environment. Reactivedistillation is a typical example where the distillation model is given by the classical MESH equations (Mass balance, Equilibrium, Summation and Heat balance) while the thermodynamics, kinetics and hydrodynamic behaviour of the system are described by rigorous sub-models. One possible and effective approach is to implement hybrid modelling and a solution environment where only the easiest part of the model (MESH equations) is presented explicitly in the EO environment while the complex part with the rigorous sub-models is modelled implicitly through the use of FORTAN procedures connected to the synthesizer MIPSYN. Since the synthesizer provides the user with many flexible capabilities to interactively assist the course of optimization, e.g.
32
Z. Kravanja
initialization of each NLP subproblem, different strategies can be implemented in the MIPSYN in order to converge to feasible and optimal solutions which otherwise could not be obtained (Ropotar et al., 2009). The objective was to optimise the column configuration: optimal feed and catalyst location, optimal operating parameter (e.g. reflux and reboiler duty), optimal design parameter (e.g. column diameter). For a distillation collumn with 50 separation and 10 reactive trays the hybride model typically comprises up to 3000 constraints and 1500 variables, one tenth of them being binary. About 500 equations and almost all variables are part of external procedures. Since NLP subproblems are executed only for selected trays, the course of the MINLP iteration is more robust. However, the main challenge was the development of suitable logics that supervises the execusion of the external FORTRAN routines. Since the model is disjunctive, external funtions are executed only for selected trays. 2.8. Sustainability and multi-objective approach In order to obtain a sustainable solution there are many environmental and other sustainability aspects that have to be imposed as constraints and/or criteria when solving a synthesis problem. Firm and yet simple sustainability principles should be stated and integrated thoroughly in our sophisticated methods and tools, thus upgrading our level of thinking, knowledge and resulted solutions. An example of a guideline for the utilization of resources is that consumption rates of renewable resources must not exceed their regeneration rates, or material brought into the environment must not exceed the carrying capacity of the ecosystem (Voss, 1994). According to Jischa (1998), sustainability can be interpreted by a 3x3x3 sustainability matrix where the three axis show the aspects of justice from fair reward for work to fair distribution of goods, level of strategies ranging from efficiency, consistency to sufficiency, and view of nature from a narrow anthropocentric to eco-centric view. In order to achieve sustainable solutions the scope of the synthesis, as will be discussed later, has to be extended almost to the whole chemical or biochemical supply chain. It should be noted that a two-level MINLP approach for the systematic consideration of the sustainability principles in the synthesis of environmentally benign chemical processes was developed (Kravanja et al., 2005). The approach is based on the generation of a superstructure which contains sustainable structural alternatives for minimal or zero emissions, minimization of energy consumption and exergy loss, and minimal waste and by-product streams resulting from the process. The economic and environmental criteria were identified, for multi-objective optimisation in order to generate sets of Pareto optimal solutions. The approach was illustrated using a wellknown hydrodealkylation (HDA) process. The study indicates that interactions can be very complex and, hence unpredictable, which gives rise to the simultaneous approach.
3. Applications 3.1. Scope of applications Many different case studies were performed by MIPSYN and various OA-based algorithms, solution strategies, prescreening methods, and modeling representations, as mentioned in the previous chapter, have been implemented, all of them indicating that the scope of application can be very extensive, from a simple NLP optimization of process subsystem to a complex and flexible MINLP synthesis of heat-integrated overall process scheme. It should be noted that by using the MIPSYN shell, various case studies and applications were carried out in the area of mechanics ranging from simple NLP
The Development of an Advanced Systems Synthesis Environment: Integration of MI(NL)P Methods and Tools for Sustainable Applications
33
optimizations, e.g. timber trusses (Šilih et al., 2006) or composite floor systems (Klanšek, 2006, 2008), to complex multilevel MINLP syntheses of mechanical structures where topology, material, standard and rounded dimensions were optimized simultaneously (Kravanja S. et al., 2005), e.g. the synthesis of sliding gates for a hydropower dam (Kravanja S. et al, 2002), steel frames (Klanšek et al., 2007) and steel buildings (Žula et al, 2008). 3.2. Current and future challenging sustainable applications 3.2.1. Process synthesis related to green energy and the biochemical supply chain In order to use MIPSYN for the integration of the whole biochemical supply chain for the production of biogas, MIPSYN is currently upgrading for the syntheses of bioprocesses. The development of library of modules for biochemical process units, including the kinetics of possibly-novel bioreaction paths, is under way. MINLP models will be generated from the library for the synthesis of mass and energy integrated biocommodity networks. Real-world cost functions for biochemical process units will also be defined and used to formulate reliable economic objective functions. 3.2.2. Sustainable feedstock-process-product integration based on prediction models The main vision is to redesign or fundamentally innovate (bio)chemical processes and other systems in order to achieve highly sustainable production and consumption. The main research challenge is to perform product and process design from the molecular level, to the selection of sustainable resource alternatives, to sustainable reaction path and process alternatives, to sustainable product alternatives in a multi-objective and simultaneous design procedure. The development of such a procedure would require employment of the most advanced mathematical programming techniques for the simultaneous structural and parameter optimization. Being integrated with the Molecular modeling and Global life cycle assessment would provide an integrated sustainable framework for the design of new compounds and the synthesis of innovative process solutions. The challenge here is the development of models for different levels of the (bio)chemical supply chain, models that are simple, and yet effective and suitable for the simultaneous selection of: • compound alternatives (Molecular modelling), • sustainable reaction path alternatives, • process flowsheet alternatives, and • prediction of product properties and functionalities. It should be noted that modelling the sustainable reaction path alternatives together with predicting chemical kinetics is the least developed research activity among the proposed ones. Also, according to the vision the synthesis is widening to the selection of molecules and reaction paths in accordance to given designing criteria.
4. Conclusion It is true that we cannot solve environmental and other problems using the same knowledge, the same way of thinking, the same methods and tools as when the problems were created. I believe that solution capabilities of the conventional solution techniques, strategies and concepts are insufficient for solving large-scale complex problems effectively. The scope of process synthesis should be expanded and the capabilities of our methods and tools should be upgraded to enable the identifying of new compounds, new reaction paths, and metabolic networks in order to create new products with desired properties and functionalities, thus fundamentally innovating the chemical industry based on firm sustainability principles. The PSE community is thus
34
Z. Kravanja
faced with the greatest challenge ever – with the incentive of developing integrated methods and tools to provide engineers with a powerful tool so that they will be able to shape sustainable development in the chemical industry.
5. Acknowledgements The author is grateful to the Slovenian Ministry of Higher Education, Science and Technology for the financial support.
References J. F. Benders, 1962, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol. 4, pp. 238–252 L. T. Biegler and I. E. Grossmann, 2004, Retrospective on optimization, Comput. Chem. Eng., vol. 28(8), pp. 1169-1192 M. M. Daichendt and I. E. Grossmann, 1997, Integration of hierarchical decomposition and mathematical programming for the synthesis of process flowsheet, Computers Chem. Engng. vol. 22, pp. 147–175 M. A. Duran and I. E. Grossmann, 1986, An outer-approximation algorithm for a class of mixedinteger nonlinear programs, Mathematical Programming, vol. 36, pp. 307–339 I. E. Grossmann and L. T. Biegler, 2004, Part II. Future perspective on optimization, Comput. Chem. Eng., vol. 28(8), pp. 1193-1218 I. E. Grossmann and Z. Kravanja, 1997, Mixed-integer nonlinear programming: a survey of algorithms and applications. Large-scale optimization with applications. Part 2, Optimal design and control, L. T. Biegler, New York, Springer-Verlag, vol. 93, pp. 73-100 M. Jischa, 1998, Sustainable development and technology assessment, Chem. Eng. Technol. , vol. 21(8), pp. 629-636 G. R. Kocis and I. E. Grossmann, 1987, Relaxation strategy for the structural optimization of process flowsheets, Ind.Engng. Chem. Res., vol. 26, pp. 1869–1880 U. Klanšek and S. Kravanja, 2006, Cost estimation, optimization and competitiveness of different composite floor systems, Part 2, Optimization based competitiveness between the composite I beams, channel-section and hollow-section trusses, J. Constr. steel res., vol. 62(5), pp. 449462 U. Klanšek, T. Žula, Z. Kravanja and S. Kravanja, 2007, MINLP optimization of steel frames. Adv. steel constr., vol. 3(3), pp. 689-705 U. Klanšek and S. Kravanja, 2008, Cost optimization of composite I beam floor system. Am. j. appl. sci. vol. 5(1), pp. 7-17 S. Kravanja, 2003, Optimization of the Sultartangi sliding gates in Iceland, The International Journal on Hydropower & Dams, vol. 9(2), pp. 42-45 S. Kravanja, A. Soršak and Z. Kravanja, 2003, Efficient multilevel MINLP strategies for solving large combinatorial problems in engineering. Optimization and engineering, vol. 4, pp. 97-1 S. Kravanja, S. Šilih and Z. Kravanja, 2005, The multilevel MINLP optimization approach to structural synthesis: the simultaneous topology, material, standard and rounded dimension optimization, Adv. eng. softw. (1992), vol. 36(9), pp. 568-583 Z. Kravanja and I. E. Grossmann, 1994, New Developments and Capabilities in Prosyn - an Automated Topology and Parameter Process Synthesizer, Comput. Chem. Eng., vol. 18(1112), pp. 1097-1114 Z. Kravanja and I. E. Grossmann, 1997, Multilevel-hierarchical MINLP synthesis of process flowsheets, Computers and Chemical Engineering, vol. 21, pp. S421–S426 Z. Kravanja, M. Ropotar and Z. Novak-Pintariþ, 2005, Incorporating sustainability into superstructural synthesis of chemical processes, P. Glaviþ (ed.), M. Simoniþ (ed.), CIPSD 1417 December 2005, Maribor, Slovenia. Conference proceedings. Maribor, Faculty of Chemistry and Chemical Engineering Y.D. Lang, L.T. Biegler and I.E. Grossmann, 1988, Simultaneous optimization and heat integration with process simulators, Computers chem. Engng., vol. 12, pp. 311-327
The Development of an Advanced Systems Synthesis Environment: Integration of MI(NL)P Methods and Tools for Sustainable Applications
35
G. Voss (Ed.), 1994, Sustainable Development – Leitzeil auf dem Weg in das 21. Jahrhundert, Deutscher Instituts-Verlag, KĘln Z. Novak-Pintariþ and Z. Kravanja, 2004, A strategy for MINLP synthesis of flexible and operable processes, Comput. chem. eng., vol. 28( 6/7), pp. 1105-1119 Z. Novak-Pintariþ and Z. Kravanja, 2008, Identification of critical points for the design and synthesis of flexible processes, Comput. chem. eng., vol 32(7), pp. 1603-1624 Z. Novak-Pintariþ and Z. Kravanja, 2007, A multilevel MINLP methodology for the approximate stochastic synthesis of flexible chemical processes, Rev. chim. (Bucur.), vol. 58(4), pp. 378391 M. Ropotar and Z. Kravanja, 2008, Translation of variables for different applications in process synthesis, AIChE Annual Meeting, Philadelphia, PA, November 16-21, 2008, Conference proceedings: 1908- 2008, New York: AIChE M. Ropotar, Z. Novak Pintariþ, J.-M. Reneaume and Z. Kravanja, 2009, MINLP synthesis of reactive distillation using a disjunctive, hybrid model, sent to PSE’09, Salvador-Bahia-Brazil, August 16–20, 2009. N. Sawaya, 2006, Reformulations, relaxations and cutting planes for generalized disjunctive programming, PhD Thesis, Pittsburgh, PA, Carnegie Mellon University S. Šilih, M. Premrov and S. Kravanja, 2005, Optimum design of plane timber trusses considering joint flexibility, Engineering Structures, vol. 27 (1), pp. 145-154 A. Vecchietti and I. E. Grossmann, 1997, LOGMIP: a disjunctive 0-1 nonlinear optimizer for process systems models, Comput. Chem. Eng., vol. 21, pp. 427-432 A. W. Westerberg, 1991, Process Engineering, Perspectives in Chemical Engineering, Research and Education, C. K. Colton (Ed.), Advances in Chemical Engineering, vol. 16, Academic Press, Boston T. Žula, Z., Kravanja and S. Kravanja, 2008, MINLP optimization of a single-storey industrial steel building. Stroj. vestn., vol. 54(10), pp. 707-724
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
37
Integration of chemical product development, process synthesis, and operation optimization Xiuxi Li, Yun Chen, and Yu Qian* School of Chemical Engineering, South China University of Technology, Guangzhou, 510640, China.
[email protected]
Abstract An integrated approach of product development, process design and operation analysis is presented. A kilo-plant was designed and set up as a research platform for fine and specialties chemicals manufacture in kilogram-scale batch process. The investigation emphasizes the issues concerning product synthesis, process operation, and product quality control, as well as process monitoring and operation optimization. It provides a systematic approach of responding to rapid changes in the marketplace demands to new green products. Keywords: integration, kilo-plant, product development, process operation.
1. Introduction The chemical process industry faces very challenging economic and social issues. The globalization of the industry has opened new markets. While potentially this increases market efficiencies, contributes to improve the human being living standard worldwide, it has also resulted in severe competition, reduces the profit margins greatly. Severe market competition needs fast responses from green product innovation, cleaner process development, to production, especially for high value-added fine and specialty chemicals. The whole process from product design, formulation to manufacture can be viewed as a chemical supply chain, including multiple scales from molecular, aggregation, interface, single-phase and multi-phase system, equipment, workshop, enterprise, to market places. The challenges are concerned with the improvement of decision making processes for the creation and operation of the chemical supply chain. It deals with the discovery, design, manufacture and distribution of chemical products in the context of conflicting and multi-attribute goals (Grossmann, 2000, 2004; Charpentier, 2002). Chemical product design and process development usually consist of several stages: products performance analysis, molecular structure and formulation, laboratory test, pilot plant, trial pre-production, and commercial production. Computer aided molecule design (CAMD) approach has been used to simulate possible product structures (Fermeglia, 2003; Qian, 2004). On the macroscale level, the integration of the product design and process design, agile manufacturing, system integration has represented the front and wide prospect of this field too (Bergess and Brennan, 2001). Most fine chemicals and specialty chemicals with high value-added are produced in small volume, even in kilogram scale, but the related manufacture process may still be complicated. A pilot plant is a typical verification tool in the development of a new product/process, which is, however, time-consuming and capital-expensive. To address this requirement, the concept of mini-plant is proposed. In Helsinki University of
X. Li et al.
38
Technology, a mini-plant operates effectively for the NexOctane process development (Wörz, 1995). Hasebe (2004) proposed to uses micro device as the high-efficient and feasible method for industrial scaling up production. A kilo-plant has been assembled and implemented in our lab in the aim of integrated research on product and process development (Qian et al., 2006). It is specifically designed for fine and pharmaceutical chemicals. It is flexible and easily reassembled into different configurations. At the same time, the kilogram-scale makes it inexpensive to build and run than conventional pilot plants. It realizes the concurrent development of chemical products, and shortens the development time.
2. A kilo-plant for integration of product and process development The kilo-plant consists of main features of a complete process system, including reactors, separation units, heating and cooling utilities, instrumentation, control system and recycles. There are two jacketed glass stirred reactors with maximum capacities of 2 and 10 liters, respectively. The temperature range is from -40 up to +200 , while the pressure ranges from 10 mbar to 1.45 bar absolute. The heater/chillers can be controlled with precise temperature profiles for the reaction and crystallization which provide products of high quality. The kilo-plant allows for changes in the configurations of the process flowsheet for investigation of process alternatives. The flowsheet is shown in Figure 1. The kilo-plant provides researchers the knowledge of the process operation based on the real experiment. The main functions realized in the kilo-plant are monitoring, data acquisition, data transfer and computer integrating control. Different processes require different flow sheet and operation units. The kilo-plant is operated in batch mode mostly. Vacuum Pump Pipeline
Condenser 1
Condenser 2
Signal Wire Product Vessels
Partial Condenser 1
Light Compo
Partial Condenser 2 Nitrogen/ Oxygen
0
Heater
Raw Material
Reactor (10 l) Supply Vessels
10l
2l
Heavy Comp
Distillation Column Reactor (2 l)
HeatingCooling System
Centrifuge Operator Station
Fig. 1. Process diagram of the kilo-plant
There are many aspects in product synthesis and operation research, including process design, modeling, optimization, monitoring, control, safety analysis, scheduling. They are intrinsically strong coupling. In consequence, they should be considered in a
Integration of Chemical Product Development, Process Synthesis, and Operation Optimization
39
systemic approach rather than in a traditional isolated way. The kilo-plant constitutes the core of the experimental platform towards the integration of product development, process design and operation. As shown in Figure 2, the experimental platform consists of three main layers: 1) In the bottom level, the kilo-plant and a number of process simulators, including ASPEN Plus, Dynamics, Simulink, SuperPro, and the real-time platform G2, to facilitate integrating a variety of process operation tasks. They are used as experimental objects in the platform. 2) In the middle level, a small distributed control system, CENTUM-CS1000, is used. Data acquisition and information transmission are implemented with the application of DataCON, where noise in the process parameters is eliminated. They work together to realize the data exchange among the basic control system and advanced applications. Opening Database Connection (ODBC) and Common Object Request Broker Agent (CORBA) are followed to realize communication among these software systems in the platform. The Standard for exchange of product data (STEP) is used for information integration. 3) Advanced applications involve fault detection and diagnosis, scheduling and optimization, safety evaluation, product quality control, which are illustrated in the top level of the process operation system, as shown in Figure 2. We developed a real-time expert system for the process and equipment operation based on G2 system (Qian et al., 2005). Aspen Plus is used to simulate the process for parameters optimization by comparing with the operation state of the kilo-plant. Fault detection & diagnosis G2
Scheduling and optimization GAMS
Safety evaluation
… ProductQuality control
Process simulation Aspen
Process monitoring Data acquisition and rectification DataCON
Database
Process Control CS-1000 Process simulators Aspen Dynamic, Lab CVI
Process equipments Kilo-plant
Fig. 2. Structure of the experimental platform of process development and operation
To realize remote monitoring control and data interaction, an information interaction platform was established including workstation, remote monitoring custom terminal, network, real time database, distributed database, graph user interface and application tools, which facilitate the use of object oriented data model, simulation, and optimization.
40
X. Li et al.
3. Integration of product and process design Chemical manufacturing processes are to transform raw materials to final products with many different physical and chemical processing steps. With the kilo-plant platform, the practical and key concepts of product engineering technology concerning the product design and process development is developed and examined in a systematic way of three levels. On the microscale level, chemical product engineering investigates the basic models of product quality influenced by active materials with complicated molecular structures, interaction between molecules, and their quantitative relations, such as reaction activity, solubility etc. The theories and methods of computer aided molecular design (CAMD), group contribution method, and group connectivity index models are applied to establish the quantitative structure-activity relation (QSAR). Then, the nonlinear interaction models of component, micro structures, multifunctional and constrain relationship of the product are formulated. The multi-objective nonlinear programming is applied to formulate design modeling and optimization, in order to find the theory and computer model of multiple level structure and compatibility scheme for design of fine chemicals and new materials (Cussler and Wei, 2003). The kilo-plant supports to explore the impact of the adjustment of process parameters on the product quality. Product model can be formulated through relating the performance index to components, micro-structure, and the process operation conditions. On the mesoscale level, the integration of product design and process design make it easier to adjust the product structure and its properties which will accelerate the development process. In the process design and product manufacture, the influence of the operation parameters and processing ways on product micro-structure and properties can be considered. For example, in reaction system, concentration ratio of the raw material and product is influenced by temperature, pressure, and flow rate etc. Different catalysts also affect the reaction selectivity during the process experiment. As to the separation process, the behaviors of the phase equilibria should be clear during the process design. On the macroscale level, product design is also an intriguing area of research (Cussler and Moggridge, 2001), although industry has practiced product design for a long time. The emphasis is on the time of new products to market needs, and the systematic exploration of alternatives for developing new products, which is typically a multidisciplinary task that needs both scientists, engineers of different disciplines and business people. Currently, our effort focuses on the interactive application on the microscale level and mesoscale level. Data can be gained not only from practical operation but also from the commercial software, such as Gaussian, MesoDyn, DPD, CFD(Fluent), and gPROMS. On the kilo-plant, the acquirable process data include those of the size of equipments, the cost of operation, the flow rate, component, the yield and quality of product, temperature, pressure, and decision making data, those of the rate and purity of product, and also control data, those of the preset value of variable and control parameters. These acquirable data provide abundant and useful data for the design of chemical product and the comprehensive studying of process development. Computer-aided tools are applied to monitor the kilo-plant operation and data acquisition. Therefore, the production specifications and operation modes can be adjusted online with the support of the data analysis. It assures the optimal operating conditions not only for the operation units, but also for the whole process.
Integration of Chemical Product Development, Process Synthesis, and Operation Optimization
41
4. A case study of integrated development of product and process A case for the production of Nipagin ethyl ester was carried out in the kilo-plant. It is a new anti-mildew and antiseptic agent which has the best inhibiting effect on aflatoxin in food, drink, cosmetics and medicine. It features low cost in production and safety in application. Synthesis of Nipagin ethyl ester is carried out with the kilo-plant to illustrate the application of computer-aided system integration in product quality control in batch process. Nipagin ethyl ester is produced through the reaction of ethanol with Nipagin acid (p-hydroxybenzoate acid). The model of the reaction is developed according to the laboratory analysis results. The 2-liter reactor is chosen for this reaction. Dodecylbenzenesulphonic acid (DBSA) is as catalyst while benzene as water carrying agent. The mole ratio of Nipagin acid to ethanol to catalyze is 1:5:0.06, and acid to water carrying agent 1:0.05, respectively. Nipagin acid dissolved in ethanol is added to the reactor from the top in three times. DBSA, benzene and ethanol are added from raw material tank through peristaltic pump. The pressure in the reactor is maintained at normal atmosphere. As the reaction starts up, the reactor jacket temperature is 85 . The flow of cooling water is adjusted to a temperature of partial condensation. The condensed liquid in the total condenser is composed of water, benzene, and ethanol. During the reaction operation, the samples are taken from the reactor to examine the composition with HPLC in each 30 min. When the reaction runs about 5 hours, the vapour temperature increases greatly, indicating the reaction approaching the end. To adjust the pH value to 7, and the temperature to 40 , then shut down the reactor running. After stewing, crystals appear. The process optimization requires product and process models, to adjust the parameters of the process operation, such as pH value, dynamic temperature trajectory. The operation of the kilo-plant is monitored with 15 sensors of a variety of process variables, such as temperature, pressure, flow rate, pH value, and the rotation speed of stirrer etc. In addition, the instruments for the kilogram scale equipment ensure high frequency data collection and high accuracy parameter measurement and control. In the kilo-plant, the accuracy of temperature measurement is of ±0.1 , while remote data transmission from the installation to the database is conducted in a 0.2s interval for a reliable real time monitoring and dynamic process analysis. In the Nipagin ethyl ester synthesis case, the reaction conversion, reaction dynamics, kinetics analysis, and the process conditions adjustment, control strategy for product design and process design integration are integrated investigated. In terms of the product quality and purity, the process development and the associated operating conditions modifications in the kilo-plant can't be easy realized in the ordinary chemical laboratories.
5. Conclusions Green chemical product design and process development are among the most important research areas of chemical product engineering. The implementation of the kilo-plant experiment platform, modeling, simulation and quantitative analysis of chemical product structures will not only make it more effective to realize flexible operation, but also reflect the dynamic change of the process to adopt an advanced control strategy and system integration method. At the same time, the feasible scheme screened will accelerate the development of the manufacture process for the product. Because it is more convenient to adjust the developing route of the new product, on the other hand,
42
X. Li et al.
the problems likely occurred in the actual industrial production can be tested, discovered and solved a priori. These make the chemical engineering research respond faster to the technical difficulty of the chemical product manufacture and fulfil the market demands for a variety of new green chemical products.
6. Acknowledgements Financial supported from the National Natural Science Foundation of China (No. 20536020, 20876056) are gratefully appreciated.
References Burgess, A. A. and D. J. Brennan (2001). Application of life cycle assessment to chemical processes. Chem. Eng. Sci., 56, 2589-2604. Cussler, E. L. and J. Wei (2003). Chemical product engineering. AIChE J., 49(5), 1072-1075. Cussler, E.L. and G. D. Moggridge (2001). Chemical Product Design, Cambridge Univ. Press. Fermeglia, M., et al. (2003). Molecular modeling and process simulation: Real possibilities and challenges. Chem. Biochem. Eng, 17(1), 19-29. Grossmann, I.E. (2004). Challenges in the new millennium: product discovery and design, enterprise and supply chain optimization, global life cycle assessment. Computers & Chem. Eng., 29, 29-39. Grossmann, I.E. and A.E. Westerberg(2000). Research challenges in process systems engineering. AIChE Journal, 46(9), 1700-1703. Hasebe, S. (2004), Design and operation of micro-chemical plants –bridging the gap beteween nano, micro and macro technologies. in Proc. Intern. Symp. on Proc. Sys. Eng., 89-100. Elsevier. Qian, Y, J.Z. Pan, and L. J. Zhang (2004). Structure- property relationships and models of controlled drug delivery of biodegradable microspheres. Chinese J. Chem Eng, 12(6), 869-876. Qian Y., M J Zheng, X X Li (2005). Implementation of knowledge maintenance modules in an expert system for fault diagnosis of process operation. Expert Sys. with Appl, 28(2), 249-257. Qian, Y., Z.H. Wu and Y. B. Jiang (2006). Integration of chemical product development, process design, and operation based on a kilo-plant, Progress in Natural Science, 16(6), 600-606.
Wörz, O. (1995). Process development via a miniplant. Comp. Chem. Eng., 34, 261268.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. Jeżowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
43
Uncertainty, decomposition and feedback in batch production scheduling Sebastian Engell Process Dynamics and Operations Group, Department of Biochemical and Chemical Engineering, TU Dortmund, Emil-Figge-Str. 70, 44227 Dortmund, Germany
[email protected]
Abstract In this paper, we consider production scheduling as a control problem under uncertainty. First the similarities and the differences between process control and online scheduling are discussed. A key issue in both contexts is the handling of uncertainty in feedback structures. It is advocated to use explicit models of the uncertainties in the form of scenario trees and to include the existence of feedback by solving two-stage models on rolling horizons. The interaction of planning and scheduling in the presence of uncertainty and feedback is discussed. The proposed model structure is a “telescopic” multiscale model where the layers are coupled by targets for and feedback information about the states of the system. Keywords: Online planning and scheduling, uncertainty models, multi-layer scheduling
1. Introduction Only in rare cases, chemical production plants can be run at full capacity and under the same operating conditions, producing the same product over long periods of time. Usually, the throughput, the operating conditions, and also the products have to be adapted to changing demands, product prices, availability and prices of raw materials etc. The ability to react to these changing conditions and still to maintain a profitable operation is generally called flexibility. Flexibility comes at a price: a lower throughput increases the fixed costs, varying products cause changeover times, off-spec products, and a broad spectrum of products requires a broader set of equipment that is only partly used for each individual product. The more complex and specialized the products are and the smaller the volumes of each individual product, the higher the need for flexibility. The highest degree of flexibility is provided by multi-product plants, usually operated in batch or semi-batch mode. Recently, concepts for increased flexibility with respect to capacity and to the spectrum of products have also been proposed for continuous production, using modularized plants with intensified unit operations. The economics of flexible plants are strongly affected by the efficient use of the available resources and by the ability to meet the demands of the customers with highquality products that are delivered on time. The latter can always be achieved by either keeping a large stock of products or by providing large spare capacity, doing this exceedingly however contradicts the goal of profitable operations. Hence, as discussed in many papers on production planning and scheduling, the management or planning and scheduling of the available resources is a critical, but very complex task. In recent years, remarkable progress has been made in the modeling of planning and scheduling problems by MILPs and their efficient solution (see e.g. Kallrath, 2002, Floudas and Lin, 2004, Castro and Grossmann, 2006, Castro et al. 2006, Ferrer-Nadal et
44
S. Engell
al., 2007). Besides classical MILP techniques, other numerical approaches as e.g. evolutionary algorithms (Till et al., 2007, Sand et al., 2008) and automata-based methods (Panek et al., 2008) have also been proposed and demonstrated to be successful for small to medium-sized examples. These important developments provide the basis for the implementation of real production control systems, similar to the use of advanced continuous optimization techniques in RTO and model-predictive control, e.g. reported in (Janak et al., 2006a,b). When designing such systems, besides the representation of the problems at hand as static mixed-integer optimization problems and their solution, the problem formulation in a dynamic context must be addressed. This contribution tries to discuss communalities and differences of process control and online scheduling, in particular the representation of uncertainties, hierarchical decomposition, and rollinghorizon formulations in the context of feedback structures..
2. Process control vs. online scheduling – similarities and differences Both conventional process control and online scheduling are reactive (and partly proactive) activities that have to cope with uncertainties and changes of operating conditions and targets and therefore employ feedback and feed-forward information structures. In (continuous) process control, the focus is on the control of qualitative properties of streams by changing the operating conditions of the plant. The resulting mass flows of raw materials or of products are usually prescribed externally. The challenge is to keep the quality parameters constant or to track time-varying set-points for these parameters, possibly under changing throughputs. The control of the mass flows as well as of the inventories is a less important problem that usually can be taken care of by low-level controls. Feedback control is mainly needed to handle the uncertainties involved, the uncertainty on the dependence of the process outcomes on the degrees of freedom that can be manipulated (inputs) – lack of models or plant-model mismatch – and the existence of external influences that influence the quality parameters and the economics of the process – summarized under the term disturbances. Process control is concerned with meeting the constraints on quality indicators, internal states (e.g. maximum pressures or temperature variations), and flows. Due to the size of plant-wide control problems, often a hierarchical decomposition as shown in Fig. 1 is employed.
Figure 1: Hierarchical process control system and hierarchical planning and scheduling system
The so-called real-time operation (RTO) layer determines the set-points of the lower control layer by a steady-state optimization of the plant performance. The lower level implements these set-points in the presence of dynamic disturbances and deviations of the plant behavior from the model that is used on the RTO layer, to the best extent possible. The RTO layer performs its optimization based on accurate models of the steadystate behavior that are updated using measured data. On the lower level, usually linear MPC controllers or conventional PID controllers are used, and the discrepancy between the assumed linear models and the actual plant behavior is handled by feedback, an as-
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
45
pect that has been extensively discussed in the control literature under the term robust control. Recently, also nonlinear model-based controllers have been used on the lower level. As discussed in (Rolandi and Romagnoli, 2005, Engell, 2007), due to the advances in nonlinear dynamic optimization algorithms, in process control nowadays the option of a fusion of the two layers into one online optimizing feedback control layer is feasible and provides opportunities to improve the dynamic operation of the plant. This avoids several disadvantages of the layered approach, in particular a delayed reaction to disturbances due to the necessity to reach a new steady state before new set-points are computed and mismatch of the optimization criteria on both layers if optimization-based (MPC) control is employed on the lower layer. In contrast to the situation in continuous control, the complexity of the problems does not admit a monolithic single-layer formulation of medium-term planning and scheduling for real-world problems. In continuous process control, feedback is implemented based on measured or estimated values of (all or some) state variables of the process which are qualitative properties of the material along the flow through the plant. Inventory levels are allowed to vary to some extent in order to absorb some variability. In online scheduling, the quality indicators which are of predominant interest in continuous control are considered only in a discretized (abstracted) fashion: a batch production step is terminated successfully or not, in the latter case possibly causing the necessity of additional operations, it delivers certain amounts of products A, B, C, … and it requires certain resources for certain periods of time. The reference trajectories define mass flows of (discrete) products over time, averaged over certain intervals or as impulses at certain points in time (for fixed delivery dates), and the evolution of the inventories. Feedback and feed-forward control manipulate the timing of events – mainly the start times of production steps – and possibly the corresponding amounts of material (batch sizes). The state of the production process in scheduling is defined by the amounts of material stored, by the states of the resources (binary: operational or not, discrete: last operation was A, B, C, or continuous (rarely)) and by the progress of the running operations (discrete or continuous). From the scheduling point of view, the state (in the sense of process control) of the continuous parameters of the material and of the equipment only matters as far as it influences the durations of the operations and the amounts of material delivered upon termination. Consequently, the information obtained from the running processes in a feedback structure should be an accurate prediction of the expected finishing times and of the yields of the running batches. Uncertainties in online scheduling are related to the availability of resources (breakdowns, lack of personnel), uncertain yields or unsuccessful production steps, uncertain durations of operations, and, often most importantly, dynamically changing demands or targets. Both in process control and in online scheduling, the difficulty of the control problem is due to the “inertia” of the processes – the energies and masses stored in the plant in the case of continuous control and the inventories and the irreversible allocations of resources to processing steps in batch plants. The lower this inertia, the faster the production process can be adapted to changing market conditions. Agility roughly is the available range of the degrees of freedom relative to the inertia of the system. The smaller the inertia and the larger the range of the inputs, the faster transitions can be implemented. Translating this into online scheduling, the inertia is determined by the available resources relative to the work in progress and the associated blocking of resources,
46
S. Engell
plus the inertia of the procurement of raw materials. The inertia of the plant and of the procurement of raw materials and other resources causes the need for planning on longer horizons. Planning can be understood as the generation of the reference trajectories for the plant and for the procurement of material, similar to the computation of the optimal operating conditions in process control. In the standard approach to plant-wide control shown in Fig. 1, the upper layer performs an infrequent adaptation of the reference values for the low-level control system, and the inertia of the plant that prohibits an abrupt change of the controlled variables is taken care of by the lower layer, inevitably causing a transient period where the variables deviate from the set-points. In continuous plants with frequent product changeovers, the sequences of the changes of the set-points as well as the trajectories between these set-points can be included in the optimization to control the effects of the transient periods better, see e.g. [Marquardt]. Interestingly, in process control the variation of the controlled variables around their set-points has mostly been considered as natural and inevitable, and the idea to constrain quality indicators directly in the control algorithm rather than only reducing the variation around the set-points by optimal tracking is a relatively recent idea (Toumi and Engell, 2004, Rolandi and Romagnoli, 2005). In contrast, in planning and scheduling, targets given to the lower level are often considered as rigid, and the inability to meet these is often assumed to imply the need of a revision of the targets. In online production scheduling, the need for longer-range planning is mostly caused by the interaction with upstream or downstream units (or the respective markets), i.e. the necessary procurement of the raw materials and the request for the delivery of products to customers at fixed times, in contrast to a production from and into large storage tanks. The task of medium-term planning is to synchronize the operations in the various units, to procure the necessary materials in time and to filter the demand variations by deciding how much material is produced to store, to match the temporal spread of the demands and the production orders in campaign production and by adapting the promised delivery dates of the orders according to the available capacities so that the lower level targets are realistic and reliable delivery dates can be promised to the customers. Tightly coupled to this is the planning of the inventories both of raw and of finished materials which increase the flexibility of the overall system in several ways: the available resources can be used more efficiently if the timing of the production leaves room for optimization, unplanned demands can be covered, and breakdowns or other problems do not cause delivery problems. On the other hand, large stocks of material cause cost because of the capital that is not active (an issue that sometimes is overestimated because it is only the interest on this capital that can be saved by lower stock levels) and, more importantly, by products that ultimately cannot be sold or of raw materials that are not used because of lack of demand. The medium-term planning layer itself is confronted with a continuous stream of demands, of information on the actual progress of the production steps and of the actual sales. Moreover, if has to take dynamically varying conditions on the production level in account where the capacities of the units may vary both in a planned fashion and by unplanned shutdown, maintenance etc. Both layers, medium-term planning and scheduling are highly reactive and face considerable uncertainties in their planning data. Similar to the hierarchical decomposition of process control tasks, the hierarchical structure shown in Fig. 1 (right) results. The communication between the layers and the for-
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
47
mulation of the corresponding optimization problems is discussed in more detail in section 4 below. Both in continuous control and in online production scheduling, model abstractions are used on the higher level of the hierarchy. As mentioned above, in control, the abstraction employed usually consists of neglecting the dynamics or the inertia of the plant. This can be seen as an extension of the time horizon to infinity where the small transient periods can be ignored. On the other hand, the models on the upper layer can be more detailed, often rigorous models obtained from first principles, while on the lower layer linear approximations, often obtained from data, are used. In scheduling, abstraction is performed similarly by aggregating demands and production over time (slots, buckets) and by neglecting resources and production steps that are not critical for the actual production outcome. However, the more efficient the production system is the less easy it is to determine bottlenecks a priori and they may shift dynamically depending on the allocation of the jobs. Summarizing, both in process control and in online scheduling, the task of the operational layer is to use the available degrees of freedom to reach the targets set by the upper layer in the presence of uncertainties and model inaccuracies. In both cases, feedback is applied to cope with the uncertainties, including the effects that are not modeled on the upper layer. In both cases, additional operational degrees of freedom are required to counteract the uncertainties and to cope with the aspects that are not included on the higher level: the dynamics of the plant in the case of process control and the unmodelled tasks and resources in the case of scheduling. Only if such additional degrees of freedom are available, a compensation of the effect of the uncertainties is possible. Control systems and online scheduling algorithms have to react to information on the actual situation that arrives iteratively. In model-based control and in model-based scheduling, the decisions are optimized over a forecast horizon in order to take longer term effects due to the inertia of the controlled system into account, but only a subset of “next” decisions or optimized variables have to be fixed and implemented based upon the available information. Moving horizon schemes were first employed in process control but are increasingly used in planning and scheduling, see e.g. (Sand et al., 2000), (Engell et al., 2001), (Kelly and Zygnier, 2008), (Pujgjaner and Lainez, 2008). On the other hand, the use of two-stage formulations to include uncertainties as well as the future reaction of the controller (resp. scheduler) to the realization of the uncertainty into account provides also a suitable non-conservative formulation for robust model-predictive control (Dadhe and Engell, 2008).
3. Uncertainty and feedback in a dynamic scheduling context Uncertainties are a major element in any real-time decision problem where the information about the presence and the future unfolds iteratively. Besides the uncertainty on the future demands, in medium-term planning and in online scheduling, the information on the capacity and the constraints of the plant is to some extent uncertain, due to model abstraction on the higher level and to incomplete knowledge and stochastic events on the lower level. In control problems, it is usually assumed that the reference trajectories are fixed and known over the horizon over which the online optimization problems are solved, but that the plant dynamics are not exactly represented by the model used. The usual approach in model-predictive control to handle these uncertainties is to modify the references and the constraints by the observed difference between the predicted and the ob-
48
S. Engell
served outcome of the application of the control moves in order to obtain offset-free control. Due to plant-model mismatch, i.e. the gradients of the plant dynamics and of the constraints with respect to the free inputs are not known exactly, the optimization will usually provide a suboptimal, but feasible operating point (Forbes and Marlin, x). Techniques to modify the gradients based upon measured information have been proposed by (Tatjewski, 2002) and (Gao and Engell, 2005).A second element that introduces feedback in order to counteract the uncertainties is the estimation of the plant state from the available measurements and the update of the optimization problem using the new estimates of the state of the model. 3.1. Representation of uncertainty in scheduling For the handling of the uncertainties in online scheduling, four basic approaches have been proposed: - full event-driven or periodic rescheduling - reactive scheduling - robust scheduling - multi-stage or two-stage stochastic scheduling. The most straightforward approach to handle uncertainties is dynamic rescheduling. Taking into account the real progress of the operations and new information about the production targets, all decisions that can be modified are recomputed iteratively or if major events are encountered, using a fixed nominal model or including model adaptation. This is similar to the approach in model-predictive control when the optimization is iterated over a shifted horizon, the new (observed or estimated) plant state is taken into account and the targets are shifted by the difference of the planned and the real outcomes. The critical aspect of pure rescheduling is the issue of feasibility. There is no guarantee that the process will not run into deadlocks (or very unfavorable situations) because of the discrepancies between the assumed and the real evolution. A key role of humans in the production process is to foresee such situations and to correct the planned actions accordingly. If the computation time required for full rescheduling is too long for a frequent online application, it can be approximated by reactive scheduling. Reactive scheduling modifies nominal schedules as a reaction to the occurrence of unexpected events (see e.g., Cott and Macchietto, 1989; Honkomp et. Al., 1997; Kanakamedala et al. 1994; Mendez and Cerda, 2004; Vin, and Ierapetritou, 2000, Janak et al., 2006a,b). The underlying models themselves usually do not incorporate information about the uncertainties. Reactive scheduling is present in any real production, often performed by the plant managers directly or induced by the process itself –e.g. when the preceding step is finished late, the start-time of the next one is adapted. The analogy to reactive scheduling is the use of nested low-level controllers to implement set-points in process control. Hereby, the effects of disturbances and plant uncertainty are reduced, variability is shifted from the controlled variables to the manipulated inputs. By using carefully chosen regulatory control loops, some of the potential of rigorous optimization can be recovered (Skogestad, 2000, Engell et al., 2005). Robust scheduling and multi-stage scheduling are variants of stochastic scheduling. Here models are employed that take uncertainty explicitly into account. Stochastic models with recourse consider the corrective measures that can be taken after the realization of some uncertain parameters while in robust scheduling, this option is not included.
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
49
In robust scheduling, the parameters of the scheduling problem are considered as uncertain, usually varying in certain intervals, with or without knowledge of the distribution functions of the variation. Scheduling is then performed such that the best value of the cost function is achieved and all constraints are met in the worst possible situation. Jia and Ierapetritou (2004) investigated the use of MILP sensitivity analysis in robust shortterm scheduling under demand uncertainty. Balasubramanian and Grossmann (2003) proposed the use of concepts from fuzzy set theory to describe imprecisions and uncertainty for the minimization of the makespan of flowshop scheduling with uncertain task duration. Lin et al. (2004) and Janak et al. (2007) proposed an efficient MILP optimization methodology for generating schedules that are robust in the sense that the solutions are feasible (with a prescribed infeasibility tolerance) in the presence of uncertainties in the inequality constraints for interval bounds on the parameters and, with a prescribed probability, for probabilistic uncertainties in the inequality constraints, and optimal with respect to the nominal cost function This methodology was applied to short-term scheduling with uncertainties in processing times, demands, and cost coefficients. The problem of robust scheduling – and similarly of min-max formulations in model predictive control – is that the computed solution is feasible for the worst case but may fail to realize the potential of the real plant in all other situations. It corresponds to a pessimistic open-loop approach – all decisions are fixed and computed for the worst possible situation. Note that the concept of iterative optimization on a rolling horizon does not alleviate this problem – the decisions that are implemented are based on pessimistic (worst-case) assumptions and cannot be corrected while in the simple rescheduling approach they are based on average or optimistic assumptions. On the other hand, feasibility is always assured, given that the bounds include all possible situations that are met in the future. In the dynamic context, however, the future decisions can be adapted to the realization of the uncertainties, and this provides significant room for better choices of the decisions that have to be fixed here and now. A multistage stochastic decision problem is characterized by a non-anticipative information structure. The problem description includes stochastic aspects modeled either by continuous probability distributions or by a finite number of scenarios (the latter case is usually considered because it is computationally better tractable). If the uncertainty is modeled by a scenario tree with N stages (see Fig. 2), then the decision process progresses along this scenario tree as well. In stage i, the decision is based on the certain information on the realization of a path in the tree up to this node whereas the future evolution is only known probabilistically, and is represented by the sub-tree that starts at the corresponding node of the tree (Till et al., 2008). To solve multi-stage problems, at each stage the reaction of the algorithm to the information obtained at later stages must be taken into account, leading to a complex nested structure. Therefore multi-stage problems usually are approximated by two-stage problems, as shown in Fig. 2 (right). The decision variables are divided into the first and secondstage vectors x and yȦ, which belong to the sets X and Y, possibly with integrality requirements. The vector x represents “here and now”-decisions which are applied regardless of the future evolution and thus have to be identical for all scenarios. In contrast, the vectors yȦ denote scenario-dependent recourses under the assumption that the respective scenario realizes.
S. Engell
50
Figure 2: Multi-stage (left) and two-stage (right) stochastic optimization problems represented by scenario trees
The objective is to minimize the first-stage costs plus the expected second-stage costs calculated using the weighting-vectors c and qȦ. The uncertain parameters are represented by a finite number of realizations (scenarios) Z with corresponding probabilities SZ . The objective is to minimize the first-stage costs plus the expected second-stage costs calculated using the weighting-vectors c and qȦ. In the mixed-linear case, this leads to an optimization problem of the form :
min c T x ¦ S Z qZT y Z x , yZ
s .t . Ax d b ,TZ x WZ y Z d hZ ,
(1)
Z 1
x X , yZ Y ,Z
^1, ,: `, X IR
n1'
u IN
n1' '
,Y IR
n2 '
u IN
n2 ' '
.
The parameters of each realization enter into the matrices TZ, WZ and the vectors hZ, qZ. In Fig. 2b, the first stage comprises the variables associated with stages 0-3 whereas the second stage comprises the variables associated with stages 4-10. The mathematical framework of two-stage stochastic programs provides a modular modeling concept for uncertainty conscious scheduling problems: In principle, any deterministic scheduling model can be extended to a stochastic model provided that the uncertainties affect only the parameters of the formulation. The extension requires the definitions of (1) scenarios for the uncertain parameters along with their probabilities, (2) first stage variables (3) an appropriate objective (e.g. expected value, excess probability). The approximation of a multi-stage problem by a two-stage problem corresponds to an optimistic assumption about the future: It is implicitly assumed that after the first stage decisions have been implemented, all uncertainties are revealed and the subsequent decisions are the optimal ones for the scenario that materializes. In fact, this optimal decision cannot be computed because of the sequential nature of the problem. However, the formulation guarantees that for each optimal first stage decision there is a feasible second-stage vector yZ. for all scenarios Z= 1 ...:The above formulation can be extended to include measures of risk either by adding constraints for risk-aversion or by setting up a two-criteria problem and computing Pareto-optimal solutions. When integer requirements are present in the recourse, the resulting stochastic integer program is often of large scale and cannot be solved easily without incorporating de-
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
51
composition based methods or problem-specific heuristics. Therefore solving stochastic integer programs is sometimes avoided by assuming that all integer decisions are firststage variables. 3.2. Review of scenario-based stochastic formulations of scheduling problems Sand et al. (2000) and (Engell et al. 2001) extended a multi-period model for the medium-term planning of an industrial multi-product batch plant for the production of expandable polystyrene (EPS) to a two-stage model. Interesting features of this example are that the production is strongly coupled, i.e. each batch yields several products and that the final continuous processing stage involves mixing of material from different batches. The model considers uncertainties in demands and in capacities. The objective is to maximize the expected profit including a measure of risk aversion. The first-stage decisions consist only of integer variables and the second-stage decisions consist of integer and continuous variables. Sand et al. (2004) applied the dual decomposition based algorithm of Carøe and Schultz (1999) to solve the resulting stochastic integer programs with approximately 600 continuous variables, 100 integers, and 500 constraints in each of 1024 scenarios. Solutions with a gap of less than 9% were found within 4 h of CPU-time. Their programs are based on discrete-time multi-period models where the stages correspond to the time periods. Vin and Ierapetritou (2001) extended the event based continuous time model of Ierapetritou and Floudas (1998) to a two-stage stochastic program and minimized the expected makespan. They observed that using the stochastic model increased the robustness of the solution. Furthermore, they compared the use of deterministic and stochastic models in the reactive scheduling framework of Vin and Ierapetritou (2000) and found that the reactive scheduling performance was not necessarily improved by using the robust solutions obtained from stochastic models. Bonfill et al. (2004) extended a continuous time batch-slot concept model to a two-stage stochastic program and optimized the weighted sum of the expected profit and a risk term. The first stage comprises all binary and integer decisions of the detailed schedule while the second-stage consists of the remaining continuous decisions as e.g. sales. They observed an improved performance of the stochastic scheduler for a flowshop example. Balasubramanian and Grossmann (2004) modeled integer recourse decisions explicitly in a multi-stage stochastic integer program. Each of the M stages corresponds to a time period and the decisions are assigned corresponding to the stages. An additional stage is added to consider the continuous variables for the amounts sold and lost, the costs, and the revenues after the end of the scheduling horizon. A shrinking-horizon approximation scheme for multi-stage stochastic integer programs was proposed based on the solution of a series of two-stage stochastic programs with continuous secondstage. At stage i, all decisions of stage i to M are taken as the first-stage variables, while the second-stage decisions consist of the continuous recourse decisions of the stage M + 1. The variables that correspond to stage i are fixed, then the procedure is repeated for the remaining stages i+1 to M. Gröwe-Kuska et al.(2005) reported the application of multi-stage programs with mixedinteger recourse for the short-term unit commitment of hydrothermal power systems under uncertainty. The dimension of the multi-stage problems ranges up to 200,000 binary and 250,000 continuous variables. The model was solved by a problem specific scheme based on Lagrangian relaxation that exploits the existence of loose couplings between the units. Two-stage stochastic programming has also been applied in produc-
52
S. Engell
tion and supply chain planning (e.g. Ierapetritou et al. 1995, Clay and Grossmann, 1997; Gupta and Maranas, 2003). Goel and Grossmann (2004) applied stochastic programming to the planning of off-shore gas field developments where the uncertainty is partly endogenous, and Tarhan and Grossmann (2008) considered the optimization of investments into production plants under uncertainty modeled as a multistage stochastic program where the uncertainty is gradually removed. Alonso-Ayuso et al. (2005) proposed two and multi-stage programs with mixed-binary recourse for production planning and scheduling problems under uncertainty. Guillen et al. (2006) used two-stage stochastic scheduling models on a shrinking horizon to evaluate the design of supply chains under demand uncertainty. Wu and Ierapetritou (2007) integrated a two-stage stochastic planning model on a moving horizon into a hierarchical planning and scheduling approach. Puigjaner and Lainez (2008) employed a twostage stochastic formulation in supply chain optimization and also related this explicitly to the rolling horizon approach used in model predictive control. Their model integrates the financial situation of the supply chain. In Cui and Engell (2009) the two-stage formulation is applied to the moving horizon medium-term planning problem of the EPS example mentioned above. In order to avoid the blow-up of the problem size with the length of the second stage, the more distant future is represented by only one deterministic scenario with the expected values of the parameters whereas the immediate future is represented by a tree of different scenarios of production capacity and demand evolutions.
Figure 3: Moving horizon two-stage stochastic program in period i
The plant is scheduled under uncertainties ȟ = {ȟ1, ȟ2, . . . ȟI-1} which are independent discrete random variables with discrete distributions ȥ(ȟi) in a time horizon with I periods as shown in Fig. 3. x1, x2, … xI are the mixed-integer decision variables in each period. The near future within the next I1 periods and represented by f2(g) is modeled by a tree of scenarios in the combined sample space Ȧęȍi of the future demands whereas the more remote future within the following I2-I1 periods is represented by the expected values (EVs) of the stochastic variables (cost contribution f3(g) ). As the inclusion of the more distant future predominantly has the purpose to rule out unrealistic solutions that maximize the benefit over a short horizon at the expense of the long-term performance, and realistic scenarios are difficult to generate for the distant future, this is a reasonable simplification. Both time horizons are rolling in the time coordinate i. In step i , as shown in Fig. 3, a 2SSIP model with the past optimal decisions x1*i 1 , actual decision variables xi, realized uncertainties ȟi-1, additional uncertainties [ i I1 1 and EVs for the distant future [i I1i I2 1 is solved and the first stage optimal solutions x*i are im-
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
53
plemented. Period i is the first stage and period i+1 to period i+I2 constitute the second stage in the 2SSIP setting. The strength of the formulation of scheduling problems as two-stage stochastic decision problems is that it is perfectly adapted to a rolling-horizon approach where the decisions after the first period are re-computed based upon the new information obtained so that in the decision process, a reaction to the future developments is possible. In other words, the feedback that is present in the real decision structure by the update of the decision vector after each period is represented adequately, in a slightly optimistic fashion, because of the assumption that from some point on a clairvoyant scheduler is employed. In contrast, in a robust formulation, the scheduler bases its decisions on the assumption that the worst possible happens in the future and that no corrective action can be taken. The disadvantage of the approach is the high computational cost that is prohibitive in online applications. In particular, the time until a first feasible solution is obtained by an exact algorithm can be very large for large numbers of scenarios In our recent work, hybrid algorithms were developed that employ stage decomposition. (Till et al., 2007, Sand et al., 2008, Tometzki and Engell, 2009). 3.3. Stage decomposition algorithm for the solution of two-stage programs In a stage decomposition appraoch, the variables and the constraints of problem (1) are separated according to the stages into the master-problem (2) and : subproblems (3). Due to the integrality requirements in Y, the implicit function QZ ( x ) is in general nonconvex. :
min x
f1 ( x ) c T x ¦ S ZQZ ( x ) s .t . Ax d b , x X , X IR n1' u IN n1'' ,
QZ ( x )
(2)
Z 1
min yZ
f 2 ,Z ( y Z ) qZT y Z
s .t . W Z yZ d hZ TZ x , y Z Y ,Y IR n2 ' u IN n2 '' . (3)
The main idea of the hybrid algorithm is to use an evolution strategy (ES) (Beyer and Schwefel, 2002) to address the master-problem (2). An ES works on a population of individuals (pool of solution candidates). The ES interprets a certain instantiation of x as an individual and the corresponding f1(x) in (2) as the fitness of the individual. The fitness is evaluated by solving the independent subproblems (3) using a standard MILP solver. Infeasibilities are handled by penalty terms. Computational experiences show that the hybrid algorithm obtaines good feasible solutions for large numbers of scenarios considerably faster than the decomposition algorithm by Caroe and Schultz (1999) and straightforward application of a MILP solver (CPLEX). When CPLEX has found an admissible solution, however, it converges faster to optimal values of the cost function than the hybrid algorithm.
4. Hierarchical decision structures The motivation of hierarchical decision structures is to reduce the complexity of the problem at hand to make it tractable by humans or algorithms and also to maintain transparency of the solutions. While in most problems all decision variables interact in their influence on the overall performance, this interaction can and should be neglected to some extent because of the presence of uncertainty and of feedback. The presence of uncertainty leads to the situation that detailed decisions beyond a certain horizon are obsolete soon after they have been computed, while feedback remedies the propagation of uncertainty. The decomposition in layers corresponds to time-scale decomposition:
54
S. Engell
long-term decisions are optimized over a long horizon using simplified (averaged) models, short-term decisions are based upon very detailed models taking into account all available information. The temporal resolution as well as the decisions variables included on each level should reflect the precision of the information that is available as well as the duration of the impact of the decisions. Typically, a hierarchical decomposition for the solution of industrial-size problems will include (at least) the layers of longterm planning, mid-term planning and (short term) scheduling. In long-term planning, decisions on the production capacities, on the distribution of production tasks among sites and on the production volumes are taken using aggregate, and usually predicted, hence relatively uncertain data on market demand, cost structures, raw material prices etc. Usually coarse models of the required and of the available resources are used. The accuracy of long-term planning can be improved by performing detailed planning over the full planning horizon using semi-heuristic algorithms (Plapp et al., 2008), however this requires a large effort and the result can then only be used in “what ... if” investigations. The implications of the decisions on this level concern mostly procurement: ordering of material, addition or reduction of production capacities, long-term staff planning. The precision and the temporal resolution of the data usually is low, a resolution finer than a week will usually by not justified, often planning intervals will be months. The update interval may be (considerably) longer than the resolution, so this is an off-line activity with only weak feedback from the daily operations. The medium-term planning and the scheduling layer correspond to the scope of APS (advanced planning and scheduling) systems (Goebelt et al., 2008, Jaenicke and Seeger, 2008). On these layers, all orders that are considered (customer orders or production to stock) have delivery dates and the assignment of production capacities to the tasks is performed based upon a detailed model of the required resources. The temporal resolution 'M on the medium-term planning layer usually will be days or shifts. Short-term scheduling is the exact temporal assignment of all required resources to production tasks. The temporal resolution will be hours or even minutes. 4.1. Review of hierarchical solution approaches Hierarchical algorithms were first proposed for the solution of large scheduling problems that cannot be solved directly with the goal to obtain a near-optimum schedule over the full horizon. (Bassett et al., 1994/1996) proposed to employ different discretizations of time. On the upper layer, aggregated problems are formulated to allocate production tasks to time slots for which a detailed schedule is computed afterwards one-byone. The automatic aggregation of detailed models was refined in (Wilkinson et al., 1995) with special attention to the couplings between the intervals. Dimitrades st al (1997) applied a non-uniform discretization of the time axis where the initial intervals are modeled on a finer grid than the subsequent ones. In each step, the problem is solved over the full horizon, the initial decisions are frozen and the solution process proceeds in a shrinking horizon fashion until a schedule over the full horizon has been computed. Carryovers from one period to the next are handled by extending the detailed model into the next period until all tasks considered have been finished. The idea that only the immediate future needs to be computed in a detailed fashion goes back to Zentner et al. (1996). Papageorgiou and Pantelides (2000) proposed a hierarchical approach to campaign planning. Harjunkoski and Grossmann (2001) used a bi-level decomposition strategy for the scheduling of a steel plant. The products are grouped into
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
55
blocks, and the sequences within these blocks are determined separately, following by an optimization of the sequence of the blocks. Van den Heever and Grossmann (2003) used a rolling horizon approach and a Lagrangean decomposition strategy for production planning and scheduling of a hydrogen plant. Mendes and Cerda (2003) discussed problem formulations and solution algorithms for dynamic scheduling problems where new data arrives iteratively. A hierarchical decision structure that includes explicit models of uncertainty and a hierarchical decomposition was proposed in (Sand et al., 2000) and (Engell et al., 2001) based on the analysis of the scheduling problem for the EPS plant. This plant presents a typical example were on the one hand side decisions have to be taken on a very fine time scale using detailed models but on the other hand have long-term effects that go beyond the horizon that can be dealt with in detailed scheduling. Moreover, the problem data is uncertain, concerning demands, yields, and capacities. The time horizon needed for the decision on the choice of the recipes and the number of batches exceeds the period over which a detailed schedule can be computed. It was proposed to combine a two-stage stochastic medium-term planning model on a coarse time grid with fixed period lengths with a deterministic short-term scheduling model formulated in continuous time that is solved in an event-driven fashion (see Fig. 4). The upper layer was assumed to provide guidelines (numbers of batches for each recipe that are started in a two-day period and states of the finishing lines (on or off)). Feedback is provided by reporting the batches that have been started or are scheduled to start before the end of the computation period back to the medium-term planning layer. On the upper layer, linearized models are used while for scheduling, nonlinear models of the mixers and a partly heuristic MINLP algorithm are employed (Schulz et al., 1998, Engell et al., 2000).
Figure 4: Two-level online decision structure proposed for the EPS process in (Sand et al., 2000)
In this scheme, the medium-term planning problem with uncertainties in demands and yields was formulated as a two-stage stochastic planning problem using aggregate models (Sand et al., 2000, Sand and Engell, 2004) and the problem was solved using the decomposition strategy by Carøe and Schultz (1999). Stefansson et al (2006) proposed a multi-layer architecture for campaign planning and detailed scheduling in the pharmaceutical industry. They propose a three-layer architecture in which on the upper layer, campaign planning is performed over a horizon of 12 months, on the middle layer, a detailed order allocation is performed over a horizon of three months with the goal to confirm delivery dates, and on the lowest level detailed scheduling is performed based upon confirmed customer orders using a continuous-time model. They assume a one-directional interaction between the layers, i.e. there is no feedback from the lower layers back to the upper ones which implies that all proposed decisions on the upper layers can be implemented on the lower layers.
56
S. Engell
Janak et al (2006a,b) applied a temporal decomposition approach to an industrial batch scheduling problem. The decomposition idea is to first determine the time period and the products that are considered in short-term scheduling, and then to solve the scheduling model. The horizon length is maximized under the constraint that the complexity of the resulting problem is bounded, thus enabling reasonable computing times. In the same spirit, Shaik et al. (2008) solve a scheduling problem for a large industrial continuous plant by two-level decomposition. On the upper (medium-term) level, demands are allocated to time slots (sub-horizons), and on the lower level the sequencing of the next operations in the sub-horizon is performed in a rolling horizon fashion. Verderame and Floudas (2008) define a relaxed planning model for large scale problems on the upper layer of a two-level formulation similar to Janak et al. (2006a) where the resources considered are only the bottleneck resources and use this model to generate daily production profiles (targets) for the scheduling layer. Wu and Ierapetritou (2007) proposed a scheme which implements a similar concept as shown in Fig. 4. The planning horizon in their work consists of three stages of different lengths. In the short first stage, the data is assumed to be deterministic and detailed scheduling problems are solved. In the two other stages of increasing lengths that represent the immediate and the remote future, the demands and the production capacity are aggregated. The planning problems are solved using simplified models in which the unmodeled parts of the scheduling problem are represented by a sequence factor that describes how much less products can be obtained due to the additional constraints in the scheduling model compared to the planning model. The planning algorithm determines the amount of product that is required after the first stage, taking into account different scenarios for the future demands with associated probabilities. So the planning model is a two-stage problem with the requested production in the first stage being the here-and-now variables. Depending on whether the scheduling problem is feasible or not, the sequence factor is updated, introducing feedback from the scheduling layer to the planning layer. The results for a case study show the superiority of the approach over pure rolling horizon scheduling approaches with look-ahead of one or two periods, compared to a horizon of 9 periods considered in the planning model, for a situation where the backorder cost is high. The interaction of long-term planning by ERP systems and APS systems is discussed in (Goebelt et al., 2008 and in (Jaenicke and Seeger, 2008) from an industrial point of view. Goebelt et al. assume different models and algorithms on the two layers that are reconciled by overlapping horizons whereas Jaenicke and Seeger propose a top-down refinement approach. (Sousa et al., 2008) discuss a hierarchical multilevel approach to supply chain optimization which is nicely illustrated by an example of active ingredients manufacturing. The proposed approach is to solve a planning problem with aggregated capacities over a cyclic horizon of one year, discretized into 12 planning periods. This provides inputs to the lower scheduling layer, inventory levels of products at locations at the start and at the end of a month, product flows to formulation sites (integrated) per period, product flows to customers (integrated) per period, site opening, allocations of products to manufacturing sites, product supplies to specific customers from specific sites. Based upon this information, schedules are computed at the lower level for each month using detailed recipes and changeover times. On the lower level, the demands are distributed over time whereas on the upper level, they are aggregated to the ends of the months. The inventory levels are considered as constraints whereas the demand satisfac-
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
57
tion is reflected in the cost (penalty terms for late delivery). It is observed that without feedback from the second stage to the first stage, there is a significant mismatch between demands and delivery. In order to solve this problem, capacity correction factors that depend on the number of campaigns planned are introduced on the planning layer and additional constraints are formulated. These measures achieve the goal of reducing the gap between the layers without sacrificing overall production, after some manual adaptations. They increase the inventories computed on the planning level. A direct manipulation of inventory levels did not provide consistently good solutions. 4.2. Considerations on the interaction between medium-term planning and scheduling The relation between hierarchical levels is one of refinement and abstraction. The lower levels include more details on the timing of the production steps and on the resources needed, hence more constraints and more degrees of freedom are present. In the ideal case, these degrees of freedom are sufficient to satisfy the additional constraints that have to be taken into account such that the results of the optimization on the upper layer can be implemented on the lower layer without any violation of constraints. In reality, this will rarely be the case. If, e.g., the production capacity is assumed to be known on a weekly basis on the upper layer and is fully used, it is unrealistic that exactly this amount of products can be produced if more detailed constraints are considered. The simplest way to avoid this situation is to systematically underestimate the capacities when reporting to the higher layer, a strategy that is not uncommon in practice. In general, it cannot be assumed that the implementation of the upper layer decisions is always feasible, hence feedback mechanisms are necessary and it is preferable to provide targets and a cost function that measures the satisfaction of the targets in contrast to restricting the lower layer by hard constraints. Within the horizon under control of the lower layer, as few constraints as possible should be formulated to provide maximum flexibility to the lower layer to cope with unmodelled effects and uncertain parameters and events. The inclusion of explicit descriptions of uncertainty into the models requires a careful design of the decomposition and of the coupling of the layers. Assume e.g. that a solution was obtained on the medium-term planning layer that assigns certain production tasks within the first kM intervals of the planning horizon, taken as first-stage decisions, to the scheduling layer. Then this assignment is based on the assumption of a certain estimated average capacity during the first interval, determined from available information, e.g. on planned maintenance. If the available capacity in the first scheduling interval is higher than this average value, how should the scheduler react? Intuitively, it might be wise to use the higher-than-average capacity in order to account for possible breakdowns in the future. But this would be penalized if the first stage variables from the medium-term planning are used as targets for the scheduler in the respective intervals. In addition, updated information may be available during the scheduling process on the amounts to be produced and on the due dates. Generally speaking, it is not a good idea to fix variables inside the horizon of the lower layer unless these variables really have to be set and are beyond the control of the scheduler. Maximum flexibility should be given to the lower level algorithms to use the information and the degrees of freedom that are available in order to maximize the overall goals in the presence of uncertain parameters, stochastic events and restrictions that are unknown to the upper layer. Conversely, only the information needed to perform the next update on the upper layer should be fed back from the lower layer, e.g. updates on yields, expected capacities, planned resource utilization etc.
S. Engell
58 T0
T0+HS
T0+HS+'M
Online scheduling
T0+ uM'M
X11
iterations 'M
X12
X22 Medium-term
T0+HS+HM 'M
uM'M
planning iteration 1st stage
recourse
Figure 5: Telescopic two-layer moving horizon scheme In Fig. 5, a telescopic two-layer moving horizon scheme is sketched where the mediumterm planning layer employs a two-stage formulation to include uncertain future evolutions. The horizon on the scheduling level is 'S HS = kM.'M, kM 1 where 'M is the length of the time slots on the medium-term planning layer. On the planning layer, a two-stage formulation is used where the length of the first stage is uM 'M The key idea of the scheme depicted in Fig. 5 is to avoid double planning and to link the layers only via target values or predicted values of the “states” of the system. These are the amounts of materials considered in medium-term planning and scheduling at time t, X(t) and the planned resource utilizations after time t, U(t). From the point of view of the lower layer, a target is required that reflects the look-ahead-capability of the upper layer but does not restrict the decisions of the lower layer more than necessary. From the point of view of the upper layer, the predictions of the materials produced or consumed at the beginning of the medium-term planning horizon and of the resource utilization after this time by the scheduling horizon provide the necessary information about the past and the inertia of the system. Iterative medium-term re-planning is not performed over the full scheduling horizon but only over that part of it that lies in the next planning horizon. At time T0 the scheduling algorithm performs an optimization of the resource allocation over the scheduling horizon of length HS taking the actual data on the available resources and the demands and possibly also scenarios of the future resources and demands into account plus targets for the state X(T0+HS) at the end of the scheduling horizon which is provided by the medium-term planning algorithm (X11 in Fig. 5). The end of the scheduling horizon should coincide with the endpoint of a medium-term planning interval, T0+HS = p0ҏ'M, p0 integer. The scheduling algorithm is iterated either after fixed periods of time or when new data is available with the same end point T0+HS as before and the same target state, until the length of the scheduling horizon is less than or equal to HS-ҏ¨M. At this point, the endpoint is shifted to (p0+1) ¨M and the target is the state at T0+HS+¨M as computed by the medium-term planning algorithm in the previous iteration (X12 in Fig. 5). This is iterated until the endpoint has been shifted by the update interval on the medium-term layer relative to the first endpoint. At this point, the medium-term planning algorithm is run to compute an update of the targets. The planning horizon of the medium-term planning algorithm is shifted by uM ¨M. The horizon that is now considered by the medium-term planning algorithm is ((p0+uM) ¨M, p0+uM¨M+HM] and the decisions between (p0+uM) ¨M and (p0+2uM) ¨M are taken as first-stage variables while the remaining ones are recourse variables. After the computation, the decision variables of the first stage are not given to the scheduler but only the resulting values of the planned materials at times (p0+1+uM) ¨M … (p0+2uM) M (X21 and X22 in Fig. 5). At time T0 + uM ¨M the best possible prediction of the state of the system at the initial time (p0+uM) ¨M is the (expected) value that is computed by the scheduling algorithm for
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
59
X((p0+uM) ¨M) and U((p0+uM) ¨M). Therefore this state is used as the initial condition of the medium-term planning algorithm. This scheme is iterated every uM 'M units of time.
5. Summary and Future Research In this paper, we have discussed the design of medium-term planning and scheduling algorithms from a dynamic systems point of view and drawn parallel between process control and planning and scheduling. In summary, medium-term planning and scheduling are reactive activities where decisions have to be made under uncertainty and in real time. Moving horizon formulations with recourse (two-stage or multi-stage stochastic programs) reflect the dynamic nature, the presence of uncertainty and the potential of reacting to the realization of the uncertainties adequately. In addition, measures of risk can be included in the optimization. A drawback is the computational effort which limits the horizon of the second stage and the number of scenarios. The solution of realworld problems requires a hierarchical decomposition, as advocated by several authors recently. In such a hierarchical decomposition, the coupling of the layers is critical. The task of the lower layer should be formulated such that maximum freedom is left for the adaptation to the constraints and the reaction to uncertainties while the overall goal is properly reflected in the cost function. In a hierarchical decomposition approach, the issue of distributed solutions, in particular on the lower layer arises naturally, as this enables the parallel solution of smaller sub-problems. An initial discussion of the coordination between different layers and different decision makers on these layers can be found in (Kelly and Zygnier, 2008). Distributed decision making for more than very few units however has up to now only rarely been investigated in detail in the literature on batch scheduling and is a promising area for future research. At the interface of scheduling and process control for batch processes, there is a potential for a tighter coupling of the optimization of the batch runs which is a prominent topic in process control (see e.g. Srinivasan et al., 2002a,b) and medium-term planning and scheduling. Depending on the schedule, the optimization goals on the control layer can be modified: if the unit is in high demand, a reduction of the batch time by timeoptimal feeding and cooling policies is indicated whereas in a situation where the schedule is not tight, energy could be saved by a different operation policy or the yield could be increased. In the opposite direction, the scheduling layer could be supported by a precise prediction of the expected batch times and yields before the termination of a batch. Finally, the practical success of any sophisticated solution, in control as in scheduling, depends on a good interface to the operators. Optimal policies must be visualized adequately so that they can be understood by the operators. E.g. for well qualified and responsible operators, not only one single result of an optimization run should be provided but a set of several “best” solutions such that they can trade the loss of optimality with other criteria that are not represented in the optimization and gain confidence in the proposed solutions.
6. References Alonso-Ayuso, A., L. F. Escudero, and M.T. Ortuno (2005). Modeling production planning and scheduling under uncertainty. In S. W. Wallace, and W. T. Ziemba (Eds.), Applications of stochastic programming. MPS-SIAM Series in Optimization, 217–252. Balasubramanian, J., and I.E. Grossmann (2003). Scheduling optimization under uncertainty - An alternative approach. Comp. and Chem. Engg. 27 (4), 469–490.
60
S. Engell
Balasubramanian, J., and I.E. Grossmann (2004). Approximation to multistage stochastic optimization in multiperiod batch plant scheduling under demand uncertainty. Ind. Eng. Chem. Res. 43, 3695–3713. Bassett, M.H., F.J. Doyle III, G.K. Kudva, G.V. Reklaitis, S. Subrahmanyam, M.G. Zentner, and D.L. Miller (1994/1996). Perspectives on model-based integration of process operations. Proc. 5th Int. Symposium on Process Systems Engineering, Kyongju, Korea and Comp. Chem. Engg. 20, 821. Beyer, H., and H. Schwefel (2002). Evolution strategies. Natural Computing 1, 3-52. Bonfill, A., M. Bagajewicz, A. Espuna, and L. Puigjaner (2004). Risk management in the scheduling of batch plants under uncertain market demand.. Ind. Eng. Chem. Res. 43, 741– 750. Carøe, C., and R. Schultz (1999). Dual decomposition in stochastic integer programming. Operations Research Letters 24, 37-45. Castro, P., and I.E. Grossmann (2006). Multiple Time Grid Continuous-Time Formulation for the Short Term Scheduling of Multiproduct Batch Plants. Proc. 2006 ESCAPE/PSE, Elsevier, 2093-2098. Castro, P., C. A. Mendez, I.E. Grossmann, I. Harjunkoski, and M. Fahl (2006). Efficient MILPbased solution strategies for large-scale industrial batch scheduling problems. Proc. 2006 ESCAPE/PSE, Elsevier, 2231-2236. Clay, R., and I.E. Grossmann. (1997). A disaggregation algorithm for the optimization of stochastic planning models. Comp. Chem. Engg.21, 751–774. Cott, B., and S. Macchietto (1989). Minimizing the effects of batch process variability using online schedule modification. Comp. Chem. Engg. 13, 105–113. Cui, J. and S. Engell (2009). Scheduling of a multiproduct batch plant under multiperiod demand uncertainties by means of a rolling horizon strategy. Proc. 19th European Symposium on Computer Aided Process Engineering. Dadhe, K. and S. Engell (2008). Robust nonlinear model predictive control: A multi-model nonconservative approach. Presented at the 2008 Workshop on the Assessment and Future Directions of Nonlinear Model-predictive Control, Pavia. Dimitrades, A.D., N. Shah, and C.C. Pantelides (1997). RTN-based rolling horizon algorithms for medium-term scheduling of multipurpose plants. Comp. Chem. Engg. 21, 1061-1066. Engell, S. (2007). Feedback Control for Optimal Process Operation. J. Proc. Control 17, 203-219. Engell, S., A. Maerkert, G. Sand, R. Schultz, and C. Schulz (2001). Online Scheduling of Multiproduct Batch Plants under Uncertainty. In: M Groetschel, S.O. Krumke, J. Rambau (Eds.): Online Optimization of Large Scale Systems, Springer, 2001, 649-676. Engell, S., S. Kowalewski, C. Schulz, and O. Stursberg (2000). Continuous-Discrete Interactions in Chemical Processing Plants. Proceedings of the IEEE 88, 1050-1068. Engell, S., T. Scharf, and M. Völker (2005). A methodology for control structure selection based on rigorous process models. Proc. 16th IFAC World Congress, Prague, Paper Code Tu-E14TO/6. Ferrer-Nadal, S., C.A. Mendez, M. Graells, and L. Puigjaner (2007). A novel continuous-time MILP approach for short-term scheduling of multipurpose pipeless batch plants. Proc. ESCAPE 17, Elsevier, 595-601. Floudas, C. A., and X. Lin (2004). Continuous-time versus discrete-time appraoches for scheduling of chemical processes: a review. Comp. and Chem. Engg. 28, 2109-2129. Forbes, J.F. and T.E. Marlin (1995). Model accuracy for ecconomic optimizing controllers: The bias update case. Ind. Eng. Chem. Fund. 33, 1919–1929. Gao, W. and S. Engell (2005). Iterative set-point optimisation of batch chromatography. Comp. Chem. Eng. 29, 1401–1410. Göbelt, M., T. Kasper, and C. Sürie (2008). Integrated Short and Midterm Scheduling of Chemical Production Processes – A Case Study. In: Engell, S. (Ed.): Logistics of Chemical Production Processes, Wiley-VCH, 239-261. Goel, V., and I.E. Grossmann (2004). A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Comp. Chem. Engg. 28, 1409–1429.
Uncertainty, Decomposition and Feedback in Batch Production Scheduling
61
Gröwe-Kuska, N., W. Römisch, and T.M. Ortuno. (2005). Stochastic unit commitment in hydrothermal power production planning. In S. W. Wallace and W. T. Ziemba (Eds.), Applications of stochastic programming. MPS-SIAM Series in Optimization). Philadelphia, SIAM, 633-653. Guillen, G., F. D. Mele, A. Espuna, and L. Puigjaner (2006). Adressing the design of chemical supply chains under demand uncertainty. Proc. 2006 ESCAPE/PSE, Elsevier, 1095-1100. Gupta, A., and C.D. Maranas (2003). Managing demand uncertainty in supply chain planning. Comp. Chem. Engg. 27, 1219-1227. Harjunkoski, I.,. and I.E. Grossmann(2001). A decomposition approach for the scheduling of a steel plant production. Comp. Chem. Engg. 25, 1647-1660. Honkomp, S. J., L. Mockus, and G.V. Reklaitis (1997). Robust scheduling with processing time uncertainty. Comp. Chem. Engg. 21, S1055-S1060. Ierapetritou, M., and C.A. Floudas (1998). Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind. Eng. Chem. Res. 37, 4341–4359. Ierapetritou, M., E. Pistikopoulos, and C.A. Floudas (1995). Operational planning under uncertainty. Comp. Chem. Engg. 20, 1499-1516. Jaenicke, W., and R. Seeger (2008). Integration of Scheduling with ERP Systems. In: Engell, S. (Ed.): Logistics of Chemical Production Processes, Wiley-VCH, 2008, 263-277. Janak, S. L., X. Lin, and C.A. Floudas(2007). A new robust optimization approach for scheduling under uncertainty. II. Uncertainty with known probability distribution. Comp. Chem Engg. 31, 171-195. Janak, S.L., C.A. Floudas, J. Kallrath and N. Vormbrock (2006a). Production scheduling of a large-scale industrial batch plant. I. Short-term and medium-term scheduling.. Ind. Eng. Chem. Res. 45, 8234-8252. Janak, S.L., C.A. Floudas, J. Kallrath and N. Vormbrock (2006b). Production scheduling of a large-scale industrail batch plant. II. Reactive Scheduling. Ind. Eng. Chem. Res. 45, 82538269. Jia, Z., and M. G. Ierapetritou (2004). Short-term Scheduling under Uncertainty Using MILP Sensitivity Analysis. Ind. Eng. Chem. Res. 43, 3782-3791. Kallrath, J. (2002). Planning and Scheduling in the Process Industry. OR Spectrum 24, 219-250. Kanakamedala, K. B., G. V. Reklaitis , and V. Venkatasubramanian (1994). Reactive schedule modification in multipurpose batch chemical plants. Ind. Eng. Chem. Res. 33, 77–90. Kelly, J.D., and D. Zygnier (2008). Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems. Comp Chem. Engg. 32 (2008), 2684-2705. Lin, X., S.L. Janak, and C.A. Floudas(2004). A new robust optimization approach for scheduling under uncertainty: I. Bounded uncertainty. Comp. Chem. Engg. 28, 1069-1085. Mendez, C. A., and J. Cerda (2004). A MILP Framework for batch reactive scheduling with limited discrete resources. Dynamic scheduling in multiproduct batch plants. Comp. and Chem. Engg. 28, 1059-1068. Mendez, C. A., and J. Cerda (2003). Dynamic scheduling in multiproduct batch plants. Comp. Chem. Engg. 27, 1247-1259. Panek, S., S. Engell, S. Subbiah, and O. Stursberg (2008). Scheduling of multi-product batch plants based upon timed automata models. Comp. Chem. Engg. 32, 275-291. Papageorgiou, L.G., and C.C.Pantelides(2000). A hierarchical approach for campaign planning of multipurpose batch plants. Comp. Chem. Engg. 17, 27-32. Plapp, C., D. Surholt, and D. Syring (2008). Planning large supply chain scenarios with “quantbased combinatorial optimization“. In: Engell, S. (Ed.): Logistics of Chemical Production Processes, Wiley-VCH, 2008, 59-91. Puigjaner, L., and J.M. Lainez (2008). Capturing dynamics in integrated supply chain management. Comp. Chem. Engg. 32, 2582-2605. Rolandi, P.A. and J.A. Romagnoli (2005). A framework for online full optimizing control of chemical processes. Proc. ESCAPE 15, Elsevier, 1315–1320. Sand, G., and S. Engell (2004). Modelling and solving real-time scheduling problems by stochastic integer programming. Comp. and Chem. Engg. 28, 1087-1103.
62
S. Engell
Sand, G., J. Till, T. Tometzki, M. Urselmann, S. Engell, and M. Emmerich (2008). Engineered vs. Standard Evolutionary Algorithms: A Case Study in Batch Scheduling with Recourse. Comp. Chem. Engg. 32, 2706-2722. Sand, G., S. Engell, C. Schulz, and R. Schultz (2000). Approximation of an Ideal Online Scheduler for a Multiproduct Batch Plant. Comp. and Chem. Engg. 24, 361-367. Schulz, C., S. Engell, and R. Rudolf (1998). Scheduling of a multi-product polymer batch plant. Preprints FOCAPO, CACHE Publications, 75-90. Shaik, M.A., C.A. Floudas, J. Kallrath, and H.-J. Pitz (2008). Production scheduling of a largescale industrial continuous plant: Short-term and medium-term scheduling. Comp. Chem. Engg. 33, 670-686. Skogestad, S. (2000). Plantwide control: the search for the self-optimizing control structure, J. Process Control 10, 487–507. Sousa, R., N. Shah and L.G. Papageorgiou: Supply chain design and multilevel planning – An industrial case. Comp. Chem. Engg 32, 2642-2663 Srinivasan, B., D. Bonvin, E. Visser and S. Palanki (2002a). Dynamic optimization of batch processes. I. Characterization of the nominal solution. Comp. Chem. Engg. 27, 1-26. Srinivasan, B., D. Bonvin, E. Visser and S. Palanki (2002b). Dynamic optimization of batch processes. II. Role of measurements in handling uncertainty. Comp. Chem. Engg. 27, 27–44. Stefansson, H., N. Shah, and P. Jensson (2006). Multiscale Planning and Scheduling in the Secondary Pharmaceutical Industry. AIChE Journal 52, 4133-4149. Subrahmanyam, S., J.F. Pekny, and G.V. Reklaites (1996). Decomposition approaches to batch plant design and planning. Ind. Eng. Chem. Res. 35, 1866-1876. Sung, C., and C.T. Maravelias, C. T. (2006). An attainable region approach for effective production planning. Proc. 2006 ESCAPE/PSE, Elsevier, 1893-1898. Tarhan, B. and I.E. Grossmann (2008). A multistage stochastic programming approach with strategies for uncertainty reduction in the synthesis of process networks with uncertain yields. Comp. Chem. Engg 32, 766-788. Tatjewski, P. (2002). Iterative optimizing set-point control – the basic principle redesigned, Proc. 15th IFAC World Congress, Barcelona, Paper T-Th-E16-3. Till, J., G. Sand, M. Urselmann, and S. Engell (2007). A hybrid evolutionary algorithm for solving two-stage stochastic integer programs in chemical batch scheduling. Comp. Chem. Engg. 31, 630-647. Tometzki, T., and S. Engell (2009). A hybrid multiple populations evolutionary algorithm for two stage scheduling problems with disjunctive decisions. Proc. 19th European Symposium on Computer Aided Process Engineering. Toumi, A., and S. Engell (2004). Optimization-based Control of a Reactive Simulated Moving Bed Process for Glucose Isomerization. Chem. Eng. Sci. 59, 3777-3792. Van den Heever, S., and I.E. Grossmann (2003). A strategy for the integration of production planning and reactive scheduling in the optimization of a hydrogen supply chain network. Comp. Chem. Engg. 27, 1813–1839. Verderame, P.M., and C.A. Floudas (2008). Integrated Operational Planning and Medium-Term Scheduling of a Large-Scale Industrial Batch Plants. Ind. Eng. Chem. Res. 47, 4845-4860. Vin, J. P., and M. Ierapetritou (2000). A new approach for efficient rescheduling of multiproduct batch plants. Ind. Eng. Chem. Res. 39, 4228- 4283. Vin, J. P., and M. Ierapetritou (2001). Robust short-term scheduling of multiproduct batch plants under demand uncertainty. Ind. Eng. Chem. Res. 40, 4543–4554. Wilkinson, S.J., N. Shah, and C.C. Pantelides (1995). Aggregate modeling of multipurpose plant operation. Comp. Chem. Engg. 19, 583-588. Wu, D. and M. Ierapetritou (2007). Hierarchical approach for production planning and scheduling under unvertainty. Chem. Eng. Proc. 46, 1129-1140. Zentner, M.G., J.F. Pekny, G.V. Reklaites, and J.N.D. Gupta (1996). Practical considerations in using model-based optimization for the scheduling and planning of batch/semicontinuous processes. J. Proc. Control 35, 259-280.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
63
Hybrid Molecular QSAR Model for Toxicity Estimation: Application to Ionic Liquids Ángel Irabiena, Aurora Gareaa and Patricia Luisa a Universidad de Cantabria, Ingenieria Quimica y Quimica Inorgánica, Avda de los Castros s/n, Santander, 39005, Spain, E-mail:
[email protected] Abstract Ionic Liquids have been suggested as one of the main possibilities to avoid solvent losses in chemical processes, but toxicity needs to be evaluated before technical applications. A quantitative structure-activity relationship (QSAR) based on a hybrid molecular QSAR model has been applied to the modeling of the aquatic ecotoxicity (Vibrio fischeri EC50) of ionic liquids. In this work, the ionic liquids database has a number of 96 data, which has been improved using data from the literature and experimental data following the UNE EN ISO 11348–3 procedure; these data involve nine different cations and seventeen anions, thus, 9x17=153 different combinations can be considered. The range of ecotoxicity covered by the novel QSAR corresponds to: Log EC50 values from –0.23 to 5.00. The modeling has been performed using mechanistic and stochastic considerations, hybrid model. The influence of the anion, cation and substitutions in the ecotoxicity has been estimated to design ionic liquids with lower toxicity, giving the pTS and N(CF3)2 anions and the imidazolium cation the lowest aquatic toxicity (statistically shown). Keywords: Solvents, Green Technology, Molecular Design
1. Introduction The interest in ionic liquids has increased widely in the last years in order to achieve better environmental management of processes and products. Some interesting properties of these compounds, such as their negligible vapour pressure, high thermal stability and attractive properties as solvents, justify paying attention to them. However, it is also important to study the risks associated to their use [1]. Many ionic liquids are soluble in water and toxicity of some ionic liquids has been measured in different aquatic organisms [2-4]: bioluminescent bacteria (e.g. Vibrio fischeri), green alga, cladoceran (e.g. Daphnia magna), fish (e.g. Danio rerio), etc., showing a broad range of toxicity. Because of the large number of ionic liquids, it is necessary to develop estimation procedures in order to estimate the toxicity of specific ionic liquids without measuring it, reducing the material- and time-consumption. Quantitative structure–activity correlations, referred to as QSARs, are models that can be used to estimate the physicochemical and biological properties of molecules from the molecular structure or properties of similar compounds whose activities have already been assessed. In a previous work [4], a novel QSAR was developed in order to estimate the EC50 (Vibrio fischeri) for imidazolium, pyridinium and pyrrolidinium based ionic liquids. In this work, new ionic liquids have been studied to obtain a broader database and model to be used to estimate ionic liquids EC50 (Vibrio fischeri).
64
Á. Irabien et al.
2. Ionic liquids database The studied ILs were based on the cations and anions shown in Figure 1. The database used to develop the QSAR is constituted of a set of log EC50 values (logarithm of 15- or 30-min toxicity to Vibrio fischeri), obtained from experiments and from the literature [3-6]. Experimental data were obtained for some ionic liquids [4,7] by means of the 15min standard bioluminescence inhibition assay according to the UNE EN ISO 11348-3 procedure. Toxicity testing is based on the bioluminescent bacterium Vibrio fischeri using the Microtox Model 500 toxicity analyzer. Those ionic liquids were synthesised as it was shown elsewhere [8].
3. Model development According to group contribution methods, properties of a molecule can be assumed to be the summation of the contributions of its atoms and/or fragments. These methods allow taking into account mechanistic and stochastic considerations, leading to a hybrid model. In this work, the structure of ionic liquids has been based on three main molecular descriptors: anions (Ai), cations (Cj) and substitutions (Sk); these variables have a nonzero value when the group is present in the molecule. A detailed description of the molecular descriptors can be found in Table 1. Some extra descriptors have been included in order to take into account the specific behaviour of some cation-anion combinations to the ecotoxicity; ai, cj, and sk, are the contribution of each group to the toxicity, and the summation is taken over all groups. Subscripts indicate anions (i), cations (j), and substitutions (k). Descriptors with similar contribution have been grouped.
Figure 1. Cations and anions which perform the studied ionic liquids
Hybrid Molecular QSAR Model for Toxicity Estimation: Application to Ionic Liquids
65
The dimensionless ecotoxicity, Y*, between 0 and 1, can be estimated by the novel QSAR as the summation of the contributions of each group:
Y * = ¦ a i ⋅ Ai + ¦ c j ⋅ C j + ¦ s k ⋅ S k i
Y* =
j
(1)
k
log EC 50 _ max − log EC 50 log EC 50 _ max − log EC 50 _ min
(2)
where logEC50_max and logEC50_min are the maximum and minimum values of logEC50 in the database showing the application range of the model, being 5.00 and -0.23, respectively. Table 1. Molecular descriptors of the novel QSAR
Influence of anions (Ai). Value=1 if it exists and 0 if not
Influence of cations (Cj). Value=1 if it exists and 0 if not
Influence of substitutions (Sk).
A1: Cl, BF4, N(CN)2, MetSO4, EtSO4, Br A2: PF6 A3: Cap A4: Ace, For, TfO, 8OSO3, (2-OPhO)2B, N(CF3SO2)2, TFA A5: pTS, N(CF3)2 C1: imidazolium (C<14) C2: imidazolium (C=14) C3: imidazolium (C=16) C4: imidazolium (C=18) C5: specific contribution of imidazolium with N(CF3SO2)2 and specific contribution of butylimidazolium with TFA, Ace, TfO, Cap and For C6: pyridinium C7: Pyrrol, Morp, Piper C8: (dimethylamino)pyridinium, TMG C9: specific contribution of TMG with TFA C10: Melanime C11: Choline S1= C/Cmax (C=number of carbons in R chain; Cmax=18) S2: number of carbons in R1 chain S3: number of short chains (0, 1, 2)
4. Results and discussion The data set has been fitted to the QSAR model by multilinear regression analysis using Polymath 5.0 software, and a good fitting has been achieved, with n=96, r2=0.928, r2adj=0.912, rmsd=0.0062 and variance=0.0046. A comparison between the observed data for the dimensionless ecotoxicity (Y*) of ionic liquids and the prediction based on the novel QSAR has been performed. Figure 2 shows the parity plot. In addition, the distribution of the residuals, defined as the differences (absolute values) between the experimental and estimated Y*, is given in Table 2. 87% of the residuals are lower than 0.1, which shows a good fitting of the model.
66
Á. Irabien et al.
The novel QSAR allows establishing an order in the ecotoxicity, considering the contributions of the anions, cations and substitutions. Figure 3 shows a schematic way to infer the least and most toxic ionic liquids. For example, if an ionic liquid with low ecotoxicity (Vibrio fischeri) is desirable, an useful combination would be an imidazolium based ionic liquid with a short hydrocarbon chain and with the anion pTS or N(CF3)2 (statistically shown). Table 2. Distribution of residuals (absolute values), differences between the observed and calculated dimensionless toxicity.
Range < 0.1 [0.1, 0.15] > 0.15 < 0.2
Nº data 87 6 3 All (96)
% 91 6 3 100
1.2 1
Estimated Y*
0.8 0.6 0.4 0.2 0 -0.2 -0.2
0
0.2
0.4
0.6
0.8
1
1.2
Experimental Y*
Figure 2. Parity plot.
Figure 3. Ecotoxicity order for anions, cations and substitutions.
Hybrid Molecular QSAR Model for Toxicity Estimation: Application to Ionic Liquids
67
There are also specific contributions to take into account, which are produced when a specific anion and cation are put together. About 22% decrease is expected in the toxicity for C5 combinations (see Table 1) and about 58% increase is expected for TMG-TFA combination. In addition, a decrease of about 19%, 46% and 89% in toxicity is produced when the long chain in imidazolium-based ILs has 14, 16 and 18 carbon atoms, respectively. Further work will be focused on the development of new QSARs based on computational chemistry using the state of the art of quantum chemical properties. 5. Conclusions A novel QSAR performed in a previous work and based on a group contribution method has been improved with more kinds of ionic liquids and a broader range of ecotoxicity. This method allows establishing an order of anions and cations based on their contributions to the ecotoxicity in order to be able to design ionic liquids with low ecotoxicity (Vibrio fischeri). The pTS and N(CF3)2 anions and the imidazolium cation showed the lowest toxic effect (statistically shown). Specific behaviour for some combinations cation-anion have been also obtained and a lower toxicity is observed for imidazolium-based ionic liquids with more than 14 carbon atoms in the long chain (R)
6. Acknowledgements This research was funded by the Spanish Ministry of Science and Technology (Project CONSOLIDER CTM2006-00317).
References [1] B. Jastorff, R. Störmann, J. Ranke, K. Mölter, F. Stock, B. Oberheitmann, W. Hoffmann, J. Hoffmann, M. Nuchter, B. Ondruschka, J. Filser. Green Chem. 5 (2003) 136. [2] R.J. Bernot, M.A. Brueseke, M.A. Evans-White, G.A. Lamberti. Environ. Toxicol. and Chem. 24 (2005) 87. [3] J. Ranke, K. Mölter, F. Stock, U. Bottin-Weber, J. Poczobutt, J. Hoffmann, B. Ondruschka, J. Filser, B. Jastorff. Ecotoxicol. Environ. Saf. 58 (2004) 396. [4] P. Luis, I. Ortiz, R. Aldaco, A. Irabien. Ecotoxicol. Environ. Saf. 67 (2007) 423. [5] K.M. Docherty and C.F. Kulpa Jr. Green Chem. 7 (2005) 185. [6] M.T. García, N. Gathergood, P.J. Scammells. Green Chem., 7 (2005) 9. [7] P. Luis, A. Garea, A. Irabien. Proceeding of the EUCHEM 2008 Conference (2008). [8] P. Luis, C.A.M. Afonso, I.M. Coelhoso, J. Crespo, A. Irabien, Proceeding of the 23rd European Symposium on Applied Thermodynamics (2008). ISBN: 2-905267-59-3.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
Prediction of Phase Equilibrium Related Properties by Correlations Based on Similarity of Molecular Structures Neima Brauner a, Mordechai Shacham b+, Roumiana P. Stateva c, and Georgi St. Cholakov d a
Tel-Aviv University, Faculty of Engineering, Tel-Aviv 69978, Israel, e-mail: brauner@ eng.tau.ac.il b Ben-Gurion University of The Negev, Chemical Engineering, P. O. Box 653, BeerSheva 84105 Israel, e:mail:
[email protected] c Bulgarian Academy of Sciences, Institute of Chemical Engineering, Sofia 1113 d
Bulgaria, e-mail:
[email protected] University of Chemical Technol. and Metallurgy, Department Organic Synthesis and Fuels, Sofia 1756, Bulgaria, e-mail:
[email protected]
Abstract We have recently developed several new methods for property prediction to complement the traditional group contribution techniques, asymptotic behavior correlations and Quantitative Structure-Property Relationships (QSPR). These methods include the Quantitative Structure-Structure Property Relationship (QS2PR), the shortcut QS2PR method (SC-QS2PR) and the targeted QSPR method (TQSPR). The main effort has been directed so-far to prediction of constant, pure component properties, while very few attempts of predicting phase equilibrium related properties are documented in the literature. In this paper we report on the use of the QS2PR and SC-QS2PR methods for predicting binary interaction parameters for the Peng-Robinson equation of state, and vapor pressures at various temperatures.
Keywords: Property prediction, Phase equilibria, Molecular structure, QSPR. 1. Introduction. Phase equilibria calculations are of key importance for process and product design. In many cases the required data for these calculations are not available and have to be estimated. Up-to now most published methods, that relate molecular structure and properties have been devoted to constant properties of pure compounds, which are
69
N. Brauner et al.
70
necessary but not sufficient for phase equilibria calculations of mixtures at different parameters of state [1]. We have recently developed several new methods for property prediction based on Quantitative Structure-Structure Property Relationship (QS2PR) [2]. These include the short-cut QS2PR method for homologous series [3] and the targeted QSPR method (TQSPR) [4]. With various examples we have demonstrated that they can predict constant properties of pure compounds with high reliability. Hereunder, we present results on the application of our methods for prediction of temperature-dependent properties, and of binary interaction coefficients needed for phase equilibria calculations for mixtures.
2. Prediction of Pure Compound Vapor (Saturation) Pressures with QS2PRs. Vapor (or saturation) pressures of pure components are essential in phase equilibrium calculations for non-ideal systems, for which the vapor-liquid equilibrium ratio K (K-value) for the i -th component, applying the J M model, is given by:
Ki
J iL f 0 iL Ii
(1)
V
where J iL and f iLo denote the activity coefficient and the standard-state fugacity of the i -th component in the liquid phase and IiV is the fugacity coefficients of the i -th component in the vapor phase. A value for the pure component saturation pressure Pi s is required to calculate f iLo of a pure liquid at a specified temperature and pressure. For ideal systems at low pressures Eq. (1) is reduced to: K i Pi s / P , (2) where P is the total pressure. Hence, for ideal systems the prediction of Pi s is sufficient for phase equilibrium calculations. Several correlations for prediction of vapor pressure are available in the literature (Miller, Riedel, etc.). Most of those correlations require the normal boiling temperature (Tb), the critical temperature (Tc) and pressure (Pc) of the target compound [1]. The prediction of these properties, using either the QS2PR or shortcut QS2PR techniques is straightforward. Pure component vapor pressures are usually available as a function of temperature in an equation of the general form f ( Pi s , T ) 0 . The most commonly used equations (Antoine, Riedel and Wagner) are explicit in Pi s , but the Antoine equation can also be brought into a form that can be explicitly solved for the temperature.
Prediction of Phase Equilibrium Related Properties by Correlations Based on Similarity of Molecular Structures
71
We have applied the property-property correlation to directly predict the parameters of a particular (say, Antoine) vapor pressure equation of a target compound, when the same parameters are available for the predictive compounds, identified by the QS2PR technique and have found that in general, these parameters do satisfy the property-property correlation. However, this approach has several practical limitations. Firstly, the parameters for the same type of equation must be available for all the predictive compounds and for the same pressure range. Secondly, as these parameters have been obtained by nonlinear regression of data (in case of the Antoine equation), or in some cases ill-conditioned linear regression (Riedel's equation with non-normalized temperatures), the parameters for the target so-obtained may result in deterioration of the vapor pressure predictions. Consequently, a more robust approach was developed. Our approach uses the QS2PR method for predicting the saturation temperature at a specified pressure and it is based on the QS2PR methods proven ability for high precision prediction of the normal boiling point. Accordingly, the temperature Tt at which the vapor pressure of the target compound is Pt should satisfy the property-property correlation (Eq. 3) when the temperatures corresponding to vapor pressure Pt of the predictive compounds (Tp1, Tp2, … Tpm, Tt) are substituted on its r.h.s. Thus, the following set of equations is used:
Tt
E1Tp1 E 2Tp2 E mTpm; f (Pt ,Tp1 ) 0; f (Pt ,Tp2 ) 0; ; f (Pt ,Tpm ) 0
(3)
This is a set of m+1 equations with m+1 unknowns (Tp1, Tp2, … Tpm, Tt), which can be solved by simple substitution if, for example, the Antoine equation is used for representing the vapor pressure curve. If more complex equations (such as the Wagner or Riedel equations) are used, numerical solution of the simultaneous equations is required. Table 1 shows the predicted saturation temperatures of n-hexadecane as a target using the proposed modification of the QS2PR technique. For the predictive compounds n-pentadecane and n–heptadecane the coefficients of the structure-structure correlation obtained by the SROV program are E1 = 0.50848 and E2 = 0.49232. The Antoine equation is used to calculate the saturation temperature of the target n-hexadecane at the chosen pressure P (bar):
Ti s
Bi Ci Ai log( P )
(4)
where Ti s is the saturation temperature (K) , and Ai, Bi and Ci are the Antoine equation parameters of component i.
N. Brauner et al.
72
Table 1. Prediction of saturation temperatures of n-hexadecane Compound1
n-C15 n-C17 n-C16, target n-C16, target Rel. error, %
Coeff. for the S-S correlation 0.50848 0.49232 Calc.3 Pred.
Antoine Equation Parameters2 A B 4.1494 1789.66 3.927 1718.00 4.1731 1845.67
C -111.86 -138.13 -117.05
Saturation Temp. (K) for Pressure (bar) 0.5 0.7 0.9 514.0 527.6 538.5 544.4 559.0 570.5 529.6 543.5 554.5 529.4 543.5 554.7 0.034 0.001 0.028
1
Short notation is used, i.e. n-C15 is n-pentadecane. Reference: NIST chemical data-base. 3 Calculated using n-hexadecane's Antoine equation parameters 2
For the target compound, Ti s is calculated using both the Antoine equation (calculated) and by the property-property correlation (Tt, predicted). Table 2 illustrates the new technique when experimental data for particular pressures are available. Table 2. Prediction of saturation temperatures for butylcyclopentane1 Coefficients Saturation Temp. (K) for Pressure (bar) for the S-S 0.08 0.333 0.8 1.01 correlation methylcyclopentane -0.78156 280.37 312.73 337.48 344.86 ethylcyclopentane 0.65727 306.65 341.73 368.52 376.50 propylcyclopentane 1.1184 330.07 367.20 395.54 403.98 352.15 390.85 420.72 429.75 butylcyclopentane, target Measured.2 butylcyclopentane, target Predicted. 351.57 390.88 420.83 429.74 Relative error, % 0.165 0.007 0.027 0.001 1 Antoine equation coefficients were taken from the NIST chemical data-base. 2 API Research Project 44; TRC, Texas A&M University, College Station, Texas, 1980 Compound
For alkyl-cyclopentanes, Antoine equation parameters are provided in the NIST data-base only for the first three members of the homologous series. Thus, the structure-structure correlation for predicting the properties of butylcyclopentane has to be constructed with methyl-, ethyl- and propyl-cyclopentane as predictive compounds. Still the experimental data for the pressure–temperature relationship are predicted with high precision.
Prediction of Phase Equilibrium Related Properties by Correlations Based on Similarity of Molecular Structures
73
3. Prediction of Binary Interaction Parameters for Equation of State Models. If the equilibrium liquid and vapour phases are both modelled by an equation of state (EoS), then the K-value is expressed as [1]:
Ki
I iL / I iV
(5)
To calculate the fugacity coefficients of the components in the liquid (IiL) and vapor (IiV ) phases usually either the Soave-Redlich-Kwong or Peng-Robinson EoS with mixing rules (e.g. one-fluid van der Waals mixing rule) are employed. In the EoS, the properties of the pure compounds required are the critical temperature (Tc) and pressure (Pc), and the acentric factor (Ȧ). The prediction of these properties by applying the QS2PR or the shortcut QS2PR techniques is straightforward. However, the mixing rules require binary interaction parameters. The binary interaction parameters can be predicted with QS2PR with the modifications illustrated below. The application of EoS to mixtures requires the use of mixing rules for the mixture energy parameter a mix , which accounts for interactions between the species in the mixture, and for the co-volume parameter bmix , which accounts for the excluded volume of the species of the mixture:
a mix
¦¦ x x a i
i
j ij
;
j
bmix
¦xb
i ii
(6)
i
The cross coefficient aij is related to the corresponding pure-component parameters by the following combining rule:
aij
a a 1 k 0.5
ii
jj
ij
(6a)
In order to predict the binary interaction parameter kij for two compounds (i and j), one of the compounds (say i), for which binary parameters with several predictive compounds (j) are available, is selected as a reference compound. The binary interaction parameters of the predictive compounds are then introduced into the property - property correlation (Eq. 3) to obtain the corresponding interaction parameter for the target compound. In Table 3 this method is demonstrated for calculating binary interaction parameters for the Peng-Robinson EoS. The prediction errors obtained are consistent with the experimental error associated with this kind of data.
N. Brauner et al.
74
Table 3. Prediction of binary interaction parameters for the P-R EoS1,2 Compound Coefficient kij1 Compound ethane Reference ethane n-C4 0.39331 k24 = 0.00464 n-C7 n-C7 1.4425 k27 = 0.01576 n-C5 n-C8e -0.83652 k28 =0.01972 n-C7 n-C4 n-C5 data k25=0.00811 target target n-C5 pred. k25 =0.00806 n-C4 target target Error, % 0.67 1 From the UNISIM process simulation program 2 Short notation is used, i.e. n-C4 is n-butane.
Coefficient Reference 0.29047 0.89464 -0.18909 data
kij* k23 =0.00185 k25 =0.00811 k27 =0.01576 k24 =0.00464
Target, pred.
k24 =0.00482 3.76
4. Conclusions and Future work We have demonstrated above the potential of our new TQSPR methods to predict temperature – dependent properties and interaction parameters for phase equilibria calculations. Our present results (not included because of lack of space) confirm that our methods can be applied for predicting binary interaction parameters for other equation of state (e.g., Soave-Redlich-Kwong) and activity coefficients for non-ideal binary systems. From a methodology point of view, we intend to test also our latest variation of the TQSPR method for members of homologous series [5], which develops linear equations with single descriptors, collinear with the studied property, and maybe applied even when experimental data for even only members of a series are available. Since, data for a few homologues can be found for many compounds, we believe this method has significant potential for various molecules and their mixtures. 5. References [1]. Poling, B.E., Prausnitz, J. M., O’Connel, J. P., Properties of Gases and Liquids, 5th Ed., McGrawHill, New York., 2001. [2]. Shacham, M., Brauner, N., Cholakov, G.St. and Stateva R.P., Property Prediction by Correlations Based on Similarity of Molecular Structures, AIChE J. 50 (2004) 2481-2492. [3]. Cholakov, G.St., Stateva, R.P., Shacham M. and Brauner, N., Identifying Equations that Represent Properties in Homologous Series using Structure-Structure Relations, AIChE J. 53 (2007) 150-159. [4]. Brauner, N., Stateva, R.P., Cholakov, G.St. and Shacham, M., Structurally “Targeted” Quantitative Structure-Property Relationship Method for Property Prediction, Ind. Eng. Chem. Res. 45 (2006 ) 8430-8437. [5]. Cholakov, G.St., Stateva, R.P., Shacham M. and Brauner, N., Estimation of Properties of Homologous Series with Targeted Quantitative Structure−Property Relationships. JCED, 53 (2008) 2510–2520.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
75
Systematic selection of extraction solvents in the aromatics production Dina M.J. Machadoa, Filipe J.M. Nevesb, Fernando P. Mendesb, Paulo P. Araújob, Belmiro P.M. Duartec, Nuno M.C. Oliveiraa a
University of Coimbra, GEPSI-PSE Group, CIEPQPF, Dep. Chemical Engineering, R. Sílvio Lima - Pólo II, 3030-790 Coimbra, Portugal,
[email protected] b CUF - Químicos Industriais, S.A., Process Development Dep., Quinta da Indústria, 3860-680 Estarreja, Portugal, c Polytechnic Institute of Coimbra, Chemical and Biological Engineering, R. Pedro Nunes, 3030-190 Coimbra, Portugal,
[email protected]
Abstract This paper presents a general approach for the design/selection of single molecular structures with prescribed functionality, based on mathematical programming techniques. The strategy relies on an efficient decomposition of the design problem into two levels, relative to the identification of structurally feasible candidate molecules that satisfy the property constraints, and their ranking regarding a set of performance objectives that include both operational and safety aspects. Group contribution methods and correlations are employed to model a significant fraction of the physical properties used in the problem formulation. The approach introduced is demonstrated by application to an example commonly found in aromatics industry – the design of extraction agents to promote L/L separations.
Keywords: Product design, Mathematical Programming, Group Contribution methods, LL extraction
1. Introduction and motivation This work starts with the axiomatic assumption that a large class of molecular design/selection problems is significantly complex, and can only be partially described by a set of mathematical constraints and objectives. Therefore, the candidate solutions for these problems need to start by satisfying the constraints identified, while simultaneously constituting extreme points of the objectives, or their combinations (in the broader sense). The diversity of the nature of the criteria usually associated with these problems (e.g., performance, safety, environmental, availability, price, chemical and physical interactions with additional existing species, etc.) difficult their realistic formulation as single-objective optimization problems, thus requiring the use of multiobjective optimization techniques, for their meaningful and efficient solution. Additionally, the constraints and objectives not explicitly included in the mathematical formulation of the problem need also to be considered, at least sequentially, in a second phase of the analysis. This implies that the solution of the above mathematical problem should not produce only a unique solution, but instead a set of candidates, together with their ranking according to the individual decision criteria considered, to be further evaluated and compared by the decision maker. Conceptually, this phase falls into the
D.M.J. Machado et al.
76
classic designation of multiattribute decision making (MADM), since the basic goal is to rank feasible alternatives relatively to a set of performance indicators [1].
2. Methodology A molecular design problem can be described by structural constraints g e (n, u , y ) ≤ 0 , property constraints g p (n, u ) ≤ 0 , and operational constraints g o (n, u, x, y ) ≤ 0 and
ho (n, u, x, y ) = 0 , where n represents a set of integer variables, u , y are binary variables, and x are continuous variables A more complete characterization of each category of constraints can be found, e.g., in [2]. Note that g e (.) and g p (.) normally only involve discrete variables. Also, g e (.) corresponds usually to a set of linear constraints, while g p (.) are often posed as bound constraints of nonlinear functions of the discrete variables, g lp ≤ g p (n, u ) ≤ g up . A set of objective indices Φ = {ϕi (n, u , x, y )} is also considered. Frequently, Φ can be partitioned into class subsets, e.g., Φ = Φ p Φ s , where Φ p denotes the subset of objectives related to the performance of the product, and Φ s represents the subset of objectives related to its safety characteristics. The individual indices ϕi (.) are assumed to be general nonlinear functions, although not necessarily continuously differentiable inside the entire problem domain. These characteristics lead naturally to overall MINLP formulations of the design/selection problem. In order to avoid some of the difficulties and effort associated with their numerical solution, various approaches have been proposed, e.g., the use of global optimization algorithms [3], or decomposition approaches [2]. Here, we consider a sequential approach, structured similarly to [2], in order to significantly reduce the total solution effort required. The methodology includes two major solution levels: 1. The generation of feasible molecular structures that satisfy the property constraints posed as bounds (problem P1). 2. The solution of the optimization problems over the feasible points generated during the solution of P1, or implicitly represented by a set of constraints originating from P1 (problem P2). It is important to note that the solution of problem P1 requires only the enumeration of integer solutions inside a convex domain delimited by linear constraints; therefore, it can efficiently and reliably be obtained with existing MILP solvers. Alternatively, the corresponding constraints can be added directly to P2, without significantly altering the complexity of the solution of this last problem. This corresponds to the generation of feasible points of P1 as required, during the progress of the solution of P2. Therefore, the two solution phases can be applied separately (e.g., when interactively exploring the solution space, or in small/medium size problems), or simultaneously, when solving the complete design problem at once. Various authors have previously considered the mathematical representation of feasible molecular structures [3-5]. Using similar concepts, a possible formulation for problem P1 is:
min n,u , y
¦n v
k k
k ∈K
(1)
Systematic Selection of Extraction Solvents in the Aromatics Production
s.t.
nk =
¦u
m, k
, ∀k ; m s =
m∈M
¦u
¦u
m, k
k ∈K
k ∈K
; m s ≥ 2 + yc ;
y A + yc = 1
≥ ¦ um +1, k , ∀m ∈ M \ {card( M )}
k
k
A
;
k ∈K
j∈J
(3)
¦n
k'
≥ nk (vk − 1) + 2, ∀k
(4)
k '∈K
ªvk ( N G + 1) + N G − pk + 1º ≥ ¦ um +1, k ª vk ( N G + 1) + N G − pk + 1º, ¬ ¼ k ∈K ¬ ¼
m, k
k ∈K
(2)
k ∈K
¦ n (2 − v ) = 2 y
nk = ¦ ykN, j 2 j −1 , ∀k ;
¦u
k
k ∈K
≤ 1, ∀m ;
m, k
¦n
77
(5)
∀m ∈ M \ {card( M )}
¦¦c
k , j,s
j∈J k ∈K
ykN, j − ¦ ¦ (1 − ck , j , s ) ykN, j ≤ ¦ ¦ ck , j , s − 1, ∀s j∈J k ∈K
(6)
j∈ J k ∈ K
g p ( n, u ) ≤ 0
(7)
Note that the objective is only required when solving P1 individually; the solutions are produced in this case as a canonical enumeration of the feasible set, starting from the lower complexity extreme. Here Eq. (2) relates the positional variables in the molecule with the group count, and the molecular size, together with the type of molecule desired (cyclic/acyclic). Eqs. (3) describe the assignment constraints of each functional group at each molecular position, leaving the empty slots at the end. Eqs. (4) include Machietto and Odele valence constraints [6], and the binary decomposition of each group count. Eq. (5) assigns the groups with higher valences to the first molecular positions, and sorts them according to the group of periodic table of the first atom in the group, to originate a canonical molecular representation. Eqs. (6) represent integer cuts, which are added to the formulation after each solution is found, to eliminate them from the feasible set. Their coefficients are determined as ck , j , s = yk , j , s −1 , where yk , j , s −1 is the previously found solution. Table 1 list the nomenclature used in problem formulation. A crucial difference of this methodology with respect to the one described in [2] is the inclusion in P1 of both structural and physical property constraints resulting from linear (or linearized) structure-property relations. This is advantageous, since in these problems a large subset of the physical properties is estimated using group-contributions (GC) methods, with a linear combinatorial part. This approach reduces drastically the number of candidate structures considered, while retaining the simplicity of the enumeration of a convex linearly delimited solution space.
Table 1. Nomenclature.
M ≡ {m :1, , M max } K ≡ {k :1, , K max } J ≡ { j :1, , J max }
S ≡ {s :1, , S max }
- set of molecular positions - set of functional groups - set of bits used to count the functional groups - set of integer cuts generated
D.M.J. Machado et al.
78
vk yA
- valence of group k - assignment of the molecule to acyclic set
yC
- assignment of the molecule to cyclic set
y
N k, j
- assignment of bit j representing group k
pk N ms um , k
- group of the periodic table for the first atom of k - number of groups of the periodic table - size of the molecule - assignment of group k to molecule m
ukmax
- maximum number of groups k allowed in the molecules
nk
- number of groups k assigned - coefficients of the integer cuts
G
cm , k , s
During the solution of P2, a set of feasible molecular configurations are evaluated with respect to the criteria contained in Φ . Due to the diverse nature of the criteria that need to be considered, the following transformations facilitate this task: 1. First, the individual criteria are grouped into classes, e.g., Φ = Φ p Φ s (as
2.
described previously). The objectives in each class are later combined, producing a cumulative objective index, representative of the entire class. Using the above division, we denote as PIO and SIO the performance index and safety index objectives, respectively, as the combined measure of each candidate molecule relative to the criteria contained in each class. The combination of decision criteria in each class becomes easier if they possess similar scales and orders of variation. To achieve this, the decision maker is required to provide a set of normalizing functions f N ,i (.) for each objective index
ϕi (.) , expressing her/his expectations relative to the scales of variation found in the feasible solutions. These concepts allow the generation of two combined objective indices:
PIO = ¦ wip f Np ,i (ϕi , p (.)) i
¦w
(8)
¦w
(9)
ip
i
and
SIO = ¦ wis f Ns ,i (ϕi , s (.)) i
is
i
where wip and wis are weighting factors specified by the decision maker. This structure can be then be handled more easily with existing multiobjective optimization programming (MOP) algorithms, such as the weighting [7], the constraint method [8], or multiattribute decision methodologies [1]. Grouping the original criteria into distinct combined objectives indices is also possible.
Systematic Selection of Extraction Solvents in the Aromatics Production
79
3. Application example An application example for the selection of a separation agent in the L/L extraction of aniline (ANL), produced by the liquid phase hydrogenation of mono-nitrobenzenze (MNB), was considered. It comprises a fresh feed stream mainly composed by aniline, water, and low fractions of cyclohexylamine (CHA) and cyclohexanol (CHOL). This stream is mixed with the solvent before entering the L/L separator, where two phases are obtained: i. an aqueous phase (above 95% w/w water); ii. an organic phase (with a water content below 5% w/w). The aqueous stream is routed to an effluent treatment plant, and the organic stream is sent to a distillation column where the solvent is recovered as a top product and recycled back to the separator after cooling. Often, the solvent chosen to promote L/L extraction is a substance already present in the process, such as MNB or benzene (BZ). However, various problems are usually associated to these simple choices (e.g., operational, or environmental factors). The systematic choice of a separation agent should verify the following constraints: i. Reduced health impact, good availability, and affordable price; ii. Low (or high) density when compared to aniline, in order to accelerate the separation operation; iii. Nearly insoluble in water; otherwise, the solvent losses in the aqueous stream will be high, thus leading to important economic and environmental drawbacks; iv. It must break the azeotrope formed by water and ciclohexylamine (CHA), since their separation by distillation would be quite inefficient, hindering the commercialization of this product, that requires tight purity specifications; v. It must have a boiling point temperature lower than that of CHA, but sufficiently high to avoid problems in the top condenser. Results The previous methodology was tested to evaluate the relative performance of simple linear hydrocarbons relative of mono- and di-amines. For this purpose, the groups CH3, CH2, CH, C, CNH2, CHNH2, CH2NH2, CH3NH, CH2NH, CHNH, CH3N, and CH2N were considered as candidate blocks in the molecular structure of the agent. Using the previous specifications, a total of 77 different molecular structures were identified, as the solution of P1. These results were obtained using GAMS/CPLEX, requiring a total of 31 seconds of CPU time in a standard Intel Core 2 Quad PC. This amount of time can be significantly reduced, if the order by which the solutions are obtained is not relevant. The PIO index for each alternative was calculated using individual criteria that included the volatility of the agent, its vaporization enthalpy, liquid density and water solubility. The combined SIO index was calculated using its octanol-water partition coefficient, which has been correlated to a number of health and environmental factors, such as the lethal concentration ( LC50 ) and bioconcentration factor (BCF), and the flash temperature of the agent. Figure 1 presents the combined performance of the candidate molecules regarding both indices. From these results, and considering the set of weights used, it is visible that the di-amines provide better solutions, followed by the mono-amine group, and later by the simple hydrocarbons. Afterwards, these results can be generalized by considering additional families of functional groups, and assessing additional characteristics of the molecules identified.
D.M.J. Machado et al.
80 Ϯ
^/K
ϭ͘ϱ
ϭ
Ϭ͘ϱ D
,
Ϭ Ϭ
Ϭ͘ϱ
W/K
ϭ
ϭ͘ϱ
Figure 1 – Performance of candidate molecules regarding PIO/SIO indices (MA – mono-amines; DA – di-amines; HC – saturated hydrocarbons); lower values indicate better solutions.
4. Conclusion and future work A methodology for the efficient molecular structure design/selection of single molecules was presented. Although it shares some common elements with previously proposed approaches, two important aspects (the generation of feasible solutions, and the application of a MDO framework) were introduced to facilitate its realistic application. An application example was presented, where the results produced were able to provide important guidelines for the user, in the task of designing/selecting chemical compounds with prescribed functionality.
References [1] P. Sen, J.B. Yang, Multiple Criteria Decision Support in Engineering Design, Springer Verlag (1998). [2] A.T. Kurananithi, L.E.K. Achenie, R. Gani, Ind. Eng. Chem. Res., 44 (2005) 47854797. [3] N.V. Sahinidis, M. Tawarmalani, M. Yu, AIChE J., 49 (2003) 1761-1775. [4] N. Churi, L.E.K. Achenie, Ind. Eng. Chem. Res., 35 (1996) 3788-3794. [5] V.S. Raman, C.D. Maranas, Computers Chem. Eng., 22 (1998) 747-763. [6] S. Machietto, O. Odele, O. Omatsome, Trans. Inst. Chem. Eng., 68 (1990) 429-433. [7] A.I. Papadopoulos, P. Linke, AIChE J. 52 (2005) 1057-1070. [8] U. Diwekar, Introduction to Applied Optimization, Kluwer Academic Publishers (2003).
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
81
Towards Nanomaterial Design Automation: Hierarchical Computational Architecture Development Jie Xiao, Yinlun Huang Department of Chemical Engineering and Materials Science, Wayne State University, Detroit, MI 48202, USA, E-mail:
[email protected]
Abstract Molecular modeling and simulation has been recognized as an effective tool for gaining a comprehensive and insightful understanding of nanomaterial structure-property relationships, which are critical for nanomaterial development. Note that nanomaterial development is a very complicated task involving the design and management of massive runs of simulations and numerous types of subtasks in multiple computational stages. Thus, an effective and efficient nanomaterial development must rely on the appropriate design of a computational architecture as well. In this work, we introduce a generic task-distributed hierarchical computational architecture for nanomaterial design, which can be readily constructed on a usual cluster system. The developed computational architecture, together with the algorithms for hierarchical computations, can facilitate design automation with a high computational efficiency. The efficacy of the architecture will be demonstrated through a case study on nanopaint design, where various fundamental structure-property correlations as well as design guidelines can be fully derived. Keywords: Computational architecture, nanopaint
nanomaterial
design,
hierarchical
computational
1. Introduction Development of nanomaterials has drawn great attention in recent years since this type of materials can demonstrate some superior mechanical and chemical properties and may possess some novel functionalities. It is known that nanomaterial design by experiments alone usually takes a very long development cycle due to design complexity. The existence of vast design parameters can make easily the material development an unmanageable combinatorial problem. The development could be further affected by the availability of experimental resources (Xiao et al., 2009). Molecular modeling and simulation has been recognized as an effective tool for gaining a comprehensive and insightful understanding of nanomaterial structure-property relationships, which are essential for nanomaterial development. Moreover, advanced computing methods can provide great freedom and control over the investigated material parameters and product properties through allowing virtually any number of in silico experiments (Xiao and Huang, 2009). However, computational efficiency has been a major challenge in molecular simulation based nanomaterial design, due to the existence of a huge design space that needs to be thoroughly investigated for achieving design optimality. Over the past years, many efforts have been made to develop algorithms for creating a large-scale parallel computing environment (Ogata et al.,
J. Xiao and Y. Huang
82
2001; Xiao et al., 2008). Those methods are very helpful for reducing the computational time of individual in silico experiments. However, nanomaterial development is a much more sophisticated task, involving the design and management of massive runs of simulations and numerous types of subtasks in multiple computational stages. Thus, an effective and efficient nanomaterial development should rely on the appropriate design of a computational architecture as well. In this work, we will introduce a generic task-distributed hierarchical computational architecture for nanomaterial design, which can be readily constructed on a usual cluster system. Using this architecture, a large number of well-structured computational tasks can be efficiently accomplished. Moreover, we will describe a set of molecular modeling and simulation methods for nanopaint material design. By these methods, comprehensive and quantitative correlations among nanopaint formulation, processing condition, nanocoating microstructure, property and performance can be established. A comprehensive study on the design and analysis of an acrylic-melamine-silicate nanoparticle contained nanopaint will demonstrate the methodological efficacy.
2. Hierarchical computational architecture The computational development of nanomaterials involves three major tasks: one for formulating nanomaterial and then generating a virtual sample, one for conducting the needed in silico tests for product performance evaluation, and the other for managing the entire material development task with a final recommendation on the optimal formulation. To execute these tasks effectively, a task-distributed two-layer computing architecture is developed, which is shown in Fig. 1. In this architecture, the upper layer is designed using the master node of a cluster machine, and it is used to manage the Master Node Material analysis, optimal design, task distribution and management S Compute Node 1
F
S Compute Node i
Grid A: Sample development
F
P
S
P
Compute Node i+1
S Compute Node N
Grid B: Sample testing
Legend: S: structure, F: formulation, P: property Figure 1. Task-distributed two-layer hierarchical computing system architecture.
entire material analysis and design process. In this layer, the nanomaterial formulation data (marked by “F” in the figure) are transmitted down to the lower layer to generate samples by the compute nodes (see the block marked by “Grid A” in the figure). Each node there will develop one sample in one design iteration. After they are developed, the samples with their microstructures (marked by “S” in the figure) will be transmitted to the master node in the upper layer. The collected samples will then be sent down to the “Grid B” block in the lower layer for property testing by the assigned compute nodes. The test results (marked by “P” in the figure) will be transmitted up to the master node. After that, the material formulation-product property correlation will be
Towards Nanomaterial Design Automation: Hierarchical Computational Architecture Development
83
analyzed and the most preferable formulation will be identified for that design iteration. Based on a preset design objective, an optimal material design algorithm resided in the master node will decide if the next design iteration is needed or not. If yes, then the algorithm will determine how to modify the formulation and subsequently a new iteration starts; otherwise, the identified material formulation will be considered the design solution. Note that the number of nodes in each grid of the lower layer can be readily determined based on computational needs. If multiple types of property testing are needed, the compute nodes in “Grid B” can be further divided into several sub-grids, each of which will be responsible for a specific type of property testing. This architecture, which can be readily constructed on any cluster computing system, has a potential to improve computational efficiency through a systematic task distribution according to the computational effort required by each individual task.
3. Computational methodology for nanopaint design Nanopaint is a type of thermoset nanocomposite material that contains a certain fraction of organo-modified inorganic nanoparticles in its resin. To successfully develop such a type of material, a deep understanding of the dependence of nanocoating properties on nanopaint formulation is essential. For this purpose, a set of molecular modeling and simulation methods are developed to establish comprehensive and quantitative correlations among nanopaint formulation, processing condition, nanocoating microstructure, property and performance. Note that the nanocoating scratch resistance is the only performance studied in this work. Modeling method for nanopaint A critical need for investigating nanopaint materials is to develop fundamental models, which can describe how to represent the polymer and the nanoparticles in a 3D space and how to establish the physical and chemical interactions between them. Polymer network modeling. The known coarse-grained bead-spring (CGBS) model is used to characterize the polymer network (Kremer and Grest, 1990). In the network, each effective unit (EU, either an effective monomer or a crosslinker molecule) is represented by a polymer bead, while each bond is represented by an anharmonic spring. Any pair of nonbonded polymer beads interacts via a standard Lennard-Jones (LJ) potential. For any two bonded polymer beads, the finite extension nonlinear elastic (FENE) potential needs to be added to quantify the effect of the anharmonic spring. Nanoparticle modeling. In this work, only spherical nanoparticles are investigated. Each nanoparticle is represented by a single ball. The interaction potentials between two nanoparticle balls and between one nanoparticle ball and one polymer bead are evaluated using a modified LJ potential (Vacatello, 2001). Simulation methods for nanocoating development and testing Two off-lattice Monte Carlo based simulation methods are developed: one for sample development where the correlations among the nanopaint formulation, curing condition, and nanocoating microstructure are quantified, and the other for sample testing which allows predicting the nanocoating property using its structural information. Nanocoating development. The nanocoating is developed by following a seven-step procedure, which includes those for: (i) simulation system set-up, (ii) initial configuration generation, (iii) first-stage system relaxation in an NVT ensemble, (iv) crosslinking reaction realization, (v) second-stage system relaxation in an NVT ensemble, (vi) cooling of nanocoating samples, and (vii) third-stage system relaxation in
J. Xiao and Y. Huang
84
an NPT ensemble. Through simulation, the microstructure evolution throughout the entire curing process can be predicted. The prepared nanocoating sample needs to undergo a Nanocoating testing. computational tensile test so that its stress-strain behavior can be obtained. An isothermal, uniaxial deformation process at a constant strain rate is simulated. The simulation box is stretched in the x direction through a series of strain increments until the desired maximum strain is reached. Immediately after each strain increment, the system is relaxed for a certain number of MC cycles in an N(lxτ yyτ zz)T ensemble (Yang et al., 1997). The internal stress in the sample at any moment during tensile test can be calculated according to the Virial stress theorem (Chui and Boyce, 1999). Property and performance evaluation The stress-strain behavior of a nanocoating sample can be correlated to its elastic property and further to the scratch resistance performance. The elastic property (stiffness) of a nanocoating is evaluated using Young’s modulus (E), which is quantified as the initial slope of the stress-strain curve. A qualitative correlation between Young’s modulus and the scratch resistance performance is adopted, i.e., an increment of the elastic modulus of a nanocoating is an indication of the improvement of scratch resistance (Misra et al., 2004).
4. Case study The introduced modeling and simulation methods together with the described computing architecture have been successfully employed to study a nanopaint material, which is a mixture of hydroxyl-functional acrylic copolymer, hexamethoxymethylmelamine (HMMM) crosslinker, and spherical silicate nanoparticles. A total of 18 cases are investigated in order to understand the effects of three critical material parameters, i.e., the nanoparticle-polymer interaction strength, the nanoparticle size, and the polymer number average molecular weight. To ensure a reliable prediction, each case has four independent simulation runs and a total of 72 (18×4) samples are prepared and tested. The comparisons are made based on the averaged simulation results. The computational architecture is Computational architecture implementation. implemented on a Beowulf Cluster System (10 Xeon dual processor nodes @ 2.66 GHz). The master node is used to manage and distribute computational tasks for generating and testing all the samples. Since the computational time for generating one nanocoating sample is around three times longer than that for conducting a tensile test, 1st stage 2nd stage 3rd stage Equilibration Equilibration Equilibration Curing Cooling
1.6 1.4 1.2 1
T*
τ*
1.0
0.4
y
0.75
z
2,000 2,000
0.2 0
x
2,000 1,000 5,000 MC cycle
(a)
0.8 0.6
(b)
0
0.01
0.02
ξ
0.03
0.04
(c)
Figure 2. Nanocoating development and testing results: (a) temperature setting for nanocoating formation, (b) nanocoating sample microstructure, and (c) the stress-strain curve.
0.05
Towards Nanomaterial Design Automation: Hierarchical Computational Architecture Development
85
seven compute nodes are assigned to Grid A and two compute nodes are assigned to Grid B (see Fig. 1). It turns out that the computations performed using this structure are very efficient. Base case results. A variety of correlations among material formulation, processing condition, structure, property and performance are generated. Due to the space limit, some key results for the base case only are presented here. The base case material has a reduced polymer-nanoparticle interaction strength ( İ pn* ) of 8.0, a reduced nanoparticle radius ( R n * ) of 7.0, and a reduced number average molecular weight ( M n* ) of 8.34. The nanocoating sample is cured to 80% conversion under the processing condition specified in Fig. 2(a). The nanocoating microstructure evolution can be observed throughout the entire sample development and testing processes. Figure 2(b) demonstrates a nanocoating sample microstructure that contains one nanoparticle and 9,896 polymer beads. In the figure, the green and blue beads represent the effective monomers, and the red and pink beads represent the crosslinkers. All the bonds are represented by the rods. The nanoparticle is completely covered by the polymer beads and thus cannot be visually identified. The nanocoating stress-strain behavior obtained from the tensile test simulation is given in Fig. 2(c). Note that the initial slope of the curve gives the reduced Young’s modulus (E*), which is 50.94 in this case. The *
Young’s modulus for a pure polymeric coating ( E p ) is found to be 39.67, which is 22.12% smaller than that for the nanocoating. This indicates that the nanocoating has a much better scratch resistance performance. Design guideline derivation. The effects of ε pn* , R n* , and M n* on the nanocoating scratch resistance and processing efficiency are thoroughly investigated. The results are given in Fig. 3. Note that a higher modulus means a better scratch resistance. More MC cycles in the curing simulation imply a longer curing time and thus more energy needed for curing. It is shown that to improve scratch resistance performance, the 1.4
1.4 1.5 1.3 E /Ep
1
*
1.1
1.3
deterioration
R n*
1.2
*
*
enhancement
1.4
*
*
İ pn*
E /Ep
*
E /Ep
1.2
1 0.8
0
4
8
12
1.2
16
2
3
4
5
6
7
0.9
1.4
1.1
1.4
1.2
1.05
N MCC/NpMCC
NMCC/Np MCC
1.6
N MCC/Np MCC
1.15
1.2
1
1
0.95 0
0.8
4
8
12
16
18
2
6
10
14
18
2
6
10
14
18
1
0.8
2
3
4
5
6
7
0.6
(a) (b) (c) Figure 3. Modulus and curing time dependence on (a) the polymer-nanoparticle interaction strength, (b) the nanoparticle radius, and (c) the polymer number average molecular weight.
nanomaterial should have a larger ε pn* and M n* , but a smaller R n* . However, such a type of material can lead to more energy consumption, which means a worse processing
86
J. Xiao and Y. Huang
efficiency. Consequently, material designers should be prepared to make appropriate trade-offs between product performance and processing efficiency.
5. Conclusions A critical need for computational design of nanomaterials is to develop methodologies that can effectively reveal the intrinsic relationships among material, processing, and product quality, and to construct an efficient computing system architecture within which the computational methods can be most properly implemented. In this work, a generic task-distributed hierarchical computational architecture is developed for nanomaterial design. This architecture can ensure the high efficiency in accomplishing a large number of computational tasks. Moreover, a set of molecular modeling and simulation methods are introduced for exploring the fundamental knowledge about the nanopaint material. The efficacy of the introduced methodologies has been demonstrated through the design and analysis of an acrylic-melamine-silicate nanoparticle contained nanopaint material. Undoubtedly, more studies on material structure-property correlations are needed in order to draw more comprehensive, quantitative, and reliable conclusions on nanopaint design. Aiming at design automation, an effective optimal material design algorithm is being developed for more intelligent design of in silico experiments. Needless to say, all the correlations and nanopaint design improvement strategies identified through simulations must be validated by experiments.
6. Acknowledgements This work is supported in part by NSF (CMMI 0700178) and the Institute of Manufacturing Research of Wayne State University.
References C. Chui, M.C. Boyce, 1999, Monte Carlo Modeling of Amorphous Polymer Deformation: Evolution of Stress with Strain, Macromolecules, 32, 11, 3795-3808. K. Kremer, G.S. Grest, 1990, Dynamics of Entangled Linear Polymer Melts: A Molecular Dynamics Simulaion, J. Chem. Phys., 92, 8, 5057-5086. R.D.K. Misra, R. Hadal, S.J. Duncan, 2004, Surface Damage Behavior During Scratch Deformation of Mineral Reinforced Polymer Composites, Acta Materialia, 52, 14, 4363-4376. S. Ogata, E. Lidorikis, F. Shimojo, A. Nakano, P. Vashishta, R.K. Kalia, 2001, Hybrid FiniteElement/Molecular-Dynamics/Electronic-Density-Function Approach to Materials Simulations on Parallel Computers, Computer Physics Communications, 138, 2, 143-154. M. Vacatello, 2001, Monte Carlo Simulations of Polymer Melts Filled with Solid Nanoparticles, Macromolecules, 34, 6, 1946-1952. J. Xiao, Y.L. Huang, 2009, Microstructure-Property-Quality-Correlated Paint Design: An LMCBased Approach, AIChE J., 55, 1, 132-149. J. Xiao, Y.L. Huang, C. Manke, 2009, Computational Design of Thermoset Nanocomposites: Methodological Study on Material Development and Testing, AIChE J., submitted. S.P. Xiao, J. Ni, S.W. Wang, 2008, The Bridging Domain Multiscale Method and its High Performance Computing Implementation, J. of Comput. Theor. Nanosci., 5, 7, 1220-1229. L. Yang, D.J. Srolovitz, A.F. Yee, 1997, Extended Ensemble Molecular Dynamics Method for Constant Strain Rate Uniaxial Deformation of Polymer Systems, J. Chem. Phys., 107, 11, 4396-4407.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
87
Vibrational spectra of methane hydrate by Molecular Dynamics Verónica Janeth Landín-Sandovala, Florianne Castillo-Borjaa, Ulises Iván Bravo-Sáncheza, Richart Vázquez-Románb a
Instituto Tecnológico de Aguascalientes, Av. López Mateos 1801 ote. , Aguascalientes 20256, México,
[email protected] b Instituto Tecnológico de Celaya, Av. Tecnológico y A.G. Cubas s/n, Celaya 38010, México.
Abstract The interest for the study of methane hydrates owes to the energetic potential that they possess and to the problem that they represent in the petroleum industry due to the obstruction of pipelines. In this work we carried out molecular dynamic simulations to calculate dynamic properties of methane hydrates such as velocity autocorrelation functions. These functions are Fourier transformed to generate the density of vibrational states. The positions of the bands in these spectra are comparable to those predicted for an IR or Raman spectrum. The vibrational spectra of methane hydrate were calculated for different conditions of temperature and pressure and we successfully revealed the different spectral characteristics of the methane hydrate. Keywords: Hydrates, Molecular Dynamics
1. Introduction Hydrates are crystalline substances formed by water molecules and any other substance known as the guest. Under certain specific conditions of temperature and pressure, usually near the freezing point of water with pressures of up to 500 MPa [1], the water molecules form lattices which have cavities on the inside, where the guests are accommodated. Hydrates that have attracted most interest are the natural gas hydrates, specifically methane hydrates, due to the large number of them distributed in different parts of the globe, representing a potential source of energy. Most of the studies about hydrates consist on experiments to determine its kinetics, crystal structure and its composition. However, most of these experiments require certain thermodynamic conditions that complicate the analysis and substantially increase costs. However, techniques such as molecular dynamics (MD) offer an alternative to study this kind of compounds and achieve results comparable to those obtained through an experimental analysis. This is the case for the density of vibrational states obtained from MD simulations, which can be compared with those obtained with Raman and Infrared techniques. For this reason, in this work we obtain the vibrational spectrum of methane hydrate using MD through the Fourier transformed from the autocorrelation function of the velocities of the hydrate. The second purpose of the study is to analyze the effect of pressure and temperature in the vibrational spectrum.
V.J. Landín-Sandoval et al.
88
2. Problem Statement, background MD simulation basically solves the equations of motion so that we can predict the positions, velocities, accelerations and forces of each particle during the time evolution of the system [4]. Usually a simulation of MD requires an initialization stage where several variables are established. These variables include the number of particles, control variables such as pressure, temperature, density or energy, the intermolecular potential, geometry of the region simulation, and so on. Next step considers an equilibration stage where the equations of motion are integrated generating a series of independent trajectories which are but compatible with the external imposed conditions. During this phase of the simulation different properties are obtained from the positions, velocities and molecular forces. This stage ends when the properties averages oscillate within a range of acceptable values. The last stage is production during which static and dynamic properties are calculated. The averages of these properties, obtained during the simulation, can be related to the properties obtained in an experimental laboratory at the macroscopic level. Description of the intermolecular potential The intermolecular potential is a key part in the simulation of MD and should be able to reproduce experimental data of the system in question. In this paper we use the TJE potential [5] for the water molecules and the OPLS-AA [6] to the molecules of methane. Both models consider the molecules totally flexible allowing bending of their angles and stretching of their bonds. For the water molecule, the TJE model uses a LennardJones potential along with a Coulomb potential for interactions oxygen-oxygen. The OH and HH interactions are calculated using only a Coulomb potential. In the case of the methane molecule a Lennard-Jones in addition to a Coulomb potential is used for all interactions. For interactions between water and methane molecules, the LorentzBerthelot rules are used. The intramolecular interactions for both the water and methane molecules are treated as harmonic oscillators. 2.2 Description of the method for obtaining the vibrational spectra In simulations of MD, it is possible to calculate the autocorrelation function of different properties. In this case, we concern with the atomic velocities. The velocity autocorrelation function is represented by the following expression [4]:
ψ (t ) =
1 N
N
¦
v i (t ) • v i (0)
(1)
i =1
where vi(0) is the velocity of a particle i at a given initial time, vi(t) the velocity at a time t and the angle brackets represents an average over the origins of all time intervals elected. From this dynamic property, it is possible to obtain the density of vibrational states f(w) through the Fourier transform of the velocity autocorrelation function [7]: ∞
f ( w) = ³ exp(−iwt )ψ (t ) dt 0
(2)
The Sandey-Tukey algorithm [7] is used to obtain the Fourier transform of the velocity autocorrelation functions.
Vibrational Spectra of Methane Hydrate by Molecular Dynamics
89
3. The proposed approach In this work we carried out MD simulations of methane hydrates. Temperature and pressure were controlled using Berendsen's method [4]. The integration of movement equations were carried out using Verlet's velocity algorithm [4]. The OPLS-AA[6] and TJE[5] potentials were used for the calculation of the intermolecular forces. We used the method of reaction field to address the long-range interactions. Periodic boundary conditions, as well as a cutoff radius equal to half of the box simulation were used. During the phases of equilibration and production of the MD simulations, it was necessary to verify whether the structure of hydrate is maintained. This was achieved by calculating the mean square displacement of one atom of oxygen chosen at random. If the value of this function increases in a linear fashion over time, it indicates that monitored the movement of the atom are very long and therefore the structure of hydrate has lost and has become a fluid phase. Case study The choice of the thermodynamic conditions for the case studies was analyzed based on the phase diagram reported by Sloan [1]. The conditions are analyzed within the region where hydrate formation exist. In all cases, it was considered a full occupation of methane within the cavities. The conditions of each case study are reported in Table 1. Table 1. Thermodynamic conditions for obtaining vibrational spectra in the case study
Pressure (MPa) 0.1 3 7 10 2 2 2
Temperature (K) 150 150 150 150 200 250 260
Energy (J/mol) -30015.935989 ± 44.753831 -29945.347961 ± 43.789995 -29918.234719 ± 43.662042 -29723.922538 ± 43.637796 -30688.665628 ± 48.327758 -33856.357456 ± 48.647177 -34303.999946 ± 55.823028
Density (gr/cm3) 1.001846 ± 0.000022 1.001460 ± 0.000021 1.002606 ± 0.000016 1.003020 ± 0.000016 0.985803 ± 0.000016 0.968733 ± 0.000019 0.963441 ± 0.000020
Results & discussions Thermodynamic properties like energy and density were calculated in this work and the results are shown in Table 1. To calculate the vibrational spectra, the first stage was to corroborate the accuracy of the results of the algorithms and subroutines. To confirm these results with the literature, a comparison with the spectra reported in two different studies which used the same way the Fourier transform of the velocities autocorrelation function was carried out [2, 3]. The spectra obtained for the molecule of methane are shown in Figure 1.
90
V.J. Landín-Sandoval et al.
Figure 1. Density of vibrational states of the molecule methane in methane hydrates at 200 K and 2 MPa.
By comparing the area of the spectrum from 1000 to 1700 cm-1 in Figure 1 with the reported by Greathouse et al. at 273 K and 30 MPa [2] and Jiang et al. at 200 K and 2 MPa [3], it is observed that the bands for the vibration of bending angle H-C-H, ν2 and ν4 are the same in the three cases. In the area between 2700 and 3200 cm-1, the band characteristic of the asymmetric stretching of the bond C-H, ν1 and symmetric stretching, ν3, appeared for the three cases. However, the two picks due to the librational motions of methane in all cavities reported in two studies have not been detected in the zone of 0 to 300 cm-1. With the aim of analyzing the effects of temperature on the spectra, 3 simulations were carried out at a pressure of 2 MPa and temperatures of 200, 250 and 260 K. The results are shown in Figure 2. The temperature is a property that affects the stability of the structure of methane hydrate, which is clearly reflected in the spectra. The changes in the intensity and position of the bands were observed mainly for water molecules. The same behavior has been reported by other investigators in the case of the spectrum of pure water [8], confirming that the results of this study are acceptable. In the same way, 4 simulations were carried out at constant temperature of 150 K by varying the pressure. The results obtained are shown in Figure 3. For the pressure range considered, no significant change in the bands for the molecules of the methane hydrate can be observed in Figure 3.
4. Conclusions According to the results obtained, the application of the model TJE [5] and OPLS-AA [6] provides a good approximation considering that the reproduced spectra are similar to those results by using more complex potentials. The main advantage is that the potentials used here speeds up the time of calculation. By comparing the effects of pressure and temperature, it seems that the latter significantly affects the spectrum in both intensity and frequency.
Vibrational Spectra of Methane Hydrate by Molecular Dynamics
Figure 2. Effect of temperature in the spectra of the methane hydrates
Figure 3. Effect of pressure in the spectra of the methane hydrates
5. Acknowledgements Authors acknowledge financial support from CONACYT.
91
V.J. Landín-Sandoval et al.
92
References [1] E.D. Sloan, (1998), Clathrate hydrates of natural gases, Marcel Dekker, New York. [2] J.A. Greathouse and R.T. Cygan, J. Phys. Chem. B. 110 (2006) 6428. [3] H. Jiang, K.D. Jordan and C.E. Taylor, J. Phys. Chem. B. 111 (2007) 6486. [4] M.P. Allen and D.J. Tildesley, (1987), Computer simulation of liquids, Oxford Press, New York. [5] O. Teleman, B. Jönsson and S. Engström, Mol. Phys. 60 (1987) 193. [6] W.L. Jorgensen, D.S. Maxwell and J. Tirado-Rives, J. Am. Chem. Soc. 118 (1996) 11225. [7] W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannerty, (1992), Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, New York. [8] M. Praprotnik, D. Janezic and J. Mavri, J. Phys. Chem. A. 108 (2004), 11056.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
A Comparison of Deterministic and Stochastic Approaches to Solve the Facility Layout Problem with Toxic Releases Christian O. Diaz,a Richart Vázquez-Román,a Seungho Jung,b M. Sam Mannanb a
Instituto Tecnológico de Celaya, Av. Tecnológico y A,G. Cubas, Celaya, Gto, CP 38010, MEXICO, E-mail:
[email protected],
[email protected] b Mary Kay O’Connor Process Safety Center, Artie McFerrin Department of Chemical Engineering, Texas A&M University, College Station, Texas 77843-3122, U.S.A., Email:
[email protected]
Abstract Process units are grouped into facilities and the facility concept is extended to include services and control rooms. Two approaches, deterministic and stochastic, proposed by the authors in previous studies are compared in this work. The stochastic approach considers the random effect of meteorological conditions, reported in databases, on the toxic dispersion. A Monte Carlo method is used to estimate the directional risk distribution for a given release scenario. The deterministic approach is based on the worst scenario where the stochastic meteorological condition is reduced to calm conditions. The problem was formulated as a disjunctive nonlinear optimization model, converted in a MINLP and solved with the GAMS package. The results indicate that the deterministic approach provides more conservative layouts indicating the need of including means to regulate and reduce the risk. Keywords: Layout, Meteorological effect, Monte Carlo, MINLP
1. Introduction The industrial plants layout is an important and very complex problem which has been extensively analyzed. Efficient and systematic strategies are required to significantly improve the production systems. The problem has been typically formulated with the aim of finding the most efficient physical arrangement of the process where new process units are accommodated in a given land where other units might already exist. Several layouts are designed based on heuristics and standards which can be found in different textbooks, e.g. (Mecklenburgh, 1985). Formulations addressing particularities of the layout problems have been presented in other papers. For instance, models were formulated to resolve the one-floor (Barbosa-Póvoa et al., 2001), 2D multi-floor (Patsiatzis and Papageorgiou, 2002), and even 3-D (Westerlund et al., 2007) problems. Two algorithms were presented to find the best routing based on the grid router and the vector router (Schmidt-Traub et al., 1999). Richert and Gruhn (Richert and Gruhn, 1999) presented a heuristic method to find the optimal routing based on a grid of cells. Guirardello and Swaney (Guirardello and Swaney, 2005) disaggregate the plant into modules containing a smaller number of components than the original plant to optimize the layout of these modules to, later on, perform routing between modules. However, a better layout in practice is obtained when there is a balance between several factors such as efficiency, reliability and safety in plant operations, including
93
94
C.O. Diaz et al.
maintenance, with a minimum acceptable hazard and nuisance to the public and efficient and economic use of the space for future expansions and process needs. Safety became an important issue after several accidents such as the BP Texas City, Flixborough and Bhopal disasters, see for instance (Mannan, 2005). When hazard and safety aspects are not considered properly in the layout and if an accident occurs, then the plant owners may get involved in a serious litigious process since criminal laws always deal with aspects of health, safety, environmental protection, etc. Based on our review, just a few papers on plant layout have incorporated safety issues in their models. One of the few papers in the open literature estimates safety distances with the commercial package SAFETI (Matthijsen and Kooi, 2006). The performance of Dow, Mond, Inherent Safety and Safety Weighted Hazard also for inherent safety design has also been studied (Khan and Amyotte, 2004). The first reported approach that incorporated unsafe risk was focus on optional protection devices from a list of safety features and preventive measures through the Mond index (Penteado and Ciric, 1996). The Dow Fire and Explosion Index has been used in a mixed-linear integer programming (MILP) formulation to reduce the financial risk in an ethylene oxide plant layout (Patsiatzis et al., 2004). A number of accidents with fatal consequences in the industry history have been caused by toxic releases in process units. The strategy proposed here aims to reduce this number by providing a better layout for the process units where the accommodation of occupied areas such as control rooms becomes of crucial relevance on the light of toxic releases. Two recent approaches, stochastic and deterministic, to solve the facility layout problem where at least one installed or new facility has at least a toxic release have been developed by the authors of this proposal (Diaz-Ovalle et al., 2008; VázquezRomán et al., 2008) and their comparison is presented in this work.
2. Problem Statement A normal procedure consists on grouping some of the process units where the group remains surrounded by a street. One of the purposes behind this arrangement is the possibility of providing direct access to the process unit for firefighting or maintenance works. The group of units is referred to as a facility. Then, the concept of facility is extended to include control rooms and any other area surrounded by a street. Since purely toxic releases affect lives rather than equipment, then the problem concerns to finding the layout of inhabited facilities. The problem is established as: x For given a set of already existing facilities i I ; a set of new facilities for siting s S ; a set of release types r R ; a subset of existing facilities having a particular release ri (i, r ) , and displacement values, dx ri and dy ri to identify the exact releasing point with respect to the centre of the releasing i-facility; the facilities interconnectivity for both types existing and new facilities; length and depth of each new facility for siting, Lx s and Ly s ; length and depth of each existing facility, Lxi and Ly i , as well as their centre point, ( xi , yi ) ; maximum length, Lx , and depth, Ly , of land; size of the street, st; parameters to calculate the probability of death in each facility that include expected population in the facility, number of slices with parameters to calculate the probability of death in each slice direction and the release frequency factor; cost of pipe per meter, C p ; cost per m2 of land, C L ; fatal injury cost per person in an accident, C pp ; and life time of the layout, t .
A Comparison of Deterministic and Stochastic Approaches to …
95
Determine each new facility center position xi , yi ; the occupied area out of the total land; the final piping, land and risk cost associated with the optimal layout to minimize the total cost. The following section describes the two models, stochastic and deterministic, used in this work. Since the models have been already described in detail elsewhere (DiazOvalle et al., 2008; Vázquez-Román et al., 2008), the section contains only a brief description of them.
x
3. Models Description Any new facility must be placed inside the available land having a street around it to facilitate the fire-fighting and emergency response. For the sake of simplicity, the East is represented by the direction (0,0) to (,0) and the North by the direction (0,0) to (0,). A disjunction is proposed to avoid that two facilities could occupy the same physical space. The piping cost depends on the separation distances, estimated by the Euclidian distance, among interconnected facilities. A piping cost factor is included to account for the piping cost. The occupied land is estimated by including all facilities into a rectangular area and a cost factor per m2. In principle, the land has been already paid for; however, the area occupied by the final layout should be minimized not to jeopardize future expansions. Real data compiled in several databases for the meteorological factors are included in the stochastic model. Long term meteorological data is required to get representative distribution functions. The 360º of possible directions are divided in slices which are assumed to have the same injury risk at any point within the same slice and having the same distance from the emission. A risk distribution is produced at each predetermined position within the slice via classical Monte Carlo simulation. Random values are used to select wind direction, wind speed and stability through the fitted distribution functions. Using several simulations, all risk values at each sector and at each position are averaged. A exponential decay function is then used at each direction sector to fit all average values in the sector under analysis. The risk cost depends on the frequency of each release, the expected population in the affected facility, the injury compensation cost, and the expected life for the plant. Details of this approach can be found in (Vázquez-Román et al., 2008). On the other hand, it has been argued that a complete assessment of the safety for a chemical plant must be based on the worst-case scenario. The worst-case scenario for dispersion modelling was defined as the Pasquill-Gifford stability class F but very few tests have been available to ratify this statement (Woodward, 1998). A further analysis by the authors of this proposal has demonstrated that the worst-case scenario occurs during calm weather conditions. Modelling gas dispersion where low wind speed prevails is not an easy task. The difficulty of modelling calm conditions is given by the meandering effect, the large horizontal oscillation of the atmosphere, during the diffusion of chemical species. The meandering effect appears when the differences between wind variations are small and the appearance strongly depends on Coriolis force. In fact, the calm or low speed wind concepts do not correspond to a unique value but it depends on specific modelling conditions. The most typical value used in QRA studies for worst-case scenarios seems to be 2 m/s but the lowest wind speed for toxic releases has been 2.4 m/s for both F and D stability conditions. The deterministic model developed in this approach then eliminates the stochastic effect for the wind. Since calm winds can actually occur in any
C.O. Diaz et al.
96
direction then the risk contours become circular around the release point. Details of this approach can be found in (Diaz-Ovalle et al., 2008).
4. Case study One example is considered in this section to compare the results with both stochastic and deterministic approaches and the optimal layout assuming no toxic release. The disjunctions in the model are reformulated via the convex hull method to produce a MINLP model and the case study has been solved in the GAMS modeling system using a PC Intel® Pentium® M processor 2.00 GHz . The example considers two facilities already installed and three, including the Control Room, to be installed. The size of each facility, expected number of inhabited people and the exact position for the installed facilities are indicated in Table 1. The allocation will be in a square land with 1000 m side length. The facility “New A” feeds “Facility A” and gets material from “New B”. Additional information includes 196.8 $/m of interconnecting pipe, 6.0 $/m2 of land and $8,000,000.00 for the injury parameter; the plant life is 45 years, 5 m for the length of street and 0.5 as the frequency factor per accident during the plant life. Spills of chlorine are possible in “Facility A” and “Facility B” where the chlorine ERPG-3 value is 0.057 g/m3. The optimal layouts considering no release and release with the stochastic and deterministic models are shown in Figure 1. Optimal solutions were obtained using DICOPT in GAMS and the relevant results are given in Table 2.
5. Conclusions A comparison of the stochastic and deterministic approaches has been carried out here. The results show a meaningful difference in the optimal layouts. Layouts from the stochastic approach are more compact and hence cheaper than layouts from the deterministic approach. However, the deterministic approach produces safer layouts. The authors believe that the layout design should be regulated by the law though, as any risky activity, the final decision will always depend on the aversive-addictive risk politics of each company.
6. Acknowledgements The authors thank financial support from CONACyT, DGEST and the DHS.
Table 1: Data for facilities in Example 1
Facility A Facility B New A New B Control Room
Lx [m] 200 150 100 300 15
Ly [m] 100 150 300 150 15
People 0 1 0 0 10
(x,y) [m] (105,55) (80,185) -
A Comparison of Deterministic and Stochastic Approaches to …
97
Table 2: Results in Example 1
Without toxic release 142,600 941258
Total land [m2] Total cost [$]
Stochastic approach 142,600 898481
a)
Deterministic approach 247249 1529427
b)
c) Figure 1: Layout for the case study: a) Without toxic release, b) Stochastic approach, c) Deterministic approach.
98
C.O. Diaz et al.
7. References A. P. Barbosa-Póvoa, Mateus, R. and Novais, A. Q. (2001). "Optimal two-dimensional layout of industrial facilities." International Journal of Production Research, 39(12), 2567-2593. C. O. Diaz-Ovalle, Jung, S., Vázquez-Román, R. and Mannan, M. S. (2008). "An approach to solve the facility layout problem based on the worst scenario." 11th Annual Symposium, Mary Kay O’Connor Process Safety Center, College Station, Tx, October 28-29, pp 2839, ISBN: 978-0-615-25170-7. R. Guirardello and Swaney, E. (2005). "Optimization of process plant layout with pipe routing." Computers & Chemical Engineering, 30(1), 99-114. F. I. Khan and Amyotte, P. R. (2004). "Integrated inherent safety index (I2SI): A tool for inherent safety evaluation." Process Safety Progress, 23(2), 136-148. S. Mannan. (2005). Lees' Loss prevention in the process industries: Hazard identification, assessment and control, 3 Ed., Elsevier Butterworth-Heinemann, USA. A. J. C. M. Matthijsen and Kooi, E. S. (2006). "Safety distances for hydrogen filling stations." Fuel Cells Bulletin, 11, 12-16. J. C. Mecklenburgh. (1985). Process plant layout, John Wiley & Sons, New York. D. I. Patsiatzis, Knight, G. and Papageorgiou, L. G. (2004). "An MILP approach to safe process plant layout." Trans IChemE Part A: Chemical Engineering and Design, 82(A5), 579586. D. I. Patsiatzis and Papageorgiou, L. G. (2002). "Optimal multi-floor process plant layout." Computers & Chemical Engineering, 26(4-5), 575-583. F. D. Penteado and Ciric, A. R. (1996). "An MINLP approach for safe process plant layout." Industrial and Engineering Chemistry Research, 35(4), 1354-1361. H. Richert and Gruhn, G. (1999). "A numeric heuristic system for plant wide pipe routing." Computers & Chemical Engineering, 23, S735-S738. H. Schmidt-Traub, Holtkötter, T., Lederhose, M. and Leuders, P. (1999). "An approach to plant layout optimization." Chemical Engineering & Technology, 22(2), 105-109. R. Vázquez-Román, Lee, J.-H., Jung, S. and Mannan, M. S. (2008). "Designing plant layouts with toxic releases based on wind statistics." IASTED International Conference on Modelling and Simulation, paper 620-018, May 26-28, Quebec, Canada. J. Westerlund, Papageorgiou, L. G. and Westerlund, T. (2007). "A MILP Model for Ndimensional allocation." Computers & Chemical Engineering, 2007.2002.2006. J. L. Woodward. (1998). "Improving the effect of atmospheric stability class for dispersion modeling." Process Safety Progress, 17, 1-8.
19th European Symposium on Computer Aided Process Engineering – ESCAPE19 J. JeĪowski and J. Thullie (Editors) © 2009 Elsevier B.V. All rights reserved.
99
Analysis of chemical routes and processes for production of glycerol ethers Costin Sorin Bildea, Cristian Brunchi, Grigore Bozga University Politehnica of Bucharest, Polizu 1-7, 011061 Bucharest, Romania, E-mail:
[email protected]
Abstract The feasibility of glycerol etherification is investigated, considering olefins, alcohols and ethers as co-reactants. Details are presented for the reaction between glycerol and iso-butene. Simultaneous phase and chemical equilibrium calculations show that large glycerol conversion can be obtained at a good selectivity towards the desired di-ether. The behaviour of the reactor-separation-recycle flowsheet is analyzed, demonstrating that the recycle of the mono-ether has a beneficial effect. About 1 m3 of reactor volume is necessary for producing 1 kmol/h of di-ether, while the recycle rates of glycerol and mono-ethers are kept at small values. Keywords: glycerol ethers, phase and chemical equilibrium, process design
1. Introduction A recent European Union directive requires that, by the end of the year 2010, traffic fuels should contain 5.25% of components produced from renewables. Biodiesel, which is a mixture of methyl esters of fatty acids, is produced from vegetable oils by transesterification with methanol. As by-product, 1 mole of glycerol is produced for every 3 moles of methyl esters, which is equivalent to approximately 10 % wt. of the total product. As a result to the increasing availability, the market price of glycerol has dropped rapidly. Therefore, new uses for glycerol need to be found. Although glycerol could be burnt as a fuel, it could also be processed into more valuable components. Di- and tri-ethers of glycerol are compounds soluble in diesel and biodiesel, improving the quality of the fuel [1] . They diminish the emissions of particulate matter, carbon oxide and carbonyl compounds. Moreover, they decrease the cloud point of diesel fuel when combined with biodiesel. Therefore, ethers of glycerol are interesting alternatives to commercial oxygenate additives such as MTBE, ETBE or TAME. In this contribution, we analyze the feasibility of industrial-scale processes for production of glycerol ethers. The reaction can be carried out in homogeneous [2] or heterogeneous [3] [4] catalysis. Calculation of equilibrium conversion shows that relatively high conversions of glycerol can be obtained by etherification with iso-butene and trans-etherification with TAME. Analysis of the reactor-separation-recycle flowsheet where the reaction kinetics is taken into account demonstrates that the reactions are fast enough to allow large di-ether production rates with small recycles of iso-butene, glycerol and mono-ether.
2. Chemistry and thermodynamics Etherification of glycerol with olefins, leading to mono-, di- and tri-ethers, is presented in Figure 1. Etherification with alcohols and trans-etherification take place in a similar way, one mole of water and alcohol, respectively, being additionally formed.
C.S. Bildea et al.
100 H2 C HC H2C
OH
H2C
OH + O OH
OH
HC
OH
H2 C
G
H2C +O
O
R
HC H2 C
ME
O
R +O
OH O
DE
R
H2C
O
R
HC
O
R
H2C
O
R
TE
Figure 1. Etherification of glycerol with olefins. G – glycerol; O – olefin; ME – mono-ether; DE – di-etherl TE – tri-ether. In the following, ME, DE and TE will refer to mono-, di- and tri-tertbutyl ethers of glycerol
Design of an industrial process requires certain information about the chemical reactions and the species involved. Thus, reaction enthalpy is needed to decide about the type of reactor and the necessity of heating or cooling the reaction mixture. The equilibrium conversion limits the performance of the reactor, which in turn determines the configuration of the separation section and the amount of reactants to be recycled. Moreover, the phase equilibrium should be also taken into account. For glycerol, olefins and alcohols, thermodynamic data such as enthalpy and Gibbs free energy of formation, heat capacities, boiling point and heat of vaporization can be obtained from literature. However, the properties of mono-, di- and tri-ethers must be estimated or experimentally determined. In this work, we used the Constantinou - Gani second-order group contribution method to estimate the thermodynamic properties of the tert-butyl ethers of glycerol. A selection of result is presented in Table 1. Table 1. Physical properties of the tert-butyl ethers of glycerol Property
ME
DE
TE
Boiling point / [K]
537.8
513.6
526.2
Critical temperature / [K]
701.0
676.6
691.2
Critical pressure /[bar]
28.16
19.66
13.06
-649.5
-724.6
-787.1
-388.2
-336.5
-269.6
-0.876
-1.302
-1.736
211.7
306.1
398.1
8.00×104
7.35×104
6.62×104
Enthalpy of formation /[kJ/mol] ideal gas, 298.15 K Gibbs free energy / [kJ/mol] ideal gas, 298.15 K Entropy / [kJ/mol/K] ideal gas, 298.15 K Specific molar heat/ [J/mol/K] Ideal gas, 293.15 K Enthalpy of vaporization, J/mol 298.15 K
Analysis of Chemical Routes and Processes for Production of Glycerol Ethers
101
Chemical and phase equilibrium For the reactions of etherification between glycerol and iso-butene, the enthalpy, free Gibbs energy and equilibrium constant are shown in Table 2. All the reactions are slightly exothermic, while the chemical equilibrium favors the formation of di-tert-butyl ether. Table 2. Enthalpy, free Gibbs energy and equilibrium constants for the etherification reactions Reaction
ǻHr / [kJ/mol]
ǻGr / [kJ/mol]
Ka, 90 °C
G + O → ME
-47.25
9.88
0.038
ME + O → DE
-40.86
0.052
0.98
DE + O → TE
-27.30
15.60