Optimal design problem are widely known by their multiple performance measures that are often competing with each other. In this paper, an optimal multiproduct batch chemical plant design is presented. The design is firstly formulated as a multiobjective optimization problem, to be solved using the well suited non dominating sorting genetic algorithm (NSGA-II). The NSGA-II have capability to achieve fine tuning of variables in determining a set of non dominating solutions distributed along the Pareto front in a single run of the algorithm. The NSGA-II ability to identify a set of optimal solutions provides the decision-maker DM with a complete picture of the optimal solution space to gain better and appropriate choices. Then an outranking with PROMETHEE II helps the decision-maker to finalize the selection of a best compromise. The effectiveness of NSGA-II method with multiojective optimization problem is illustrated through two carefully referenced examples.

1. Introduction

Batch processes are used in production of many low-volume but high-value-added products (such as speciality chemicals, health care, food, agrochemicals,…etc.) because of operation flexibility in today’s market-driven environment. Manufactory of these products generally involves multi step synthesis [1]. In addition, if two or more products require similar processing steps, the same set of equipment is considered for at least economical reason. A batch plant producing multiple products is categorized as either a multiproduct plant or a multipurpose plant. Multiproduct plants produce multiple products following a sequential similar recipe. In such a plant, all the products follow the same path through the process and only one product is manufactured at a time. Each step is carried out on single equipment or on several parallel equipment units. Processing of other products is carried out using the same equipment in successive production runs or campaigns. In a multipurpose plant, each product follows one or more distinct processing paths; so more than one product may be produced simultaneously in such plants. The present work is directed toward the optimal design problems of multiproduct batch plants.

In conventional optimal design of a multiproduct plant, production requirements of each product and a total production time for all products are available and specified. The number, the required volume, and size of parallel equipment units in each stage are then determined to minimize the investment. It should be emphasized that batch plantsdesign has been for long identified as a key problem in chemical engineering as reported in literature [2–9]. Formulation of batch plant design generally involves mathematical programming methods, such as linear programming (LP), nonlinear programming (NLP), mixed-integer linear programming (MILP) or mixed-integer nonlinear programming (MINLP). Mathematical programming or different optimization techniques, such as branch and bound, heuristics, genetic algorithm, simulated annealing, are thoroughly used to derive optimal solutions.

However, in reality the multiproduct design problem can be formulated as a multiobjective design optimization problem in which one seeks to minimize investment, operation cost, and total production time, and, simultaneously, to maximize the revenue. Recall that not much work has been reported in the literature on the multiobjective optimal design of a multiproduct batch plant. Huang and Wang [10] introduced a fuzzy decision-making approach for multiobjective optimal design problem of a multiproduct batch plant. A monotonic increasing or decreasing membership function is used to define the degree of satisfaction for each objective function and the problem is then represented as an augmented minmax problem formulated as MINLP models. To obtain a unique solution, the MINLP problem is solved using a hybrid differential evolution technique. Dedieu et al. [11] presented the development of a two-stage methodology for multiobjective batch plant design and retrofit according to multiple criteria. The authors used a multiobjective genetic algorithm based on the combination of a single-objective genetic algorithm and a Pareto sort procedure for proposing several plant structures and a discrete event simulator for evaluating the technical feasibility of the proposed configurations.

In the case of multiple objectives, an optimum solution with respect to all objectives may not exist. In most cases, the objective functions are in conflict, because in order to decrease any of the objective functions, we need to increase other objective functions. Recently, Solimanpur et al. [12] developed a sophisticated multiobjective integer programming model where the objectives considered were the maximization of total similarity between parts, the minimization of the total processing cost, the minimization of the total processing time and the minimization of the total investment needed for the acquisition of machines [13].

The presence of multiple objectives in a problem usually gives rise to a family of nondominated solutions, largely known as Pareto-optimal solutions, where each objective component of any solution along the Pareto front can only be improved by degrading at least one of its other objective components. Since none of the solutions in the nondominated set is absolutely better than any other, any one of them is then an acceptable solution. As it is difficult to choose any particular solution for a multiobjective optimization problem without iterative interaction with the decision maker (DM) [14] one general approach is to establish first the entire set of Pareto-optimal solutions, where an external Decision Maker (DM) direct intervention gives interactive information in the multiobjective optimization loop [15]. So, a satisfactory solution of the problem is found as soon as the knowledge is acquired [16]. Promethee II (Preference Ranking Organisation METHod for Enrichment Evaluationsβ€”2nd version) is a popular decision method that has been successfully applied in the selection of the final solution of multiobjective optimization problems. It generates a ranking of available points, according to the DM preferences, and the best ranked one is considered the favourite final solution. It is based on the concept of outranking relation, which is a binary relation defined between every pair (π‘Ž,𝑏) of alternatives, in such way that, if π‘Ž is preferred to 𝑏 (according to the DM interests), then it is said that π‘Žoutranks 𝑏. When these relations are defined between all pairs of alternatives, they are exploited according to some rules in order to rank all solutions from the best to the worst.

