# US 2025/0155872 A1 · Multi-objective optimization method and device for catalytic cracking process

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0155872 A1
- Document ID: US20250155872A1
- Status: Published application
- Kind: A1
- Application number: 18/833,310
- Filed: 2023-01-13
- Published: 2025-05-15
- Earliest claimed: 2022-01-25
- Assignees: East China University of Science and Technology
- Applicants: East China University of Science and Technology
- Inventors: Weimin ZHONG; Jian LONG; Wenli DU; Feng QIAN; Minglei YANG
- Web page: https://patentgrep.com/patent/US20250155872A1

## CPC

- G05B 19/4155: characterised by program execution, i.e. part program or machine function execution, e.g. selection of a program
- G05B 2219/32287: Medical, chemical, biological laboratory
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)

## Abstract

The present invention provides a multi-objective optimization method and a device for catalytic cracking process, and a computer-readable storage medium. The multi-objective optimization method comprises following steps: determining a plurality of optimization objectives, a plurality of process decision variables corresponding to the plurality of optimization objectives, and a constraint range of each of the process decision variables; determining an objective function according to the plurality of optimization objectives and the plurality of process decision variables; adjusting a value of each of the process decision variables within the constraint range by SPEA2 algorithm, which improves filial generation evolution process through a path-based reproduction operator, thereby determining an operation data of the objective function on each of the process decision variables; determining an optimization objective value of each of the optimization objectives according to the operation data of each of the process decision variables; and determining the operation data as guide values of the plurality of process decision variables, corresponding to the plurality of optimization objectives, according to an optimal optimization objective value solution set.

## Claims

### Claim 1

A multi-objective optimization method for catalytic cracking process, comprising following steps:
determining a plurality of optimization objectives, a plurality of process decision variables corresponding to the plurality of optimization objectives, and a constraint range of each of the process decision variables;
determining an objective function according to the plurality of optimization objectives and the plurality of process decision variables;
adjusting a value of each of the process decision variables within the constraint range by SPEA2 algorithm, which improves filial generation evolution process through a path-based reproduction operator, thereby determining an operation data of the objective function on each of the process decision variables;
determining an optimization objective value of each of the optimization objectives according to the operation data of each of the process decision variables; and
determining the operation data as guide values of the plurality of process decision variables, corresponding to the plurality of optimization objectives, according to an optimal optimization objective value solution set.

### Claim 2 (depends on 1)

The multi-objective optimization method according to claim 1, wherein steps of adjusting a value of each of the process decision variables within the constraint range by SPEA2 algorithm, which improves filial generation evolution process through a path-based reproduction operator, thereby determining an operation data of the objective function on each of the process decision variables comprise:
S1: initializing an iteration count variable t, a population Pt and a reserve set Pt, wherein initialized population P0 is composed of a set of the plurality of process decision variables when t=0, and initialized reserve set P0 is an empty set;
S2: calculating a fitness degree F(i) of each individual i in the population Pt, wherein each of the individuals i corresponds to one of the process decision variables;
S3: copying the population Pt and all non-dominated solution sets in the reserve set Pt to a reserve set Pt+1, and performing an environmental selection on the reserve set Pt+1;
S4: if iteration count t does not reach a preset upper limit of iteration count T, performing a tournament selection on the reserve set Pt+1 that have undergone the environmental selection, and putting a data set that have undergone the tournament selection into a mating pool;
S5: calculating the data set in the mating pool through the path-based reproduction operator and storing calculation results in the reserve set Pt+1, increasing the iteration count, and returning to the step S2; and
S6: if the iteration count t reaches the upper limit of iteration count T, outputting a process decision variable set A represented by non-dominated solutions in the reserve set Pt+1.

### Claim 3 (depends on 2)

The multi-objective optimization method according to claim 2, wherein steps of calculating a fitness degree F(i) of each individual i in the population Pt comprise:
determining an original fitness value R(i) of the individual i according to an individual quantity S(i) dominated by the individual i, wherein the original fitness value R(i) represents a sum of quantity of all individuals dominated by the individual i and each individual j that dominates the individual i;
calculating a distance from each of the individuals i to each individual in the population Pt and the reserve set Pt, and sorting the distances in an ascending order;
selecting a kth individual as σik, and calculating a corresponding distance value D(i), wherein k=√{square root over (N+N)}, N is a size of the population Pt, and N is a size of the reserve set Pt; and
determining the fitness degree F(i) of the individual i, according to the original fitness value R(i) and the distance value D(i).

### Claim 4 (depends on 3)

The multi-objective optimization method according to claim 3, wherein steps of performing an environmental selection on the reserve set Pt+1 comprise:
comparing an individual quantity in the reserve set Pt+1 with the size N of the reserve set;
if |pt+1|<|N|, selecting first N−|pt+1| individuals from all individuals i in the population Pt and the reserve set Pt according to order of the fitness degree F(i) to form a dominated solution set, and adding it to the reserve set Pt+1; and
if |Pt+1|>|N|, performing a pruning operation, thereby eliminating the individual i with a minimum distance from its adjacent individual in each iteration.

