10,068 research outputs found
Performance Analysis of Optimization Methods in PSE Applications. Mathematical Programming Versus Grid-based Multi-parametric Genetic Algorithms
Due to their large variety of applications in the PSE area, complex optimisation problems are of high interest for the scientific community. As a consequence, a great effort is made for developing efficient solution techniques. The choice of the relevant technique for the treatment of a given problem has already been studied for batch plant design issues. However,most works reported in the dedicated literature classically considered item sizes as continuous variables. In a view of realism, a similar approach is proposed in this paper, with discrete variables representing equipment capacities. The numerical results enable to evaluate the performances of two mathematical programming (MP) solvers embedded within the GAMS package and a genetic algorithm (GA), on a set of seven increasing complexity examples. The necessarily huge number of runs for the GA could be performed within a computational framework basedon a grid infrastructure; however, since the MP methods were tackled through single-computer computations, the CPU time comparison are reported for this one-PC working mode. On the one hand, the high combinatorial effect induced by the new discrete variables heavily penalizes the GAMS modules, DICOPTþþand SBB. On the other hand, the Genetic Algorithm proves its superiority, providing quality solutions within acceptable computational times, whatever the considered example
Global supply chains of high value low volume products
Imperial Users onl
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
Bütünleşik tedarik zinciri çizelgeleme modelleri: Bir literatür taraması
Research on integration of supply chain and scheduling is relatively recent, and
number of studies on this topic is increasing. This study provides a comprehensive
literature survey about Integrated Supply Chain Scheduling (ISCS) models to help
identify deficiencies in this area. For this purpose, it is thought that this study will
contribute in terms of guiding researchers working in this field. In this study,
existing literature on ISCS problems are reviewed and summarized by introducing
the new classification scheme. The studies were categorized by considering the
features such as the number of customers (single or multiple), product lifespan
(limited or unlimited), order sizes (equal or general), vehicle characteristics
(limited/sufficient and homogeneous/heterogeneous), machine configurations and
number of objective function (single or multi objective). In addition, properties of
mathematical models applied for problems and solution approaches are also
discussed.Bütünleşik Tedarik Zinciri Çizelgeleme (BTZÇ) üzerine yapılan araştırmalar
nispeten yenidir ve bu konu üzerine yapılan çalışma sayısı artmaktadır. Bu çalışma,
bu alandaki eksiklikleri tespit etmeye yardımcı olmak için BTZÇ modelleri hakkında
kapsamlı bir literatür araştırması sunmaktadır. Bu amaçla, bu çalışmanın bu alanda
çalışan araştırmacılara rehberlik etmesi açısından katkı sağlayacağı
düşünülmektedir. Bu çalışmada, BTZÇ problemleri üzerine mevcut literatür gözden
geçirilmiş ve yeni sınıflandırma şeması tanıtılarak çalışmalar özetlenmiştir.
Çalışmalar; tek veya çoklu müşteri sayısı, sipariş büyüklüğü tipi (eşit veya genel),
ürün ömrü (sınırlı veya sınırsız), araç karakteristikleri (sınırlı/yeterli ve
homojen/heterojen), makine konfigürasyonları ve amaç fonksiyonu sayısı (tek veya
çok amaçlı) gibi özellikler dikkate alınarak kategorize edildi. Ayrıca problemler için
uygulanan matematiksel modellerin özellikleri ve çözüm yaklaşımları da
tartışılmıştır
Wastewater minimization in multipurpose batch processes using mathematical modelling
A dissertation submitted to the Faculty of Engineering and the Built Environment,
University of the Witwatersrand, in fulfillment of the requirements for the degree
of Master of Science in Engineering
May 2018The increase in the degradation of water sources and stringent environmental regulations have greatly motivated industries to explore means of utilizing water efficiently. Batch processes are known to generate highly contaminated wastewater that is toxic to the environment. A holistic approach to design which emphasizes the unity of the process, process integration (PI), can be used to reduce both the wastewater generated and the level of contamination while maintaining the profitability of the chemical plant. Process integration techniques for wastewater minimization in batch processes include water reuse, recycle and regeneration.
Most mathematical formulations for wastewater minimization in multipurpose batch processes presented in literature determine the amount of water required for washing operations by only looking at the task that has just occurred in a unit. However, the nature of the succeeding task can influence the amount of water required for the washing operation between consecutive tasks in a processing unit. In paint manufacturing, for example, more water will be required for the washing operation if the production of white paint follows the production of black paint and less water will be required if the black paint follows the white paint. The amount of wastewater generated in batch processes can, therefore, be reduced by simply synthesizing a sequence of tasks that will generate the least amount of wastewater. Presented in this work are wastewater minimization formulations for multipurpose batch processes which explore sequence dependent changeover opportunities for water minimization simultaneously with direct and indirect water reuse and recycle opportunities.
The presence of continuous and integer variables, as well as bilinear terms, rendered the model a Mixed Integer Nonlinear Program (MINLP). The developed MINLP model was validated using two single contaminant illustrative examples and a multiple contaminant example. A global optimization solver, Branch and Reduce Optimization Navigator (BARON), was used to solve the optimization problems on a General Algebraic Modeling System (GAMS) platform. Exploring multiple water saving opportunities simultaneously has proven to be computationally intensive but can result in significant water savings. For instance, two different scenarios saved 65% and 61% in freshwater use respectively.MT 201
A Framework for Globally Optimizing Mixed-Integer Signomial Programs
Mixed-integer signomial optimization problems have broad applicability in engineering. Extending the Global Mixed-Integer Quadratic Optimizer, GloMIQO (Misener, Floudas in J. Glob. Optim., 2012. doi:10.1007/s10898-012-9874-7), this manuscript documents a computational framework for deterministically addressing mixed-integer signomial optimization problems to ε-global optimality. This framework generalizes the GloMIQO strategies of (1) reformulating user input, (2) detecting special mathematical structure, and (3) globally optimizing the mixed-integer nonconvex program. Novel contributions of this paper include: flattening an expression tree towards term-based data structures; introducing additional nonconvex terms to interlink expressions; integrating a dynamic implementation of the reformulation-linearization technique into the branch-and-cut tree; designing term-based underestimators that specialize relaxation strategies according to variable bounds in the current tree node. Computational results are presented along with comparison of the computational framework to several state-of-the-art solvers. © 2013 Springer Science+Business Media New York
Optimal Solutions of Multiproduct Batch Chemical Process Using Multiobjective Genetic Algorithm with Expert Decision System
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
- …