The first GA proposed for multiobjective optimization was VEGA [17]. This is a nonPareto based approach based on the selection of several relevant groups of individuals, each group being associated to a given objective. It is reported that the method tends to crowd results at extremes of the solution space, often yielding to poor convergence of the Pareto front. A more recent algorithm, based on scalarization with a weighted sum function, is proposed in Ishibuchi and Murata [18] where the weights are randomly chosen. Many successful evolutionary multiobjective optimization algorithms were developed based on the two ideas suggested by Goldberg [19]: Pareto dominance and niching. Pareto dominance is used to exploit the search space in the direction of the Pareto front and niching technique explores the search space along the front to keep diversity. The well-known algorithms in this category include Multiobjective Genetic Algorithm: (MOGA) [16], Niched Pareto Genetic Algorithm: (NPGA) [20], Strength Pareto Evolutionary Algorithm: (SPEA) [21], Multiobjective Evolutionary Algorithm: (MOEA) [22], the Nondominated Sorting Genetic Algorithm (NSGA) proposed by Srinivas and Deb [23] was one of the first evolutionary algorithm for solving multiobjective optimization problems. Although NSGA has been successfully applied, the main criticisms of this approach has been its high computational complexity of nondominated sorting, lack of elitism, and need for specifying a tuneable parameter called sharing parameter. Recently, Deb et al. [24] reported an improved version of NSGA, which they called NSGA-II, to address all the above issues.

The purpose of this study is to extend this methodology for solution of multiobjective optimal control problems under the framework of NSGA-II. The efficiency of the proposed method is illustrated by solving multiobjective optimization problem.

2. Formulation of the Multiobjective Problem

The problem of multiproduct batch plant covered in this paper can be defined by assuming that the plant consists of a sequence of 𝑀 batch processing stages that are used to manufacture 𝑁 different products. At each stage j there are 𝑁𝑗 identical units in parallel operating out of phase, each with a size 𝑉𝑗 . Each product 𝑖 follows the same general processing sequence.

Batches are transferred from one stage to the next without any delay, that is, we consider a zero-wait operating policy.

In the conventional design of a multiproduct batch plant, one seeks to minimize the investment cost by determining the optimal number, required volume and size of parallel equipment units in each stage for a specified production requirement of each product and the total production time. However, in reality the designer considers not only minimizing the investment but also minimizing the operation cost and total production time while maximizing the revenue, simultaneously


So, the multiobjective problem consists of determining the following parameters:

(i)𝑁𝑗 the number of parallel units in stage 𝑗,(ii)𝑉𝑗 the required volume of a unit in stage 𝑗,(iii)𝐡𝑖 size of the batch of product 𝑖 at the end of the 𝑀 stages,(iv)𝑇𝐿𝑖 the cycle time for product 𝑖, (v)𝑄𝑖 the production requirement of product 𝑖 and,(vi)𝐻 the total production time,

while satisfying certain constraints such as volume, time, and so forth.

The constraints are expressed as follows:

(1) Volume constraints. Volume 𝑉𝑗 has to be able to process all the products 𝑖:


(2) Time constraint. The summation of available production time for all products is not more than the net total time for production


(3) The limiting cycle time for product i:


(4) Dimension constraints. Every unit has restricted allowable range


3. Elitist Nondominated Sorting Genetic Algorithm (NSGA-II)

The NSGA II Pareto ranking algorithm is an elitist Deb et al. [24] system and maintains an external archive of the Pareto solutions. In contrast to the simple genetic algorithms that look for the unique solution, the multiobjective genetic algorithm tries to find as many elements of the Pareto set as possible. For the case of the NSGA-II, this one is provided with operators who allow it to know the level of nondominance of every solution as well as the grade of closeness with other solutions; which allows it to explore widely inside the feasible region.

In a brief form, the functioning of the multiobjective genetic algorithm NSGA-II can be described through the following steps.

