Isothermal Reactor Network Synthesis Using Coupled NonDominated Sorting Genetic Algorithm-II (NSGAII) with Quasi Linear Programming (LP) Method

نویسندگان

  • Hadi Soltani a Faculty of Chemical Engineering, Sahand University of Technology b Environmental Engineering Research Center (EERC), Sahand University of Technology, Tabriz, Iran
  • Sirous Shafiei a Faculty of Chemical Engineering, Sahand University of Technology b Environmental Engineering Research Center (EERC), Sahand University of Technology, Tabriz, Iran
چکیده مقاله:

In this study a new and robust procedure is presented to solve synthesis of isothermal reactor networks (RNs) which considers more than one objective function. This method uses non-dominated sorting genetic algorithm II (NSGAII) to produce structural modification coupled with quasi linear programming (LP) method for handling continuous variables. The quasi LP consists of an LP by adding a search loop to find the best reactor conversions as well as split and recycle ratios which are much easier to solve. To prevent complexity and ensure optimum solution, only ideal continuous stirred tank reactors (CSTRs), plug flow reactors (PFRs) and PFR with recycle stream are considered in producing reactor networks. Also, to avoid differential equations which appear in design equations of PFR reactors, CSTRs in series are replaced for each PFR. Results show that the proposed method finds better solutions than those reported in the literature.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II

The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...

متن کامل

An Efficient Coupled Genetic Algorithm-NLP Method for Heat Exchanger Network Synthesis

Synthesis of heat exchanger networks (HENs) is inherently a mixed integer and nonlinear programming (MINLP) problem. Solving such problems leads to difficulties <span style="font-size: 10pt; color: #00...

متن کامل

An Improved Nondominated Sorting Algorithm

This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with m objective functions, using n solutions in the population, the original nondominated sorting algorithm, used ...

متن کامل

An Improved Nondominated Sorting Multiobjective Genetic Algorithm and Its Application

The nondominated sorting genetic algorithm with elitism (NSGA-II) is widely used due to its good performance on solving multiobjective optimization problems. In each iteration of NSGA-II, truncation selection is performed based on the rank and crowding distance of each solution. There are, however, drawbacks in this process. These drawbacks to some extent cause overlapping solutions in the popu...

متن کامل

A Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...

متن کامل

A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 12  شماره 3

صفحات  77- 95

تاریخ انتشار 2015-07-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023