81 research outputs found
Mutual benefits of two multicriteria analysis methodologies: A case study for batch plant design
This paper presents a MultiObjective Genetic Algorithm (MOGA) optimization framework for batch plant design. For this purpose, two approaches are implemented and compared with respect to three criteria, i.e., investment cost, equipment number and a flexibility indicator based on work in process (the so-called WIP) computed by use of a discrete-event simulation model. The first approach involves a genetic algorithm in order to generate acceptable solutions, from which the best ones are chosen by using a Pareto Sort algorithm. The second approach combines the previous Genetic Algorithm with a multicriteria analysis methodology, i.e., the Electre method in order to find the best solutions. The performances of the two procedures are studied for a large-size problem and a comparison between the procedures is then made
Strategies for multiobjective genetic algorithm development: Application to optimal batch plant design in process systems engineering
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
Multiobjective optimization for multiproduct batch plant design under economic and environmental considerations
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
Optimal design of batch plants under economic and ecological considerations: Application to a biochemical batch plant
This work deals with the multicriteria cost-environment design of multiproduct batch plants, where the design variables are the equipment item sizes 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). 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 considerations, a Multicriteria Genetic Algorithm (MUGA) 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
Ecodesign of Batch Processes: Optimal Design Strategies for Economic and Ecological Bioprocesses
This work deals with the multicriteria cost-environment design of multiproduct batch plants, where the design variables are the equipment item sizes 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). 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 Multicriteria Genetic Algorithm (MUGA) 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
Multiobjective strategies for New Product Development in the pharmaceutical industry
New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems
Multiobjective strategies for New Product Development in the pharmaceutical industry
New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems
Mixed-Integer Nonlinear Programming Optimization Strategies for Batch Plant Design Problems
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
Reversible Action Design for Combinatorial Optimization with Reinforcement Learning
Combinatorial optimization problem (COP) over graphs is a fundamental
challenge in optimization. Reinforcement learning (RL) has recently emerged as
a new framework to tackle these problems and has demonstrated promising
results. However, most RL solutions employ a greedy manner to construct the
solution incrementally, thus inevitably pose unnecessary dependency on action
sequences and need a lot of problem-specific designs. We propose a general RL
framework that not only exhibits state-of-the-art empirical performance but
also generalizes to a variety class of COPs. Specifically, we define state as a
solution to a problem instance and action as a perturbation to this solution.
We utilize graph neural networks (GNN) to extract latent representations for
given problem instances for state-action encoding, and then apply deep
Q-learning to obtain a policy that gradually refines the solution by flipping
or swapping vertex labels. Experiments are conducted on Maximum -Cut and
Traveling Salesman Problem and performance improvement is achieved against a
set of learning-based and heuristic baselines
Multiobjective optimization of New Product Development in the pharmaceutical industry
New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline, namely, the presence of uncertainty, the high level of the involved capital costs, the interdependency between projects, the limited availability of resources, the overwhelming number of decisions due to the length of the time horizon (about 10 years) and the combinatorial nature of a portfolio. Formally, the NPD problem can be stated as follows: select a set of R and D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while copying with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGA II type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. An object-oriented model previously developed for batch plant scheduling and design is then extended to embed the case of new product management, which is particularly adequate for reuse of both structure and logic. Two case studies illustrate and validate the approach. From this simulation study, three performance evaluation criteria must be considered for decision making: the Net Present Value (NPV) of a sequence, its associated risk defined as the number of positive occurrences of NPV among the samples and the time to market. Theyv have been used in the multiobjective optimization formulation of the problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. NSGA II has been adapted to the treated case for taking into account both the number of products in a sequence and the drug release order. From an analysis performed for a representative case study on the different pairs of criteria both for the bi- and tricriteria optimization, the optimization strategy turns out to be efficient and particularly elitist to detect the sequences which can be considered by the decision makers. Only a few sequences are detected. Among theses sequences, large portfolios cause resource queues and delays time to launch and are eliminated by the bicriteria optimization strategy. Small portfolio reduces queuing and time to launch appear as good candidates. The optimization strategy is interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems
- …