Fast Nondominated Sort
A very efficient procedure, is used to arrange the solutions in fronts (nondominated arranging), in accordance with their aptitude values. This is achieved, creating two entities for each of the solutions. A domination count 𝑛𝑝, the number of solutions which dominates the solution 𝑝, and a set (𝑆𝑝), that contains the solutions that are dominated for 𝑝. The solutions of the first front have the higher status of nondominance in the Pareto sense.

Diversity Preservation
This is achieved, by means of the calculation of the crowding degree or closeness for each of the solutions inside the population. This quantity is obtained, by calculating the average distance of two points on either side of a particular solution along each of the objectives. This quantity serves as an estimate of the cuboid perimeter, formed by using the nearest neighbours as the vertices. There is also, an operator called Crowded-Comparison (≺𝑛), which guides to the genetic algorithm, towards the Pareto optimal front, in accordance with the following criterion:
𝑖≺𝑛𝑖𝑗ifrank<𝑗rankξ€Έ,𝑖orrank=𝑗rank𝑖anddidtance>𝑗distanceξ€Έ.(9) In accordance with the previous criterion, between two nondominated solutions, we prefer the solution with the better rank. Otherwise, if both solutions belong to the same front, then, we prefer the solution that is located in a lesser crowded region.

Initial Loop
Initially, a random parent population (π‘ƒπ‘œ) of size 𝑁 is created. Later this one is ordained, using the procedure of nondominated arranging. Then the usual binary tournament selection, recombination and mutation operators are used to create a new population (𝑄0), of size 𝑁.

Main Loop
The NSGA-II procedure can be explained, by describing the th generation just as it is showed in Figure 1. The procedure begins with the combination of 𝑃𝑑 and 𝑄𝑑 forming a new population called 𝑅𝑑, then the population 𝑅𝑑 is sorted using the nondomination criterion. Since all previous and current population members are included in 𝑅𝑑, elitism is ensure. The population 𝑅𝑑 has a size of 2𝑁, later, the different fronts of nondominated solutions are created, being 𝐹1 the front that contains the better rank solutions. Figure 4 shows that, during the process of forming the new population 𝑃𝑑+1, the algorithm takes all members of the fronts 𝐹1 and 𝐹2, and some elements of the front 𝐹3; this is, because N solutions are needed exactly for the new population 𝑃𝑑+1 to find them exactly 𝑁 solutions, the last front is ordained, which for this description is the number 3, arranging the solutions in descending order by means of the crowded comparison (≺𝑛), and selecting the best solutions needed to fill all population slots. After having the population 𝑃𝑑+1, the genetic operators of selection, crossing and mutation, are used to create the new population 𝑄𝑑+1 of size 𝑁. Finally it is mentioned that the selection process, the crowded comparison operator is used.

4. Description of the Process

To demonstrate the effectiveness of NSGA-II on batch plant processes two examples are given here. The first example is about a batch plant consisting of three processing stages (mixer, reactor, and centrifuge) to manufacture two products, A and B. The second example treats four processing stages (mixer, reactor, extraction and centrifuge) to manufacture three products A, B and C. The data for examples 1 and 2 are illustrated, respectively, in Tables 1 and 2 (the processing times, size factor for the units and cost for each product).

5. Results and Discussion

5.1. Example 1

A four-objective optimization problem is considered and expressed in (1)–(4). The set of decision variables consists of the batch size, the total production time, the number of parallel units at each stage, the cycle time for each product, and the required volume of a unit in each stage. Since the number of parallel units at each stage is an integer decision variable, we code this variable as a binary variable. All other decision variables are coded as real numbers. Thus, there are 3 integer variables and 10 real variables. In addition to the constraints expressed by (5)–(8), we consider bounds on objective functions as additional constraints to generate feasible nondominated solutions in the range desired by the decision-maker, to have 19 constraints in all


Then NSGA-II is employed to solve the optimization problem with the following parameters: maximum number of generation up to 200, population size 500, probability of crossover 0.85, probability of mutation 0.05, distribution index for the simulated crossover operation 10 and distribution index for the simulated mutation operation 20.

The Pareto-optimal solutions for example 1 are presented in Figure 2. The revenue (𝑓1) increases with the increase in operation cost (𝑓3), while the investment cost (𝑓2) decreases. When all the four objective functions are considered simultaneously, solutions obtained in the present study show improvement as by Huang and Wang [10] results for the same problem. For example, let us consider the solution presented by Huang and Wang [10] with unit reference membership level for all objectives: 𝑓1=121350, 𝑓2=171624, 𝑓3=77299,𝑓4=5667. The solution (1) presented in Table 3 of the present study improves the above solution 𝑓1,𝑓3,𝑓4 while 𝑓2 is comparable.

