Integrated Process and Plant Design Optimisation of Industrial Scale Batch Systems: Addressing the Inherent Dynamics through Stochastic and Hybrid Approaches (original) (raw)
Related papers
Mixed-Integer Nonlinear Programming Optimization Strategies for Batch Plant Design Problems
Industrial & Engineering Chemistry Research, 2007
Due to their large variety of applications, complex optimisation problems induced a great effort to develop efficient solution techniques, dealing with both continuous and discrete variables involved in non-linear functions. But among the diversity of those optimisation methods, the choice of the relevant technique for the treatment of a given problem keeps being a thorny issue. Within the Process Engineering context, batch plant design problems provide a good framework to test the performances of various optimisation methods : on the one hand, two Mathematical Programming techniques-DICOPT++ and SBB, implemented in the GAMS environment-and, on the other hand, one stochastic method, i.e. a genetic algorithm. Seven examples, showing an increasing complexity, were solved with these three techniques. The result comparison enables to evaluate their efficiency in order to highlight the most appropriate method for a given problem instance. It was proved that the best performing method is SBB, even if the GA also provides interesting solutions, in terms of quality as well as of computational time.
Constraint handling strategies in Genetic Algorithms application to optimal batch plant design
Chemical Engineering and Processing: Process Intensification, 2008
Optimal batch plant design is a recurrent issue in Process Engineering, which can be formulated as a Mixed Integer Non-Linear Programming (MINLP) optimisation problem involving specific constraints, which can be, typically, the respect of a time horizon for the synthesis of various products. Genetic Algorithms constitute a common option for the solution of these problems, but their basic operating mode is not always wellsuited to any kind of constraint treatment: if those cannot be integrated in variable encoding or accounted for through adapted genetic operators, their handling turns to be a thorny issue. The point of this study is thus to test a few constraint handling techniques on a mid-size example in order to determine which one is the best fitted, in the framework of one particular problem formulation. The investigated methods are the elimination of infeasible individuals, the use of a penalty term added in the minimized criterion, the relaxation of the discrete variables upper bounds, dominancebased tournaments and, finally, a multiobjective strategy. The numerical computations, analysed in terms of result quality and of computational time, show the superiority of elimination technique for the former criterion only when the latter one does not become a bottleneck. Besides, when the problem complexity makes the random location of feasible space too difficult, a single tournament technique proves to be the most efficient one.
Engineering Optimization, 2007
Engineering optimization often deals with large, mixed-integer search spaces with a rigid structure due to the presence of a large number of constraints. Metaheuristics, such as evolutionary algorithms (EAs), are frequently suggested as solution algorithms in such cases. In order to exploit the full potential of these algorithms, it is important to choose an adequate representation of the search space and to integrate expert-knowledge into the stochastic search operators, without adding unnecessary bias to the search. Moreover, hybridisation with mathematical programming techniques such as mixed-integer programming (MIP) based on a problem decomposition can be considered for improving algorithmic performance. In order to design problem-specific EAs it is desirable to have a set of design guidelines that specify properties of search operators and representations. Recently, a set of guidelines has been proposed that gives rise to so-called Metric-based EAs (MBEAs). Extended by the minimal moves mutation they allow for a generalization of EA with self-adaptive mutation strength in discrete search spaces. In this article, a problem-specific EA for process engineering task is designed, following the MBEA guidelines and minimal moves mutation. On the background of the application, the usefulness of the design framework is discussed, and further extensions and corrections proposed. As a case-study, a two-stage stochastic programming problem in chemical batch process scheduling is considered. The algorithm design problem can be viewed as the choice of a hierarchical decision structure, where on different layers of the decision process symmetries and similarities can be exploited for the design of minimal moves. After a discussion of the design approach and its instantiation for the case-study, the resulting problem-specific EA/MIP is compared to a straightforward application of a canonical EA/MIP and to a monolithic mathematical programming algorithm. In view of the results the benefits of customising the EA are discussed.
Computers & Industrial Engineering, 2008
This work deals with multiobjective optimization problems using Genetic Algorithms (GA). A MultiObjective GA (MOGA) is proposed to solve multiobjective problems combining both continuous and discrete variables. This kind of problem is commonly found in chemical engineering since process design and operability involve structural and decisional choices as well as the determination of operating conditions. In this paper, a design of a basic MOGA which copes successfully with a range of typical chemical engineering optimization problems is considered and the key points of its architecture described in detail. Several performance tests are presented, based on the influence of bit ranging encoding in a chromosome. Four mathematical functions were used as a test bench. The MOGA was able to find the optimal solution for each objective function, as well as an important number of Pareto optimal solutions. Then, the results of two multiobjective case studies in batch plant design and retrofit were presented, showing the flexibility and adaptability of the MOGA to deal with various engineering problems.
Genetic algorithms for the scheduling of multiproduct batch plants within uncertain environment
Computer Aided Chemical Engineering, 2007
This study addresses the problem of batch plant scheduling. In addition, uncertainty on product demands is considered through probabilistic-based methods. In the resulting two-stage stochastic programming problem, the objective is to maximize an Expected Profit Value (EPV) while respecting a constraint forcing the makespan to be lower than a time horizon. A Genetic Algorithm (GA) is proposed for the solution of a multiproduct example. The variable encoding requires special attention. Computational tests are first carried out with a deterministic model to validate the GA efficiency. Then, different runs with different scenario sets highlight the existence of various solution classes, characterized by specific numbers of batches manufactured for each product. Further analysis finally enables to discuss if each schedule is really the best-fitted to the scenario set for which it has been determined.
A novel model-based approach to optimization and control design of batch processes
Journal of Process Control, 1994
Traditionally, many industrial batch processes have been operated according to rigid recipes, in spite of the fact that production would yield more profit or a better product if they were efficiently adapted to changes in quality and cost of the used and/or produced products, process and scheduling conditions, and so on. In this paper an approach, called the flexible recipe approach, is given, which transforms the common rather static recipes into recipes that can be easily improved and used for systematic and efficient production adaptation at the start of a batch and during the processing. To be able to use this approach in an industrial environment a practical implementation is made in the software package FRIS. A fermentation process chosen as an example shows the methods and gives an indication of the expected profit.
Computers & Chemical Engineering, 2006
This work deals with the multicriteria cost-environment design of multiproduct batch plants, where the design variables are the size of the equipment items as well as the operating conditions. The case study is a multiproduct batch plant for the production of four recombinant proteins. Given the important combinatorial aspect of the problem, the approach used consists in coupling a stochastic algorithm, indeed a genetic algorithm (GA) with a discrete-event simulator (DES). Another incentive to use this kind of optimization method is that, there is no easy way of calculating derivatives of the objective functions, which then discards gradient optimization methods. To take into account the conflicting situations that may be encountered at the earliest stage of batch plant design, i.e. compromise situations between cost and environmental consideration, a multiobjective genetic algorithm (MOGA) was developed with a Pareto optimal ranking method. The results show how the methodology can be used to find a range of trade-off solutions for optimizing batch plant design.
Dynamic optimization in the batch chemical industry
2002
Dynamic optimization of batch processes has attracted more attention in recent years since, in the face of growing competition, it is a natural choice for reducing production costs, improving product quality, and meeting safety requirements and environmental regulations. Since the models currently available in industry are poor and carry a large amount of uncertainty, standard model-based optimization techniques are by and large ineffective, and the optimization methods need to rely more on measurements.
Chemical Product and Process Modeling, 2010
This work deals with the problem of the search for optimal design of multiproduct batch chemical plants found in a chemical engineering process with uncertain demand. The aim of this work is to minimize the investment cost and find out the number and size of parallel equipment units in each stage. For this purpose, it is proposed to solve the problem in two different ways: the first way is by using Monte Carlo Method (MC) and the second way is by Genetics Algorithms (GAs). This GAs consider an effective mixed continuous discrete coding method with a four- point crossover operator, which take into account simultaneously, the uncertainty on the demand using Gaussian process modeling with two criteria maximization the Net Present Value (NPV) and Flexibility Index (FI). The results (number and size of equipment, investment cost, production time (Hi), NPV, FI, CPU time and Idle times in plant) obtained by GAs are better than the MC. This methodology can help the decision makers and const...
Process Structure Optimization Using a Hybrid Disjunctive-Genetic Programming Approach
Computer Aided Chemical Engineering, 2009
Discrete optimization problems, which give rise to the conditional modelling of equations through representations as logic based disjunctions, are very important and often appear in all scales of chemical engineering process network design and synthesis. Disjunctive-Genetic Programming (D-GP), based on the integration of Genetic Algorithm (GA) with the disjunctive formulations of the Generalized Disjunctive Programming (GDP) for the optimization of process networks, has been proposed in this work. With the increase in the problem scale, dealing with such alternating routes becomes difficult due to increased computational load and possible entanglement of the results in sub-optimal solutions due to infeasibilities in the MILP space. In this work, the genetic algorithm (GA) has been used as a jumping operator to the different terms of the discrete search space and for the generation of different feasible fixed configurations. This proposed approach eliminates the need for the reformulation of the discrete /discontinuous optimization problems into direct MINLP problems, thus allowing for the solution of the original problem as a continuous optimization problem but only at each individual discrete and reduced search space.