### Claim 5 (depends on 4)

The multi-objective optimization method according to claim 4, wherein step of eliminating the individual i with a minimum distance from its adjacent individual in each iteration comprises:
eliminating one individual i with a minimum distance from its adjacent individual in each of the iterations.

### Claim 6 (depends on 3)

The multi-objective optimization method according to claim 3, wherein steps of calculating the data set in the mating pool through the path-based reproduction operator comprise:
determining a center point Centerg of an offspring population individual in the reserve set Pt+1, and determining a center point Centerg-1 of a parental population individual in the population Pt and the reserve set Pt;
defining a direction of an evolution path ep according to a difference between the individual center points of two generations of populations;
determining a forward moving step α of the evolution path ep according to a target survival rate psucctarget and an actual productive rate psucc of offspring individuals; and
generating corresponding offspring individuals within a rectangular range pointed by a vector α*ep by taking each parental individual as a starting point.

### Claim 7 (depends on 6)

The multi-objective optimization method according to claim 6, wherein steps of calculating the data set in the mating pool through the path-based reproduction operator further comprise:
after generating the offspring individuals, performing a gene sharing operation between at least one excellent parental individual and each of the offspring individuals.

### Claim 8 (depends on 7)

The multi-objective optimization method according to claim 7, wherein before performing the gene sharing operation, the multi-objective optimization method further comprises following steps:
obtaining a number of Pareto front layers or the fitness degree F(i) of each of the parental individuals; and
screening at least one excellent parental individual according to the number of the Pareto front layers or the fitness degree F(i).

### Claim 9 (depends on 2)

The multi-objective optimization method according to claim 2, wherein before determining the operation data as guide values of the plurality of process decision variables, corresponding to the plurality of optimization objectives, according to an optimal optimization objective value solution set, the multi-objective optimization method also comprises a following step:
evaluating each of the optimization objective values according to a Pareto optimal solution set and an IGD index, thereby determining the optimal optimization objective value solution set.

### Claim 10 (depends on 1)

The multi-objective optimization method according to claim 1, wherein the plurality of optimization objectives at least comprise minimizing carbon dioxide emission.

### Claim 11 (depends on 10)

The multi-objective optimization method according to claim 10, wherein the plurality of optimization objectives also comprise at least one of maximizing economic benefit, minimizing sulfur dioxide emission, minimizing total exhaust gas emission, minimizing total waste liquid emission, maximizing main product output, maximizing main product yield, and minimizing input cost.

### Claim 12 (depends on 10)

The multi-objective optimization method according to claim 10, wherein the plurality of process decision variables at least comprise at least one of material flow, material state, material property, main fractionate tower state, main fractionate tower operation, absorption tower state, absorption tower operation, re-absorption tower state, re-absorption tower operation, desorption tower state, desorption tower operation, stabilization tower state, and stabilization tower operation.

### Claim 13 (depends on 10)

The multi-objective optimization method according to claim 10, wherein the plurality of optimization objectives comprise maximizing economic benefit, minimizing carbon dioxide emission and minimizing sulfur dioxide emission, and the objective function is as follows:
min
⁢
imizeF
⁡
(
x
)
=
(
1
/
f
1
,
f
2
,
f
3
)
,
f
1
=
max
⁢
M
=
∑
i
P
i
×
Y
i
-
∑
j
p
j
×
y
j
-
P
f
×
F
-
p
c
×
f
c
,
f
2
=
min
⁢
C
CO
⁢
2
,
f
3
=
min
⁢
C
SO
⁢
2
,
wherein M indicates economic benefit of the catalytic cracking process; Pi indicates price of product i; Yi indicates flow of product i; i indicates products, comprising at least one of sour gas, dry gas, ethylene, liquefied gas, propylene, gasoline, diesel oil, circulating oil, slurry and coke; pj indicates price of raw material j; yj indicates flow of raw material j; j indicates raw materials, including residual oil in tank farm, wax oil in tank farm and refined wax oil; Pf indicates fixed cost per unit processing quantity, F indicates processing load; pc indicates price of fresh catalyst and fc indicates supplement amount of fresh catalyst; CCO2 indicates carbon dioxide emission; CSO2 represents sulfur dioxide emission.

### Claim 14 (depends on 1)

A multi-objective optimization device for catalytic cracking process, comprising:
a memory; and
a processor, connected to the memory and configured to implement the multi-objective optimization method for catalytic cracking process according to claim 1.

### Claim 15 (depends on 1)

A computer-readable storage medium, in which computer instructions are stored, wherein when the computer instructions are executed by a processor, the multi-objective optimization method for catalytic cracking process according to claim 1 is implemented.