Figure 3 presents the relationships between some chosen decision variables. The large set of multiple optimal solutions provides the decision maker with immediate information about the relationship among the several objective criteria and a set of feasible solutions. Thus, it helps the decision-maker to select a highly confident choice of solution. The fixed optimal plant structure as 221 corresponds to a two mixers, two reactors, and one centrifuge design. The optimal solution is shown in Figure 4.

5.2. Example 2

The batch plant in this case consists of four processing stages to manufacture three products A, B, and C, with four-objective optimization problem as expressed in (1)–(4). The set of decision variables remains the same as that in example 1. But we deal with 4 integer variables, 14 real variables, and 31 constraints which includes bounds on objective functions.

The same model equations of example 1 are used here except the processing time, πœπ‘–π‘— in (7). The time required to process one batch of product i in stage j is expressed as:

πœπ‘–π‘—=πœπ‘–π‘—+𝑐𝑖𝑗𝐡𝛾𝑗𝑖,βˆ€π‘–,βˆ€π‘—,(11) where πœπ‘–π‘—β‰₯0, 𝑐𝑖𝑗β‰₯0 and 𝛾𝑗 are constants and 𝐡𝑖 is the batch size for product 𝑖.

Thus, the processing time is not a constant, but depends on the decision parameters of the batch size. Table 2 presents the necessary data for the problem.

The constrained multiobjective MINLP problem is solved by NSGA-II with the same set of NSGA-II parameters as used in example 1.

As in example 1, the revenue (𝑓1) increases as operation cost (𝑓3) increases, while the investment cost (𝑓2) decreases following operation cost (𝑓3). The Pareto-optimal solutions for example 2 are presented in Figure 5. The relationships of the various decision variables are shown in Figure 6. Let mention that when all four objective functions are considered simultaneously, the solutions obtained in the present study improve significantly the results presented by Huang and Wang [10] for the same problem. For example, the solution presented by Huang and Wang [10] with unit reference membership level for all objectives (𝑓1=274312,𝑓2=375688,𝑓3=175688,𝑓4=5639) the solution (1) presented in Table 4 of the present study improves the above solution 𝑓1,𝑓3,𝑓4 while 𝑓2 is comparable.

In this example, the plant structure evolved as optimal is: two mixers, two reactors, two extractors, and one centrifuge as presented in Figure 7.

Implementation of a trade-off analysis is dependent upon the availability of the decision-maker’s preferences.

6. Conclusion

A multiobjective decision in a batch plant process design is considered and a non dominating sorting genetic algorithm (NSGA-II) is developed to get an optimal zone containing solutions under the concept of Pareto set. NSGA-II capability has been proved in evolving the entire set of nondominating solutions along the Pareto front in a single run of the algorithm. Thus, the Decision Maker (DM) is provided with the best trade-off operating zone. Furthermore, a better confident choice of design among several compromises of the decision maker can be achieved if the decision variables effects on the objective functions are known.

Finally, the large set of solutions presents a useful base for further alternative approaches to fulfil the DM targets.

The inherent dynamic nature of batch processes allows for their ability to handle variations in feedstock and product specifications and provides the flexibility required for multiproduct or multipurpose facilities. They are thus best suited for the manufacture of low-volume, high-value products, such as specialty chemicals, pharmaceuticals, agricultural, food, and consumer products, and most recently the constantly growing spectrum of biotechnology-enabled products. Reduced time to market, lower production costs, and improved flexibility are all critical success factors for batch processes.


𝐡𝑖Size of the batch of product 𝑖 at the end of the 𝑀 stages (kg)
𝐢𝐸𝑗Operation cost in stage 𝑗 ($)
𝐢𝑂𝑖Operation cost of product 𝑖 to be produced ($/kg)
𝐢𝑃𝑖Price of product 𝑖 ($/kg)
𝐻Total production time (β„Ž)
𝑀Number of stages in the batch process
𝑁Number of products to be produced
𝑁𝑗Number of parallel units in stage 𝑗
𝑄𝑖Production requirement of product 𝑖 (kg)
𝑆𝑖𝑗Size factor of product 𝑖 in stage 𝑗 (L/kg)
𝑇𝐿𝑖Cycle time for product 𝑖 (β„Ž)
𝑉𝑗Required volume of a unit in stage 𝑗 (L)
 Greek Symbols
𝛼𝑗Cost coefficient for unit 𝑗
𝛽𝑗Cost exponent for unit 𝑗
πœπ‘–π‘—Processing time of product 𝑖 in stage 𝑗 (β„Ž).