Optimization of VARICOL SMB processes using hybrid modeling and nonlinear programming
•The VARICOL process is represented by a hybrid model.•The discrete-time dynamics is described by a timed transition Petri net.•The hybrid representation considerably simplifies the optimization of the VARICOL productivity.•The optimum productivity can be as high as twice the productivity of a conve...
Saved in:
| Published in: | Computers & chemical engineering Vol. 71; pp. 1 - 10 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Kidlington
Elsevier Ltd
04.12.2014
Elsevier |
| Subjects: | |
| ISSN: | 0098-1354, 1873-4375 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | •The VARICOL process is represented by a hybrid model.•The discrete-time dynamics is described by a timed transition Petri net.•The hybrid representation considerably simplifies the optimization of the VARICOL productivity.•The optimum productivity can be as high as twice the productivity of a conventional SMB process.
The Varicol process exhibits continuous and discrete-time dynamics and can be represented by a hybrid model, where the continuous-time dynamics is described by mass-balance partial differential equations, whereas the discrete-time dynamics is described by a timed transition Petri net (TTPN). This hybrid model allows to simplify the solution of a normally difficult Mixed-Integer Non-Linear Programming problem for maximizing the productivity of a Varicol process subject to constraints on the desired purities of the extract and the raffinate components. Indeed, the coverability tree of the TTPN can be constructed to generate a set of candidate integer parameters, and the corresponding nonlinear problems are solved for a subset of candidates selected on the basis of an approximate evaluation using the (true moving bed) triangle theory. The optimal solution is the Varicol configuration (column sequence) for which the productivity is maximal. A repeatability and a robustness analysis show the feasibility of this approach. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0098-1354 1873-4375 |
| DOI: | 10.1016/j.compchemeng.2014.07.009 |