Misagh Rahbari, Alireza Arshadi Khamseh, Mohammad Mohammadi
{"title":"A multi-objective robust scenario-based stochastic chance constrained programming model for sustainable closed-loop agri-food supply chain","authors":"Misagh Rahbari, Alireza Arshadi Khamseh, Mohammad Mohammadi","doi":"10.1016/j.compchemeng.2024.108914","DOIUrl":"10.1016/j.compchemeng.2024.108914","url":null,"abstract":"<div><div>The agri-food supply chain management plays a crucial role in ensuring the interests of supply chain components and food security in society. Additionally, due to the nature of agri-food products, sustainability dimensions have always been of concern to organizations engaged in this field. The importance of the timely and quality provision of agri-food products has doubled after the global crisis. Therefore, this study focuses on optimizing and analyzing the sustainable multi-objective closed-loop supply chain network for agri-food products, with a case study on the canned food under uncertainty. Strategic and operational decisions and other features are considered to achieve more accurate results. To address the various dimensions of sustainability, the problem is considered as a four-objective one, aiming to maximize the use of available production throughput for factories, maximize job opportunities created, minimize supply chain costs, and ultimately minimize unmet demands. The carbon cap and trade mechanism is used to control greenhouse gas emissions in the supply chain network. A robust scenario-based stochastic chance constrained programming approach is employed to deal with the uncertainty, and also validation is performed using various criteria. Moreover, an augmented ε-constraint optimization approach is used to solve the multi-objective problem and achieve Pareto optimal solutions. Finally, sensitivity analysis is employed to prepare for potential changes in some problem parameters.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 108914"},"PeriodicalIF":3.9,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142747135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An optimization approach for sustainable and resilient closed-loop floating solar photovoltaic supply chain network design","authors":"Maryam Nili , Mohammad Saeed Jabalameli , Armin Jabbarzadeh , Ehsan Dehghani","doi":"10.1016/j.compchemeng.2024.108927","DOIUrl":"10.1016/j.compchemeng.2024.108927","url":null,"abstract":"<div><div>Growing energy demand and its consequences, such as fossil fuel depletion, greenhouse gas emissions, and global warming, prompted the need for large-scale solar power plants. Floating photovoltaic systems have many advantages over ground-mounted systems, including methods and resources, reducing costs, and improving efficiency. In this regard, this study aims at presenting an optimization model for developing a sustainable and resilient floating solar photovoltaic supply chain network design. The concerned model's objective function is minimizing the total supply chain costs in addition to maximizing greenhouse gas emissions reduction. To identify the most suitable dams for establishing the floating photovoltaic system, the hybrid approach by applying the fuzzy best-worst method and the TOPSIS technique is first exploited. Thereinafter, the selected dams are exerted in the presented mathematical model. Eventually, a real case study is implemented on floating photovoltaic systems to assess the proposed model's performance, from which important managerial insights are attained.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108927"},"PeriodicalIF":3.9,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dominic Bui Viet, Gustavo Fimbres Weihs, Gobinath Rajarathnam, Ali Abbas
{"title":"Highly accelerated kinetic Monte Carlo models for depolymerisation systems","authors":"Dominic Bui Viet, Gustavo Fimbres Weihs, Gobinath Rajarathnam, Ali Abbas","doi":"10.1016/j.compchemeng.2024.108945","DOIUrl":"10.1016/j.compchemeng.2024.108945","url":null,"abstract":"<div><div>Kinetic Monte Carlo (kMC) models are a well-established modelling framework for the simulation of complex free-radical kinetic systems. kMC models offer the advantage of discretely monitoring every chain sequence in the system, providing full accounting of the chain molecular weight distribution. These models are marred by the necessity to simulate a minimum number of molecules, which confers significant computational burden. This paper adapts and creates a highly generalizable methodology for scaling dilute radical populations in discrete stochastic models, such as Gillespie's Stochastic Simulation Algorithm (SSA). The methodology is then applied to a kMC simulation of polystyrene (PS) pyrolysis, using a modelling framework adapted from literature. The results show that the required number of simulated molecules can be successfully reduced by up to three orders of magnitude with minimal loss of convergent behaviour, corresponding to a wall-clock simulation speed reduction of between 95.2 to 99.6 % at common pyrolysis temperatures.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108945"},"PeriodicalIF":3.9,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tobias Hülser , Bjarne Kreitz , C. Franklin Goldsmith , Sebastian Matera
{"title":"Multilevel on-the-fly sparse grids for coupling coarse-grained and high fidelity models in heterogeneous catalysis","authors":"Tobias Hülser , Bjarne Kreitz , C. Franklin Goldsmith , Sebastian Matera","doi":"10.1016/j.compchemeng.2024.108922","DOIUrl":"10.1016/j.compchemeng.2024.108922","url":null,"abstract":"<div><div>Coupling microscopic high-fidelity models, such as microkinetic models, into continuum scale simulations can easily become intractable in practice due to the costs of the high-fidelity model evaluation. To lift this burden, we present a novel multilevel self-consistent on-the-fly sparse grid approach, which integrates the construction of surrogates of the high-fidelity model in a multilevel fashion into the continuum solution process. Besides its efficiency, an appealing feature of the approach is its simplicity and robustness. A single hyperparameter controls the whole workflow, from training set design to the accuracy of the reactor model. We demonstrate the methodology on a recent microkinetic model for catalytic combustion in a fixed-bed reactor model as a representative example. Already with modest numbers of data, the approach achieves sufficient accuracy, reducing the effort by orders of magnitude compared to a direct coupling.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 108922"},"PeriodicalIF":3.9,"publicationDate":"2024-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142747017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jiannan Zhu , Chen Fan , Minglei Yang , Feng Qian , Vladimir Mahalec
{"title":"A semi-supervised learning algorithm for high and low-frequency variable imbalances in industrial data","authors":"Jiannan Zhu , Chen Fan , Minglei Yang , Feng Qian , Vladimir Mahalec","doi":"10.1016/j.compchemeng.2024.108933","DOIUrl":"10.1016/j.compchemeng.2024.108933","url":null,"abstract":"<div><div>This work introduces a semi-supervised learning algorithm to estimate missing data for processes where measured data is comprised of variables that are measured at high frequency and low frequency. A semi-supervised learning algorithm named “Weight-Adjusted Consistency Regularization Algorithm for Semi-Supervised Learning” (WACR-SSL) based on consistency regularization is proposed. The algorithm splits the irregular unbalanced data set into three parts and processes them separately. To address the loss balancing problem, five loss balancing methods have been tested: Uncertainty Weights (UW), Random Loss Weighting (RLW), Dynamic Weight Average (DWA), Geometric Loss Strategy (GLS) and the logarithmic transformation (LogT). When applied to data from a hydrocracking process, the algorithm effectively leverages partially labeled data. With carefully chosen noise scales and the coefficient for the unsupervised loss, the uncertainty weight (UW) variant performs the best when compared to the other loss balancing methods.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108933"},"PeriodicalIF":3.9,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extracting key temporal and cyclic features from VIT data to predict lithium-ion battery knee points using attention mechanisms","authors":"Jaewook Lee , Seongmin Heo , Jay H. Lee","doi":"10.1016/j.compchemeng.2024.108931","DOIUrl":"10.1016/j.compchemeng.2024.108931","url":null,"abstract":"<div><div>Accurate prediction of lithium-ion battery lifespan is crucial for mitigating risks, as battery cycling experiments are time-consuming and costly. Despite this, few studies have effectively leveraged cycling data with minimal information loss and optimized input size. To bridge this gap, we propose three models that integrate attention layers into a foundational model. Temporal attention helps address the vanishing gradient problem inherent in recurrent neural networks, enabling a manageable input size for subsequent networks. Self-attention applied to context vectors, termed cyclic attention, allows models to efficiently identify key cycles that capture the majority of information across cycles, strategically reducing input size. By employing multi-head attention, required input size is reduced from 100 to 30 cycles, significant reduction than single-head approaches, as each head accentuates distinct key cycles from various perspectives. Our enhanced model shows a 39.6 % improvement in regression performance using only the first 30 cycles, significantly advancing our previous method.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108931"},"PeriodicalIF":3.9,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142759818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Luisa Peterson , Ion Victor Gosea , Peter Benner , Kai Sundmacher
{"title":"Digital twins in process engineering: An overview on computational and numerical methods","authors":"Luisa Peterson , Ion Victor Gosea , Peter Benner , Kai Sundmacher","doi":"10.1016/j.compchemeng.2024.108917","DOIUrl":"10.1016/j.compchemeng.2024.108917","url":null,"abstract":"<div><div>A digital twin (DT) is an automation strategy that combines a physical plant with an adaptive real-time simulation environment, where both are connected by bidirectional communication. In process engineering, DTs promise real-time monitoring, prediction of future conditions, predictive maintenance, process optimization, and control. However, the full implementation of DTs often fails in reality. To address this issue, we first examine various definitions of DTs and its core components, followed by a review of its current applications in process engineering. We then turn to the computational and numerical challenges for building the simulation environments necessary for successful DTs implementation</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108917"},"PeriodicalIF":3.9,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Luis Antonio Pulido-Victoria , Antonio Flores-Tlacuahuac , Alexander Panales-Pérez , Tania E. Lara-Ceniceros , Manuel Alejandro Ávila-López , José Bonilla-Cruz
{"title":"Prediction of viscoelastic and printability properties on binder-free TiO2-based ceramic pastes by DIW through a machine learning approach","authors":"Luis Antonio Pulido-Victoria , Antonio Flores-Tlacuahuac , Alexander Panales-Pérez , Tania E. Lara-Ceniceros , Manuel Alejandro Ávila-López , José Bonilla-Cruz","doi":"10.1016/j.compchemeng.2024.108920","DOIUrl":"10.1016/j.compchemeng.2024.108920","url":null,"abstract":"<div><div>Ceramic 3D printing has become an increasingly popular manufacturing technique due to its potential to create complex geometries with high precision. However, predicting the printability of ceramic pastes remains a challenge, as it depends on various rheological properties. In this study, we propose a feed-forward deep neural network model that predicts the printability of ceramic pastes based on two suggested criteria, a shear-thinning ability and a gel point greater than <span><math><mrow><mn>1</mn><mo>×</mo><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>3</mn></mrow></msup></mrow></math></span> Pa. The model is trained on a dataset built from rheological and viscoelastic characterizations of pastes, and validated on a separate test set. Our results show that the proposed learning model achieves small relative error in predicting the gel point of the ceramic pastes, with a mean value of 8.99181 and a standard deviation of 1.812864. This model has the potential to improve the efficiency and quality of ceramic 3D printing by enabling rapid and accurate predictions of paste printability.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108920"},"PeriodicalIF":3.9,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Advancing machine learning in Industry 4.0: Benchmark framework for rare-event prediction in chemical processes","authors":"Vikram Sudarshan, Warren D. Seider","doi":"10.1016/j.compchemeng.2024.108929","DOIUrl":"10.1016/j.compchemeng.2024.108929","url":null,"abstract":"<div><div>Previously, using forward-flux sampling (FFS) and machine learning (ML), we developed multivariate alarm systems to counter rare un-postulated abnormal events. Our alarm systems utilized ML-based predictive models to quantify committer probabilities as functions of key process variables (e.g., temperature, concentrations, and the like), with these data obtained in FFS simulations. Herein, we introduce a comprehensive benchmark framework for rare-event prediction, comparing ML algorithms of varying complexity, including Linear Support-Vector Regressor and k-Nearest Neighbors, to more sophisticated algorithms, such as Random Forests, XGBoost, LightGBM, CatBoost, Dense Neural Networks, and TabNet. This evaluation uses comprehensive performance metrics: <em>RMSE,</em> model training, testing, hyperparameter tuning and deployment times, and number and efficiency of alarms. These balance model accuracy, computational efficiency, and alarm-system efficiency, identifying optimal ML strategies for predicting abnormal rare events, enabling operators to obtain safer and more reliable plant operations.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 108929"},"PeriodicalIF":3.9,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142747143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Methodology for hyperparameter tuning of deep neural networks for efficient and accurate molecular property prediction","authors":"Xuan Dung James Nguyen, Y.A. Liu","doi":"10.1016/j.compchemeng.2024.108928","DOIUrl":"10.1016/j.compchemeng.2024.108928","url":null,"abstract":"<div><div>This paper presents a methodology of hyperparameter optimization (HPO) of deep neural networks for molecular property prediction (MPP). Most prior applications of deep learning to MPP have paid only limited attention to HPO, thus resulting in suboptimal values of predicted properties. To improve the efficiency and accuracy of deep learning models for MPP, we must optimize as many hyperparameters as possible and choose a software platform to enable the parallel execution of HPO. We compare the random search, Bayesian optimization, and hyperband algorithms, together with the Bayesian-hyperband combination within the software packages of KerasTuner and Optuna for HPO. We conclude that the hyperband algorithm, which has not been used in previous MPP studies, is most computationally efficient; it gives MPP results that are optimal or nearly optimal in terms of prediction accuracy. Based on our case studies, we recommend the use of the Python library KerasTuner for HPO.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"193 ","pages":"Article 108928"},"PeriodicalIF":3.9,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}