化工过程系统工程专论-2010
合集下载
相关主题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
化工过程系统工程专论
硕士研究生先修课程（32学时） 2010-11
In this course -- General concept -- Algorithmic methods for process synthesis • Concepts • Optimization technique: MINLP • Process synthesis
benefit
benefit
reflux ratio
reflux ratio optimum
• Process Optimization
-- trade-off
Example of heat preservation by coating
total cost
Cost efficiency : - raw material - capital - energy cost - etc. Environmental impact : - economics - ecology
4.3 ABCD/E
2.6 A/BC 5.4 AB/C 9.1 A/BCD 14.6 AB/CD 3.7 ABC/D
9.3 B/CD 1.3 BC/D 2.6 A/BC 5.4 AB/C
定义：
• 根节点、中间节点、末端节点、路径、子节点、父节点 • 局部费用：任意一个节点本身的费用 • 部分费用：由根节点到任意一个节点路径上全部节点费用之和称 为这个节点的部分费用
10.4 ABC/DE
4.3 ABCD/E
2.6 A/BC 5.4 AB/C 9.1 A/BCD 14.6 AB/CD 3.7 ABC/D
9.3 B/CD 1.3 BC/D 2.6 A/BC 5.4 AB/C
2 利用剩余气相流率判别最优序列
——分支定界法（Branch-and-Bound）
部分费用 局部费用
Rules:
- Depth-first : less storage, more nodes to evaluate - Breadth-first : fewer nodes examined yet more storage needed
2 利用剩余气相流率判别最优序列
——分支定界法（Branch-and-Bound）
2. Problem representation
• General strategies for process synthesis
– Analysis and targeting – Superstructure
• Different representation may lead to different approach to problem solution
部分费用 局部费用
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
18.6 AB/CDE ABCDE
根节点
中间节点
Profitable line
competition area
margin for
Engineering
Decision variables
Process Optimization
An example of distillation
Measurement of money
-- market driven
12.3 A/BCDE 18.6 AB/CDE ABCDE 6.7 C/DE 2.0 CD/E
10.4 ABC/DE 4.3 ABCD/E
2.6 A/BC 13.0 5.4 AB/C
2.6 A/BC 10.6
5.4 AB/C
分支定界法 -- 广度优先法
•从根节点开始 •选择局部费用值最小的子节点评价局部费用(子节点局部费用的累加) •当一个节点的所有子节点全部累加完毕, 再回到其父节点 •任何一个节点, 若其部分费用不小于上界值, 则删除该节点及其所有子节点 13.3 B/CDE 8.0 BC/DE 2.8 BCD/E 6.7 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D 9.3 B/CD 13.4 9.1 A/BCD 14.6 AB/CD 3.7 ABC/D 1.3 BC/D
12.3 A/BCDE 18.6 AB/CDE ABCDE 6.7 C/DE 2.0 CD/E
10.4 ABC/DE 4.3 ABCD/E
2.6 A/BC 5.4 AB/C
2.6 A/BC 10.6
5.4 AB/C
Models and solution strategies for network representation
• Integrations among variables -- coupling
– Multi-variables
• Solution of optimization problems -combinatorial problems
Summary • Process synthesis -- central issue • Process Optimization -- trade-off • Objectives – mono- or multi• Integrations among variables -- coupling • Solution of optimization problems: combinatorial problems
-- Simultaneous solution
Net work representation:
- binary variable : yi =
1 0
if unit i is selected if unit i is not selected
- continuous variables x
Problem formulation: - Mixed-integer Nonlinear Programming (MINLP) (P) Min f(x, y) h(x, y) = 0 g(x, y) 0 xX, y Y
– Problem representation – Modeling – Solution strategies
• Examples
1. Introduction
General concept • Process synthesis -- central issue • Process Optimization -- trade-off • Objectives – mono- or multi• Integrations among variables -- coupling • Solution of optimization problems -combinatorial problems
• 总费用：末端节点的部分费用成为该节点的总费用
部分费用 局部费用
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
根节点
18.6 AB/CDE
中间节点
ABCDE
分支定界法 -- 深度优先法
•从根节点开始 •按照子节点的顺序评价局部费用(子节点局部费用的累加) •当一个节点的所有子节点全部累加完毕, 再回到其父节点 •任何一个节点, 若其部分费用不小于上界值, 则删除该节点及其所有子节点 13.3 25.6 B/CDE 8.0 BC/DE 20.3 2.8 BCD/E 15.1 6.7 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D 9.3 B/CD 9.1 A/BCD 14.6 AB/CD 3.7 8.0 ABC/D 1.3 BC/D 32.3 27.6 24.4 16.4
Still -- market oriented
market driven --
cost
-- Regulation
-- Social responsibility,
Ethics …
Pareto
environmental impact
About problem of CO2 emission, see Nature 458 | Published online 29 April 2009
Properties: - an intermediate node gives a partial cost of a structure: a lower bound on the cost of the structure - a terminal node gives the cost of a particular structure: an upper bound to the problem
A B C D
A B C A B C C D
A B C D
A B C D A B C D A B C D
A B C A B C
B C
Network representation of four-component separation
A B
Solution strategies for tree representation -- Branch-and-Bound
– if any of f, h and g keeps nonlinear and y is constant (no longer variable)
• MILP (Mixed-integer Linear Programming )
Example
Four-component separation process
A B C D
A B C D A B C D A B C D B C D B C D
B C D B C D
C D B C Tree representation of four-component separation B C A B
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
18.6 AB/CDE ABCDE
根节点
中间节点
10.4 ABC/DE
根节点
18.6 AB/CDE
中间节点
ABCDE
特性：
• 任一中间节点部分费用是其子节点部分费用的下界 • 一个末端节点的总费用是最优费用的上界
部分费用 局部费用
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
cost
preservation coat thickness
• Objectives – mono- or multi– Cost efficiency : trade-off between raw material, capital, and energy cost – Environmental impact : trade-off between economics and ecology
• Process synthesis -- central issue
– HEN, Dist. sequence, Reactor networks etc. – Process integration Market orientation
criteria
thห้องสมุดไป่ตู้ state of the art Technology
For problem (P)
• LP (Linear Programming )
– if the functions f, h and g are linear and y is constant (no longer variable)
Difficultness
• NLP (Nonlinear Programming )
硕士研究生先修课程（32学时） 2010-11
In this course -- General concept -- Algorithmic methods for process synthesis • Concepts • Optimization technique: MINLP • Process synthesis
benefit
benefit
reflux ratio
reflux ratio optimum
• Process Optimization
-- trade-off
Example of heat preservation by coating
total cost
Cost efficiency : - raw material - capital - energy cost - etc. Environmental impact : - economics - ecology
4.3 ABCD/E
2.6 A/BC 5.4 AB/C 9.1 A/BCD 14.6 AB/CD 3.7 ABC/D
9.3 B/CD 1.3 BC/D 2.6 A/BC 5.4 AB/C
定义：
• 根节点、中间节点、末端节点、路径、子节点、父节点 • 局部费用：任意一个节点本身的费用 • 部分费用：由根节点到任意一个节点路径上全部节点费用之和称 为这个节点的部分费用
10.4 ABC/DE
4.3 ABCD/E
2.6 A/BC 5.4 AB/C 9.1 A/BCD 14.6 AB/CD 3.7 ABC/D
9.3 B/CD 1.3 BC/D 2.6 A/BC 5.4 AB/C
2 利用剩余气相流率判别最优序列
——分支定界法（Branch-and-Bound）
部分费用 局部费用
Rules:
- Depth-first : less storage, more nodes to evaluate - Breadth-first : fewer nodes examined yet more storage needed
2 利用剩余气相流率判别最优序列
——分支定界法（Branch-and-Bound）
2. Problem representation
• General strategies for process synthesis
– Analysis and targeting – Superstructure
• Different representation may lead to different approach to problem solution
部分费用 局部费用
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
18.6 AB/CDE ABCDE
根节点
中间节点
Profitable line
competition area
margin for
Engineering
Decision variables
Process Optimization
An example of distillation
Measurement of money
-- market driven
12.3 A/BCDE 18.6 AB/CDE ABCDE 6.7 C/DE 2.0 CD/E
10.4 ABC/DE 4.3 ABCD/E
2.6 A/BC 13.0 5.4 AB/C
2.6 A/BC 10.6
5.4 AB/C
分支定界法 -- 广度优先法
•从根节点开始 •选择局部费用值最小的子节点评价局部费用(子节点局部费用的累加) •当一个节点的所有子节点全部累加完毕, 再回到其父节点 •任何一个节点, 若其部分费用不小于上界值, 则删除该节点及其所有子节点 13.3 B/CDE 8.0 BC/DE 2.8 BCD/E 6.7 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D 9.3 B/CD 13.4 9.1 A/BCD 14.6 AB/CD 3.7 ABC/D 1.3 BC/D
12.3 A/BCDE 18.6 AB/CDE ABCDE 6.7 C/DE 2.0 CD/E
10.4 ABC/DE 4.3 ABCD/E
2.6 A/BC 5.4 AB/C
2.6 A/BC 10.6
5.4 AB/C
Models and solution strategies for network representation
• Integrations among variables -- coupling
– Multi-variables
• Solution of optimization problems -combinatorial problems
Summary • Process synthesis -- central issue • Process Optimization -- trade-off • Objectives – mono- or multi• Integrations among variables -- coupling • Solution of optimization problems: combinatorial problems
-- Simultaneous solution
Net work representation:
- binary variable : yi =
1 0
if unit i is selected if unit i is not selected
- continuous variables x
Problem formulation: - Mixed-integer Nonlinear Programming (MINLP) (P) Min f(x, y) h(x, y) = 0 g(x, y) 0 xX, y Y
– Problem representation – Modeling – Solution strategies
• Examples
1. Introduction
General concept • Process synthesis -- central issue • Process Optimization -- trade-off • Objectives – mono- or multi• Integrations among variables -- coupling • Solution of optimization problems -combinatorial problems
• 总费用：末端节点的部分费用成为该节点的总费用
部分费用 局部费用
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
根节点
18.6 AB/CDE
中间节点
ABCDE
分支定界法 -- 深度优先法
•从根节点开始 •按照子节点的顺序评价局部费用(子节点局部费用的累加) •当一个节点的所有子节点全部累加完毕, 再回到其父节点 •任何一个节点, 若其部分费用不小于上界值, 则删除该节点及其所有子节点 13.3 25.6 B/CDE 8.0 BC/DE 20.3 2.8 BCD/E 15.1 6.7 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D 9.3 B/CD 9.1 A/BCD 14.6 AB/CD 3.7 8.0 ABC/D 1.3 BC/D 32.3 27.6 24.4 16.4
Still -- market oriented
market driven --
cost
-- Regulation
-- Social responsibility,
Ethics …
Pareto
environmental impact
About problem of CO2 emission, see Nature 458 | Published online 29 April 2009
Properties: - an intermediate node gives a partial cost of a structure: a lower bound on the cost of the structure - a terminal node gives the cost of a particular structure: an upper bound to the problem
A B C D
A B C A B C C D
A B C D
A B C D A B C D A B C D
A B C A B C
B C
Network representation of four-component separation
A B
Solution strategies for tree representation -- Branch-and-Bound
– if any of f, h and g keeps nonlinear and y is constant (no longer variable)
• MILP (Mixed-integer Linear Programming )
Example
Four-component separation process
A B C D
A B C D A B C D A B C D B C D B C D
B C D B C D
C D B C Tree representation of four-component separation B C A B
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
6.7 32.3 C/DE 2.0 CD/E 9.3 B/CD 1.3 BC/D
末端节点 总费用
18.6 AB/CDE ABCDE
根节点
中间节点
10.4 ABC/DE
根节点
18.6 AB/CDE
中间节点
ABCDE
特性：
• 任一中间节点部分费用是其子节点部分费用的下界 • 一个末端节点的总费用是最优费用的上界
部分费用 局部费用
12.3 12.3 A/BCDE 6.7 C/DE 2.0 CD/E
13.3 25.6 B/CDE 8.0 BC/DE 2.8 BCD/E
cost
preservation coat thickness
• Objectives – mono- or multi– Cost efficiency : trade-off between raw material, capital, and energy cost – Environmental impact : trade-off between economics and ecology
• Process synthesis -- central issue
– HEN, Dist. sequence, Reactor networks etc. – Process integration Market orientation
criteria
thห้องสมุดไป่ตู้ state of the art Technology
For problem (P)
• LP (Linear Programming )
– if the functions f, h and g are linear and y is constant (no longer variable)
Difficultness
• NLP (Nonlinear Programming )