arrow
返回

Harvest time prediction for batch processes

delete2018-09-01
delete9
delete
OA
AI
M
Max Spooner *
D
David Kold
M
Murat Külahçı
DOI:10.1016/j.compchemeng.2018.05.019delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Batch processes usually exhibit variation in the time at which individual batches are stopped (referred to as the harvest time). Harvest time is based on the occurrence of some criterion and there may be great uncertainty as to when this criterion will be satisfied. This uncertainty increases the difficulty of scheduling downstream operations and results in fewer completed batches per day. A real case study is presented of a bacteria fermentation process. We consider the problem of predicting the harvest time of a batch in advance to reduce variation and improving batch quality. Lasso regression is used to obtain an interpretable model for predicting the harvest time at an early stage in the batch. A novel method for updating the harvest time predictions as a batch progresses is presented, based on information obtained from online alignment using dynamic time warping. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Batch process
Prediction
Dynamic time warping
Partial least squares
Lasso regression
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Chemical Engineering
IF:
3.9
论文数:
8.1K
被引数:
1.7W

机构

C
chr hansen
学者数:
255
论文数: 177
被引数: 1
T
technical university of denmark
学者数:
2.6W
论文数: 2.8W
被引数: 37