Recipe‐free synthesis of optimal operation trajectories for batch processes based on process models

Batch processes are usually operated following recipes, which are based on experience and expert knowledge. This ensures feasible and safe operation, because process constraints are indirectly included in the recipe. However, the recipe structure itself constrains the solution space and might exclude other more efficient trajectories. Therefore, the hidden constraints are explicitly formulated, and the arising optimization problem is solved without using prior knowledge in the form of recipes. Case studies are performed on rigorous models of a batch reactor and a batch distillation column. It is demonstrated that the optimization problem formulated as a smoothed dynamic nonlinear programming problem outperforms a mixed-integer formulation. Finally, a multi-objective case is investigated that strongly outperforms a recipe-based benchmark.

Authors

Publication Details

Journal
DepositOnce
Published
2025-09-23
DOI
https://doi.org/10.14279/depositonce-24501
Primary Topic
Process Optimization and Integration
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Recipe‐free synthesis of optimal operation trajectories for batch processes based on process models

Jens‐Uwe Repke, Torben Talis, Marie Pfafferott, Erik Esche
DepositOnce
Process Optimization and Integration
article

Recipe‐free synthesis of optimal operation trajectories for batch processes based on process models

Jens‐Uwe Repke, Torben Talis, Marie Pfafferott, Erik Esche
article en

Abstract

Batch processes are usually operated following recipes, which are based on experience and expert knowledge. This ensures feasible and safe operation, because process constraints are indirectly included in the recipe. However, the recipe structure itself constrains the solution space and might exclude other more efficient trajectories. Therefore, the hidden constraints are explicitly formulated, and the arising optimization problem is solved without using prior knowledge in the form of recipes. Case studies are performed on rigorous models of a batch reactor and a batch distillation column. It is demonstrated that the optimization problem formulated as a smoothed dynamic nonlinear programming problem outperforms a mixed-integer formulation. Finally, a multi-objective case is investigated that strongly outperforms a recipe-based benchmark.

DepositOnce
Openalex Percentile: Top 33%
Process Optimization and Integration
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.