Pub Date : 2026-01-28DOI: 10.1016/j.cie.2026.111829
Yinan Zhao , Hanwen Jiang , Shiyi Gong
Robust traffic routing is an effective means of mitigating rail congestion and enhancing system resilience in emergencies and unexpected disruptions. However, there still lack a systematic theoretical system for uncertainty optimization in railway freight traffic organization, due to modeling complexity and limited availability of operational data. This study formulates a strategic robust railway freight traffic routing problem under demand uncertainty without requiring distributional assumptions. Demand fluctuations are captured through a symmetric uncertainty set with a robustness budget (price of robustness), yielding a computationally tractable deterministic reformulation for routing decisions. An improved Benders decomposition framework in which the master problem is approximately optimized by simulated annealing (SA). The numerical results on a series of expanding test networks demonstrate that the proposed SA-based Benders approach can serve as a highly qualified alternative solving approach when the computational resources are limited. Sensitivity analyses conducted on key algorithmic parameters indicate stable performance under moderate perturbations, supporting that the adopted baseline settings lie in a practically reasonable range.
{"title":"Robust railway traffic routing problem under uncertain demand: an improved benders decomposition approach","authors":"Yinan Zhao , Hanwen Jiang , Shiyi Gong","doi":"10.1016/j.cie.2026.111829","DOIUrl":"10.1016/j.cie.2026.111829","url":null,"abstract":"<div><div>Robust traffic routing is an effective means of mitigating rail congestion and enhancing system resilience in emergencies and unexpected disruptions. However, there still lack a systematic theoretical system for uncertainty optimization in railway freight traffic organization, due to modeling complexity and limited availability of operational data. This study formulates a strategic robust railway freight traffic routing problem under demand uncertainty without requiring distributional assumptions. Demand fluctuations are captured through a symmetric uncertainty set with a robustness budget (price of robustness), yielding a computationally tractable deterministic reformulation for routing decisions. An improved Benders decomposition framework in which the master problem is approximately optimized by simulated annealing (SA). The numerical results on a series of expanding test networks demonstrate that the proposed SA-based Benders approach can serve as a highly qualified alternative solving approach when the computational resources are limited. Sensitivity analyses conducted on key algorithmic parameters indicate stable performance under moderate perturbations, supporting that the adopted baseline settings lie in a practically reasonable range.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111829"},"PeriodicalIF":6.5,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-28DOI: 10.1016/j.cie.2026.111837
Mahsa Mohammadi , Babak Mohamadpour Tosarkani
This study aims to develop a novel graph theory-based clustering algorithm for large-scale logistics planning problems focusing on the distribution of face masks by various transportation modes under uncertainty. A robust multi-objective, mixed-integer linear programming model (MILPM) is utilized to handle imprecise parameters (e.g., demand and processing time). The proposed model supports decision-makers in designing a sustainable closed-loop supply chain network for the optimal face mask distribution under time window limitations. A sample average approximation methodology is applied to tackle the large-scale case study. Furthermore, a graph theory-based clustering algorithm is proposed to accelerate the scenario decomposition approach since it deals with less scenarios in comparison with sample average approximation and scenario decomposition. Silhouette analysis is conducted to measure the performance and accuracy of the generated clusters. Sensitivity analyses are implemented to validate the efficiency and applicability of the presented solution approach. A series of scenarios is set to represent supply chain network disruptions with unknown probabilities. The outcome of this study denotes the optimal flow of face masks and the optimum number of facilities at the time of the COVID-19 outbreak in Toronto, Canada.
{"title":"Harmonizing sustainability and resiliency: A novel robust-stochastic decomposition approach for effective mask distribution and recycling","authors":"Mahsa Mohammadi , Babak Mohamadpour Tosarkani","doi":"10.1016/j.cie.2026.111837","DOIUrl":"10.1016/j.cie.2026.111837","url":null,"abstract":"<div><div>This study aims to develop a novel graph theory-based clustering algorithm for large-scale logistics planning problems focusing on the distribution of face masks by various transportation modes under uncertainty. A robust multi-objective, mixed-integer linear programming model <em>(MILPM)</em> is utilized to handle imprecise parameters (e.g., demand and processing time). The proposed model supports decision-makers in designing a sustainable closed-loop supply chain network for the optimal face mask distribution under time window limitations. A sample average approximation methodology is applied to tackle the large-scale case study. Furthermore, a graph theory-based clustering algorithm is proposed to accelerate the scenario decomposition approach since it deals with less scenarios in comparison with sample average approximation and scenario decomposition. Silhouette analysis is conducted to measure the performance and accuracy of the generated clusters. Sensitivity analyses are implemented to validate the efficiency and applicability of the presented solution approach. A series of scenarios is set to represent supply chain network disruptions with unknown probabilities. The outcome of this study denotes the optimal flow of face masks and the optimum number of facilities at the time of the COVID-19 outbreak in Toronto, Canada.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111837"},"PeriodicalIF":6.5,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-28DOI: 10.1016/j.cie.2026.111871
Qiang Wan , Yanni An , Mei Zhu
Current research that integrates the three functions of production planning, maintenance, and quality monitoring suffers from three significant shortcomings: (1) Assume that there is only one identifiable source of variation within the process. Due to the inherent complexity characteristic of most real-world manufacturing operations, the simplified assumption of a single assignable cause is seldom observed in actual industrial settings. When the actual assignable cause of a process shift does not match the one anticipated in quality monitoring, performance may be subpar in both economic and statistical terms. (2) Monitoring a single quality characteristic, however, in actual conditions, multiple process quality characteristics should be monitored simultaneously. (3) To simplify the model, the buffer inventory time is established at the start of the cycle. However, if the buffer is loaded too early, it may result in excess inventory holding expenses. To handle these shortcomings, this work establishes an integration scheme for production, multivariate statistical process monitoring and maintenance planning that considers dynamical replenishment and multiple assignable causes. Under economic–statistical quality constraints, a customized genetic algorithm is employed to optimize the expected total cost of each process cycle. In the comparative study, the proposed model is compared with integrated models using a single assignable cause, MEWMA, and MCUSUM charts, highlighting its superior economic and statistical performance. Finally, a design of experiments (DOE)-based sensitivity analysis is carried out on the principal process parameters and the average total cost per cycle.
{"title":"Optimal control policy for combined production–maintenance and multivariate quality monitoring of an imperfect manufacturing system with replenishment and assignable causes","authors":"Qiang Wan , Yanni An , Mei Zhu","doi":"10.1016/j.cie.2026.111871","DOIUrl":"10.1016/j.cie.2026.111871","url":null,"abstract":"<div><div>Current research that integrates the three functions of production planning, maintenance, and quality monitoring suffers from three significant shortcomings: (1) Assume that there is only one identifiable source of variation within the process. Due to the inherent complexity characteristic of most real-world manufacturing operations, the simplified assumption of a single assignable cause is seldom observed in actual industrial settings. When the actual assignable cause of a process shift does not match the one anticipated in quality monitoring, performance may be subpar in both economic and statistical terms. (2) Monitoring a single quality characteristic, however, in actual conditions, multiple process quality characteristics should be monitored simultaneously. (3) To simplify the model, the buffer inventory time is established at the start of the cycle. However, if the buffer is loaded too early, it may result in excess inventory holding expenses. To handle these shortcomings, this work establishes an integration scheme for production, multivariate statistical process monitoring and maintenance planning that considers dynamical replenishment and multiple assignable causes. Under economic–statistical quality constraints, a customized genetic algorithm is employed to optimize the expected total cost of each process cycle. In the comparative study, the proposed model is compared with integrated models using a single assignable cause, MEWMA, and MCUSUM charts, highlighting its superior economic and statistical performance. Finally, a design of experiments (DOE)-based sensitivity analysis is carried out on the principal process parameters and the average total cost per cycle.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111871"},"PeriodicalIF":6.5,"publicationDate":"2026-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-27DOI: 10.1016/j.cie.2026.111869
Anshuman Kumar, S.P. Sarmah
Semiconductor manufacturing systems are subject to significant operational uncertainties stemming from fluctuating customer demand, variable supplier lead times and machine-level disruptions. This study presents a multi-stage stochastic programming framework that integrates production planning, procurement scheduling, inventory control and emissions management within a unified decision-making model. The framework explicitly incorporates environmental regulations through periodic emission thresholds and tool cleaning constraints while accounting for sourcing risks through supplier classification and diversification. By modelling uncertainty through a scenario-based approach, the proposed method enables both anticipatory and adaptive decisions that enhance system robustness. The model is implemented using mixed-integer programming techniques and validated through computational experiments based on empirically motivated scenarios. Results demonstrate improved cost efficiency, service level adherence, and regulatory compliance compared to deterministic baselines. Sensitivity analysis highlights key trade-offs, showing that stricter emission caps can increase total costs, while supplier diversification helps mitigate disruption risks. The results underscore the value of stochastic programming in capturing the complex interdependencies in semiconductor supply chains and provide a rigorous decision-support tool for managing uncertainty in high-precision manufacturing systems.
{"title":"A multi-stage stochastic model for sustainable semiconductor manufacturing","authors":"Anshuman Kumar, S.P. Sarmah","doi":"10.1016/j.cie.2026.111869","DOIUrl":"10.1016/j.cie.2026.111869","url":null,"abstract":"<div><div>Semiconductor manufacturing systems are subject to significant operational uncertainties stemming from fluctuating customer demand, variable supplier lead times and machine-level disruptions. This study presents a multi-stage stochastic programming framework that integrates production planning, procurement scheduling, inventory control and emissions management within a unified decision-making model. The framework explicitly incorporates environmental regulations through periodic emission thresholds and tool cleaning constraints while accounting for sourcing risks through supplier classification and diversification. By modelling uncertainty through a scenario-based approach, the proposed method enables both anticipatory and adaptive decisions that enhance system robustness. The model is implemented using mixed-integer programming techniques and validated through computational experiments based on empirically motivated scenarios. Results demonstrate improved cost efficiency, service level adherence, and regulatory compliance compared to deterministic baselines. Sensitivity analysis highlights key trade-offs, showing that stricter emission caps can increase total costs, while supplier diversification helps mitigate disruption risks. The results underscore the value of stochastic programming in capturing the complex interdependencies in semiconductor supply chains and provide a rigorous decision-support tool for managing uncertainty in high-precision manufacturing systems.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111869"},"PeriodicalIF":6.5,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a value-based deep reinforcement learning approach that is capable of handling train timetable rescheduling under both disturbed and disrupted situations. A railway environment is constructed to simulate the problem as a Markov decision process, where the optimization objective is integrated into the reward module and various constraints are incorporated into the conflict detection and avoidance module. To address the challenges of sparse rewards and large action space with limited legal actions, a value-based algorithm framework is proposed to efficiently select and effectively evaluate actions. Through the designed simulation and training procedures, the proposed approach is tested on several disturbance and disruption cases based on a real-world instance (i.e. a Chinese high-speed railway corridor). Experimental results show that the proposed method can obtain high-quality solutions within a reasonable computing time, and also outperforms handcrafted rules in terms of the optimality of solutions. Furthermore, the proposed method exhibits promising generalization capabilities in homogeneous perturbation scenarios (disturbance scenarios and disruption scenarios that share either the same affected location and start time or the same affected location and disrupted duration).
{"title":"Reinforcement learning for train timetable rescheduling under perturbation: A general value-based approach","authors":"Pu Zhang , Lingyun Meng , Yongqiu Zhu , Jianrui Miao , Xiaojie Luan , Zhengwen Liao","doi":"10.1016/j.cie.2026.111867","DOIUrl":"10.1016/j.cie.2026.111867","url":null,"abstract":"<div><div>This paper proposes a value-based deep reinforcement learning approach that is capable of handling train timetable rescheduling under both disturbed and disrupted situations. A railway environment is constructed to simulate the problem as a Markov decision process, where the optimization objective is integrated into the reward module and various constraints are incorporated into the conflict detection and avoidance module. To address the challenges of sparse rewards and large action space with limited legal actions, a value-based algorithm framework is proposed to efficiently select and effectively evaluate actions. Through the designed simulation and training procedures, the proposed approach is tested on several disturbance and disruption cases based on a real-world instance (i.e. a Chinese high-speed railway corridor). Experimental results show that the proposed method can obtain high-quality solutions within a reasonable computing time, and also outperforms handcrafted rules in terms of the optimality of solutions. Furthermore, the proposed method exhibits promising generalization capabilities in homogeneous perturbation scenarios (disturbance scenarios and disruption scenarios that share either the same affected location and start time or the same affected location and disrupted duration).</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111867"},"PeriodicalIF":6.5,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-25DOI: 10.1016/j.cie.2026.111848
Kung-Jeng Wang , Natalia Febri
Vending machines (VMs) serve as an important aspect of automated retail, delivering both flexibility in operations and convenience for consumers. However, as VM networks expand, managers face growing logistical challenges in determining optimal deployment locations, product selection and allocation, and restocking schedules. This study proposes a novel bi-layer optimization framework that jointly optimizes deployment, product selection and allocation, and a synchronized replenishment cycle. To address the complexity of this large-scale combinatorial problem, we develop a hybrid Tabu Search and Evolution Strategy (TS-ES) algorithm. Extensive experiments show that the synchronized replenishment cycle yields better performance than the independent cycle. Comparative analysis demonstrates that the hybrid TS-ES algorithm consistently achieves higher objective values than standalone TS, genetic algorithm (GA), random search (RS), and iterative local search (ILS) across various problem scales. This research contributes to the current body of knowledge by introducing a comprehensive framework that improves VM operational performance and serves as a practical resource for optimizing the logistics and profitability within VM networks.
{"title":"Joint optimization of vending machine deployment and shelf display design with synchronized merchandise replenishment","authors":"Kung-Jeng Wang , Natalia Febri","doi":"10.1016/j.cie.2026.111848","DOIUrl":"10.1016/j.cie.2026.111848","url":null,"abstract":"<div><div>Vending machines (VMs) serve as an important aspect of automated retail, delivering both flexibility in operations and convenience for consumers. However, as VM networks expand, managers face growing logistical challenges in determining optimal deployment locations, product selection and allocation, and restocking schedules. This study proposes a novel bi-layer optimization framework that jointly optimizes deployment, product selection and allocation, and a synchronized replenishment cycle. To address the complexity of this large-scale combinatorial problem, we develop a hybrid Tabu Search and Evolution Strategy (TS-ES) algorithm. Extensive experiments show that the synchronized replenishment cycle yields better performance than the independent cycle. Comparative analysis demonstrates that the hybrid TS-ES algorithm consistently achieves higher objective values than standalone TS, genetic algorithm (GA), random search (RS), and iterative local search (ILS) across various problem scales. This research contributes to the current body of knowledge by introducing a comprehensive framework that improves VM operational performance and serves as a practical resource for optimizing the logistics and profitability within VM networks.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111848"},"PeriodicalIF":6.5,"publicationDate":"2026-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Intertwined supply networks are collaborative, cross-industry supply chains characterized by a high level of interconnectedness among their entities. This study demonstrates that integrating circular economy principles into such networks can cut greenhouse gas emissions by 4.97% and reduce total system costs by 11.03%, while strengthening economic efficiency and social responsibility under uncertainty. To realize these improvements, a novel multi-objective non-linear mixed-integer mathematical model is proposed with an embedded scenario differentiation mechanism that enables evaluation of configurations, from traditional decentralized supply chains to complex intertwined networks with varying levels of circularity, within a unified analytical model. The objective functions are to minimize system costs and greenhouse gas emissions and maximize social responsibility for optimal location decisions under uncertainty. The proposed model is first verified using the AUGMECON-2 method and validated via a case study of an intertwined pharmaceutical-bioplastic supply network, complemented by numerical experiments, sensitivity analyses, and a comparative study using the Grey Wolf Optimizer for large-scale instances.
{"title":"A scenario-adaptive optimization model for circular intertwined supply network design under uncertainty","authors":"Mohaddeseh Roshan , Jessica Olivares-Aguila , Waguih ElMaraghy","doi":"10.1016/j.cie.2026.111849","DOIUrl":"10.1016/j.cie.2026.111849","url":null,"abstract":"<div><div>Intertwined supply networks are collaborative, cross-industry supply chains characterized by a high level of interconnectedness among their entities. This study demonstrates that integrating circular economy principles into such networks can cut greenhouse gas emissions by 4.97% and reduce total system costs by 11.03%, while strengthening economic efficiency and social responsibility under uncertainty. To realize these improvements, a novel multi-objective non-linear mixed-integer mathematical model is proposed with an embedded scenario differentiation mechanism that enables evaluation of configurations, from traditional decentralized supply chains to complex intertwined networks with varying levels of circularity, within a unified analytical model. The objective functions are to minimize system costs and greenhouse gas emissions and maximize social responsibility for optimal location decisions under uncertainty. The proposed model is first verified using the AUGMECON-2 method and validated via a case study of an intertwined pharmaceutical-bioplastic supply network, complemented by numerical experiments, sensitivity analyses, and a comparative study using the Grey Wolf Optimizer for large-scale instances.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111849"},"PeriodicalIF":6.5,"publicationDate":"2026-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-25DOI: 10.1016/j.cie.2026.111847
Lina Aboueljinane , Maroua Sbiti , Youness Frichi
While Industrial Symbiosis (IS) is a cornerstone of the circular economy, its operational viability remains vulnerable to market volatility and regulatory shifts. This study investigates the resilience and sustainability of a symbiotic system under five carbon regulation mechanisms. A capacitated joint production planning problem is formulated as a Mixed-Integer Linear Program (MILP) and compared against a Simulation-Based Optimization framework using Differential Evolution (DE). To evaluate global robustness, we conducted a massive stress-test across 5000 scenarios generated via Latin Hypercube Sampling (LHS) and analyzed using Explainable AI (Random Forest). The results reveal a critical “Structural Fragility”: the deterministic MILP exhibits a 60% failure rate, categorized either as Mathematical Infeasibility (solver incapacity) or Physical Operational Failure (inventory overflows during simulation), driven by capacity bottlenecks and demand surges. In contrast, the proposed framework guarantees 99.76% % feasibility by dynamically adjusting safety stocks, identifying robust “best-effort” solutions. A multi-objective Pareto analysis further quantifies the trade-offs, revealing a Shadow Price of Resilience and an Environmental Rebound Effect. Among regulatory mechanisms, Cap-and-Trade emerges as the “smartest“ policy, enabling a dynamic arbitrage capability, where the system intelligently switches between production and carbon trading based on market signals. This study contributes a unified, data-driven framework for designing resilient, low-carbon manufacturing systems capable of withstanding real-world uncertainty.
{"title":"Simulation-based optimization of industrial symbiosis under carbon regulations: towards sustainable and resilient production networks","authors":"Lina Aboueljinane , Maroua Sbiti , Youness Frichi","doi":"10.1016/j.cie.2026.111847","DOIUrl":"10.1016/j.cie.2026.111847","url":null,"abstract":"<div><div>While Industrial Symbiosis (IS) is a cornerstone of the circular economy, its operational viability remains vulnerable to market volatility and regulatory shifts. This study investigates the resilience and sustainability of a symbiotic system under five carbon regulation mechanisms. A capacitated joint production planning problem is formulated as a Mixed-Integer Linear Program (MILP) and compared against a Simulation-Based Optimization framework using Differential Evolution (DE). To evaluate global robustness, we conducted a massive stress-test across 5000 scenarios generated via Latin Hypercube Sampling (LHS) and analyzed using Explainable AI (Random Forest). The results reveal a critical “Structural Fragility”: the deterministic MILP exhibits a 60% failure rate, categorized either as Mathematical Infeasibility (solver incapacity) or Physical Operational Failure (inventory overflows during simulation), driven by capacity bottlenecks and demand surges. In contrast, the proposed framework guarantees 99.76% % feasibility by dynamically adjusting safety stocks, identifying robust “best-effort” solutions. A multi-objective Pareto analysis further quantifies the trade-offs, revealing a Shadow Price of Resilience and an Environmental Rebound Effect. Among regulatory mechanisms, Cap-and-Trade emerges as the “smartest“ policy, enabling a dynamic arbitrage capability, where the system intelligently switches between production and carbon trading based on market signals. This study contributes a unified, data-driven framework for designing resilient, low-carbon manufacturing systems capable of withstanding real-world uncertainty.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111847"},"PeriodicalIF":6.5,"publicationDate":"2026-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-25DOI: 10.1016/j.cie.2026.111838
Yurong Guo, Jie Zhang, Junliang Wang
To address the challenges of control latency and uncertainty in force control tasks involving soft-bodied operational robots, this paper proposes a physics-guided and uncertainty-aware feedforward force-admittance control method, referred to as PG-DGPRL. First, a feedforward admittance control strategy with online estimation of force-tracking error is introduced. By forecasting future deviations in interaction forces, the controller parameters are adjusted in advance, thereby mitigating the adverse effects of control latency. Second, a physics-informed deep Gaussian process reinforcement learning (DGPRL) method is developed. The policy is represented as a Gaussian distribution, and the constitutive mechanical model of flexible materials is embedded as a physical constraint, enabling both uncertainty awareness and physical consistency verification. In addition, a composite loss function is designed to achieve joint optimization among policy generation by the actor network, uncertainty estimation by the DGP, and physical regularization by a physics-informed neural network (PINN). Finally, experiments are conducted under various environmental damping and interaction force conditions, comparing PG-DGPRL with baseline methods including CAC, Ada-CAC, and A2C. The results indicate that, under the current experimental conditions, PG-DGPRL achieves superior trajectory tracking and force control performance, exhibiting strong stability and generalization capability.
{"title":"PG-DGPRL: A physics-guided and uncertainty-aware feedforward force-admittance control method for soft-bodied operational robots","authors":"Yurong Guo, Jie Zhang, Junliang Wang","doi":"10.1016/j.cie.2026.111838","DOIUrl":"10.1016/j.cie.2026.111838","url":null,"abstract":"<div><div>To address the challenges of control latency and uncertainty in force control tasks involving soft-bodied operational robots, this paper proposes a physics-guided and uncertainty-aware feedforward force-admittance control method, referred to as PG-DGPRL. First, a feedforward admittance control strategy with online estimation of force-tracking error is introduced. By forecasting future deviations in interaction forces, the controller parameters are adjusted in advance, thereby mitigating the adverse effects of control latency. Second, a physics-informed deep Gaussian process reinforcement learning (DGPRL) method is developed. The policy is represented as a Gaussian distribution, and the constitutive mechanical model of flexible materials is embedded as a physical constraint, enabling both uncertainty awareness and physical consistency verification. In addition, a composite loss function is designed to achieve joint optimization among policy generation by the actor network, uncertainty estimation by the DGP, and physical regularization by a physics-informed neural network (PINN). Finally, experiments are conducted under various environmental damping and interaction force conditions, comparing PG-DGPRL with baseline methods including CAC, Ada-CAC, and A2C. The results indicate that, under the current experimental conditions, PG-DGPRL achieves superior trajectory tracking and force control performance, exhibiting strong stability and generalization capability.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111838"},"PeriodicalIF":6.5,"publicationDate":"2026-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-24DOI: 10.1016/j.cie.2026.111840
Yushuai Zhang , Xiao Li , Yunqiang Wang , Zhenyu Wang , Chuan Shi , Jiyong Lei , Licheng Sun
Accurate prediction of the compressive strength of high-performance concrete is of great significance for concrete engineering design and quality control. To address the limitations of traditional prediction methods characterized by insufficient accuracy and inadequate interpretability, this study proposes an intelligent prediction methodology that integrates domain knowledge-driven feature engineering with Light Gradient Boosting Machine (LightGBM) optimized by Tree-structured Parzen Estimator (TPE). Based on the high-performance concrete dataset, this study utilized concrete materials science theory to construct a composite feature system comprising five major categories encompassing 12 engineering features: water-binder ratio, cementitious materials, aggregate proportion, admixture effects, and comprehensive performance. Through an incremental feature selection strategy, the system was optimized to yield 10 critical features. The TPE Bayesian optimization algorithm was employed to conduct hyperparameter tuning for the LightGBM model, and SHapley Additive exPlanations (SHAP) methodology was utilized to perform interpretability analysis. The experimental results demonstrate that the optimized model achieved superior performance on the test set with Root Mean Square Error (RMSE) of 3.371 MPa, coefficient of determination (R2) of 0.961, Mean Absolute Error (MAE) of 2.446 MPa, and Mean Absolute Percentage Error (MAPE) of 9.6 %. The proposed method outperformed advanced approaches such as eXtreme Gradient Boosting and Random Forest, comprehensively validating the effectiveness of the proposed methodology. SHAP analysis revealed that Age and Effective_Water_Cement_Ratio were the most critical predictive factors, with the model-learned patterns demonstrating high consistency with concrete hydration theory. This research provides a precise and interpretable prediction tool for designing high-performance concrete with significant practical engineering value.
{"title":"High-performance concrete compressive strength prediction using Soft computing","authors":"Yushuai Zhang , Xiao Li , Yunqiang Wang , Zhenyu Wang , Chuan Shi , Jiyong Lei , Licheng Sun","doi":"10.1016/j.cie.2026.111840","DOIUrl":"10.1016/j.cie.2026.111840","url":null,"abstract":"<div><div>Accurate prediction of the compressive strength of high-performance concrete is of great significance for concrete engineering design and quality control. To address the limitations of traditional prediction methods characterized by insufficient accuracy and inadequate interpretability, this study proposes an intelligent prediction methodology that integrates domain knowledge-driven feature engineering with Light Gradient Boosting Machine (LightGBM) optimized by Tree-structured Parzen Estimator (TPE). Based on the high-performance concrete dataset, this study utilized concrete materials science theory to construct a composite feature system comprising five major categories encompassing 12 engineering features: water-binder ratio, cementitious materials, aggregate proportion, admixture effects, and comprehensive performance. Through an incremental feature selection strategy, the system was optimized to yield 10 critical features. The TPE Bayesian optimization algorithm was employed to conduct hyperparameter tuning for the LightGBM model, and SHapley Additive exPlanations (SHAP) methodology was utilized to perform interpretability analysis. The experimental results demonstrate that the optimized model achieved superior performance on the test set with Root Mean Square Error (RMSE) of 3.371 MPa, coefficient of determination (R<sup>2</sup>) of 0.961, Mean Absolute Error (MAE) of 2.446 MPa, and Mean Absolute Percentage Error (MAPE) of 9.6 %. The proposed method outperformed advanced approaches such as eXtreme Gradient Boosting and Random Forest, comprehensively validating the effectiveness of the proposed methodology. SHAP analysis revealed that Age and Effective_Water_Cement_Ratio were the most critical predictive factors, with the model-learned patterns demonstrating high consistency with concrete hydration theory. This research provides a precise and interpretable prediction tool for designing high-performance concrete with significant practical engineering value.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"214 ","pages":"Article 111840"},"PeriodicalIF":6.5,"publicationDate":"2026-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}