scholarly journals Algorithm and software for the optimal technological design of a system of simple distillation columns

2021 ◽  
Vol 16 (5) ◽  
pp. 379-389
Author(s):  
N. N. Ziyatdinov ◽  
I. I. Emelyanov ◽  
A. A. Ryzhova ◽  
P. S. Chernakov
Keyword(s):  
Optimal Design ◽  
Branch And Bound ◽  
Software Package ◽  
Distillation Column ◽  
Mixed Integer ◽  
Branch And Bound Method ◽  
Simple Distillation ◽  
Technological Design ◽  
Distillation Columns ◽  
Aspen Hysys

Objectives. The formalized problem of the optimal design of distillation column systems belongs to the class of mixed integer nonlinear program problems. Discrete search variables are the number of trays in the rectifying and stripping sections of columns, whereas the continuous ones are the operating modes of columns. This study aimed to develop an algorithm and a software package for the optimal technological design of a system of simple distillation columns based on the criterion of total reduced capital and energy costs using rigorous mathematical distillation models.Methods. The solution to this problem is based on the branch and bound method. A computer model of the distillation column system was developed in the environment of the Aspen Hysys software package. The Inside–Out module was used as the distillation model. The developed algorithm is implemented in the software environment of the Matlab mathematical package. To solve the conditional optimization problem, a sequential quadratic programming method-based model was used. The interaction between software add-ins in Matlab and Aspen Hysys is implemented using a Component Object Model interface.Results. Approaches to obtain the lower and upper bounds of the optimality criterion and the branching method for the implementation of the branch and bound method have been developed. In addition, an algorithm for the optimal design of a distillation column of a given topology based on the branch and bound method has been developed. Furthermore, using Matlab, a software package that implements the developed algorithm and is integrated with the universal modeling software AspenHysys has been created.Conclusions. An algorithm and a software package have been developed and implemented that allows automating the design process of distillation column systems and integration with advanced mathematical programming packages, respectively. The performance of the algorithm and software package has been evaluated using the optimal design of the debutanization column as an example.

scholarly journals Algorithm and mathematical model of supply chain management for raw wood from the regions in Russia: Сomparison and analysis

2020 ◽  
Vol 15 (3) ◽  
pp. 385-404
Author(s):  
Rodion Sergeevich Rogulin ◽  
◽  
Lev Solomonovich Mazelis ◽  
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Supply Chain Management ◽  
Branch And Bound ◽  
Raw Materials ◽  
Mixed Integer ◽  
Branch And Bound Method ◽  
Chain Management ◽  
Industrial Enterprises ◽  
Non Linear

Supply chain management is a burning issue for modern industrial enterprises. To handle this issue, non-linear stochastic models are successfully applied to find the reasonable and efficient solutions. A need to develop a unique method to find the solutions to supply chain management tasks defined as stochastic mixed-integer non-linear programming tasks is determined by the limitations imposed by the general models. The sum of the total raw procurement costs from the Commodity Exchange over the defined planning horizon is taken to be the target function of the unique model, while the binary variables which show whether a purchasing order is included into the procurement plan are used for optimization purposes. Some parameters of model’s limitations are stochastic and consider the uncertainty factor and risks in supplying the required raw materials to the manufacturing site. Branch-and-bound and genetic algorithms are applied at some steps in the developed heuristic algorithm. The algorithm and the model are tested at a major timber processing enterprise in Primorsky Area. Four types of processors over three planning horizons were applied to compare the efficiency of the proposed algorithm with partial application of the genetic algorithm or branch-and-bound method. The findings analysis shows that, unlike the genetic algorithm, the unique one is more stable in terms of uncertainty of the input parameters in comparison with the branch-and-bound method. It provides the solutions in the models with a great number of variables. The algorithm is shown to be universal enough for its further modification in solving more complicated problems of the same class, containing a significantly larger number of probabilistic parameters that describe other uncertainties in the supply of raw materials. Further research is seen to include the development of the proposed algorithm to increase the rate of convergence for its better efficiency.

scholarly journals Mixed-integer nonlinear model for multiproduct inventory systems with interior point and branch-and-bound method

2017 ◽  
Vol 15 (4) ◽  
pp. 744-752 ◽  
Author(s):  
Alvaro Martino Lourencao ◽  
Edmea Cassia Baptista ◽  
Edilaine Martins Soler ◽  
Fernando Bernardi Souza ◽  
Adriana Cristina Cherri
Keyword(s):  
Branch And Bound ◽  
Nonlinear Model ◽  
Interior Point ◽  
Inventory Systems ◽  
Mixed Integer ◽  
Branch And Bound Method

scholarly journals Bandwidth optimization for lane-based traffic signal settings with improved stopping criteria in non-linear TRANSYT delay

2019 ◽  
Vol 272 ◽  
pp. 01049
Author(s):  
C K Wong ◽  
Yi Liu ◽  
Yixin Shen
Keyword(s):  
Branch And Bound ◽  
Traffic Signals ◽  
Traffic Signal ◽  
Mixed Integer ◽  
Branch And Bound Method ◽  
Travel Times ◽  
Stopping Criteria ◽  
Mixed Integer Linear Program ◽  
Bandwidth Optimization ◽  
Traffic Volumes

While assigning given OD demand flows onto network links, travel times along different routes could be varied depending on respective traffic volumes. To achieve equilibrium, all used routes should have the minimum and identical travel times. Such route travel times are composed by link travel times and end of link delay. Upstream and downstream traffic signals are coordinated through bandwidth maximization. Path flows and path travel times are modeled to be responsive to traffic signal settings to enable attractive path choices. Approximated linear function will be established to linearize the end of link delay in TRANSYT model. The problem is formulated as a Binary-Mixed-Integer-Linear-Program and could be solved by standard branch-and-bound method.

Optimal Distributed Generator Allocation in Active Distribution Network Considering Reconfiguration

2014 ◽  
Vol 672-674 ◽  
pp. 1117-1122
Author(s):  
Yu De Yang ◽  
Hong Bo Xie
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Branch And Bound ◽  
Distribution Network ◽  
Mixed Integer ◽  
Branch And Bound Method ◽  
Allocation Model ◽  
Distributed Generator ◽  
Active Distribution Network ◽  
Planning And Operation

For the structure of active distribution network can flexibly adjust, an optimal distributed generator allocation model considering reconfiguration is proposed. This model is implemented in the GAMS software and solved using SBB solver based on branch and bound method, due to it is a 0-1 nonlinear mixed integer programming. IEEE 33 standard example is used to simulate for this model. Results show that reconfiguration can increase the capacity of absorbing DG, providing thoughts and guidance for confirming the capacity of DG, and for planning and operation of active distribution network.

Sign in / Sign up

Export Citation Format

Share Document