scholarly journals Multi-Objective Nonlinear Programming Model for Reducing Octane Number Loss in Gasoline Refining Process Based on Data Mining Technology

Processes ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 721
Author(s):  
Xiao Liu ◽  
Yilai Liu ◽  
Xuejun He ◽  
Min Xiao ◽  
Tao Jiang

To simultaneously reduce automobile exhaust pollution to the environment and satisfy the demand for high-quality gasoline, the treatment of fluid catalytic cracking (FCC) gasoline is urgently needed to minimize octane number (RON) loss. We presented a new systematic method for determining an optimal operation scheme for minimising RON loss and operational risks. Firstly, many data were collected and preprocessed. Then, grey correlative degree analysis and Pearson correlation analysis were used to reduce the dimensionality, and the major variables with representativeness and independence were selected from the 367 variables. Then, the RON and sulfur (S) content were predicted by multiple nonlinear regression. A multi-objective nonlinear optimization model was established with the maximum reduction in RON loss and minimum operational risk as the objective function. Finally, the optimal operation scheme of the operating variable corresponding to the sample with a RON loss reduction greater than 30% in 325 samples was solved in Python.

2020 ◽  
Vol 19 (03) ◽  
pp. 567-587
Author(s):  
Seyedeh Sanaz Mirkhorsandi ◽  
Seyed Hamid Reza Pasandideh

One of the classical models for inventory control is economic production quantity (EPQ), which is widely used in industry. In this paper, an EPQ model with partial shortage is developed by considering the real world conditions, and costs related to the backorder demand are taken as fixed and time-dependent. In the proposed model, determination of the inventory cycle length, the length of positive inventory cycle and backordered demand rate are considered in shortage period. The aim of the presented research is to minimize the total inventory costs and the space required for storage products so that the stochastic and classic constraints including holding costs, lost sales, backorder, budget, total number of productions and average shortage times should be satisfied while optimizing the multi-objective problem. Presented model is a bi-objective nonlinear programming model. Then, to solve the proposed model, three multi-objective decision-making methods including Lp-metric, goal programming and goal attainment are used. Besides, numerical examples are executed in small, medium and large scales by use of GAMS software, and the performance of the methods is compared in terms of objective functions and required CPU time. Finally, sensitivity analysis is done to determine the effect of change in the main parameters of the model on the objective function value.


2014 ◽  
Vol 1073-1076 ◽  
pp. 1669-1672
Author(s):  
Bao Feng Zhao

In order to improve water resource utilization and protect ecological environment in Shendong mining area, make the coal and water resource developed healthy. The multi-objective nonlinear programming model of water resources in mining area was established based on LINGO platform, the optimized configuration of water resource was researched. According to the result of model calculation, based on the optimized configuration of water resource and coal mining in 2012, 2015 and 2020, there are different levels of water shortage. The total water deficit is-526.56、-1189.37 and-1642.30 104m3. According to the actual situation and calculation result, the proposal is put forward in improving the utilization ratio of mining water, water diversion from external and flood utilization. The optimized configuration of water resource in Shendong mining area based on multi-objective nonlinear programming is scientifically, rationally, and plays a guiding role in harmonious development between coal resource exploitation and utilization of water resource.


Author(s):  
Sang-Wook Han ◽  
Eun Hak Lee ◽  
Dong-Kyu Kim

With the rise of urban sprawl, urban railways extend out further to the city’s outer district, installing additional stations. Passengers who travel from the outer district to the center of the city therefore experience long travel times. Although skip-stop strategy helps save total travel time, deviation of travel time among all origin–destination pairs may be increased, leading to equity problems. This study aims to minimize the inequity and total travel time through train stop planning and train scheduling. A coefficient of variation is adopted as a measure of inequity. The problem is formulated as a multi-objective mixed integer nonlinear programming model. Origin–destination demand is extracted from smartcard data and a case study of four urban railway lines in Seoul is conducted. The results indicate that the number of transfer stations for equity-oriented skip-stop strategy is smaller than that for total-travel-time-oriented skip-stop strategy. We also discover that as the number of transfer stations rises, inequity increases and total travel time is reduced. For skip-stop strategy considering total travel time and equity simultaneously, average total travel time and the average deviation are reduced by up to 10.3% and 10.6%, respectively, compared with those of all-stop strategy. We analyze the gradient of Pareto optimal sets to find out which factors (equity or total travel time) are more significant. Skip-stop strategy on lines 5 and 9 can be designed based on equity, while line 4 can be planned based on total travel time.


2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Hongyan Li ◽  
Xianfeng Ding ◽  
Jiang Lin ◽  
Jingyu Zhou

Abstract With the development of economy, more and more people travel by plane. Many airports have added satellite halls to relieve the pressure of insufficient boarding gates in airport terminals. However, the addition of satellite halls will have a certain impact on connecting flights of transit passengers and increase the difficulty of reasonable allocation of flight and gate in airports. Based on the requirements and data of question F of the 2018 postgraduate mathematical contest in modeling, this paper studies the flight-gate allocation of additional satellite halls at airports. Firstly, match the seven types of flights with the ten types of gates. Secondly, considering the number of gates used and the least number of flights not allocated to the gate, and adding the two factors of the overall tension of passengers and the minimum number of passengers who failed to transfer, the multi-objective 0–1 programming model was established. Determine the weight vector $w=(0.112,0.097,0.496,0.395)$ w = ( 0.112 , 0.097 , 0.496 , 0.395 ) of objective function by entropy value method based on personal preference, then the multi-objective 0–1 programming model is transformed into single-objective 0–1 programming model. Finally, a graph coloring algorithm based on parameter adjustment is used to solve the transformed model. The concept of time slice was used to determine the set of time conflicts of flight slots, and the vertex sequences were colored by applying the principle of “first come first serve”. Applying the model and algorithm proposed in this paper, it can be obtained that the average value of the overall tension degree of passengers minimized in question F is 35.179%, the number of flights successfully allocated to the gate maximized is 262, and the number of gates used is minimized to be 60. The corresponding flight-gate difficulty allocation weight is $\alpha =0.32$ α = 0.32 and $\beta =0.40$ β = 0.40 , and the proportion of flights successfully assigned to the gate is 86.469%. The number of passengers who failed to transfer was 642, with a failure rate of 23.337%.


Sign in / Sign up

Export Citation Format

Share Document