首页 > 最新文献

Computers & Industrial Engineering最新文献

英文 中文
From railway disruptions to recovery: An improved Benders decomposition for the dynamic train timetable rescheduling and rolling stock reassignment 从铁路中断到恢复:动态列车时刻表重新调度和机车车辆重新分配的改进Benders分解
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-27 DOI: 10.1016/j.cie.2025.111794
Nsabimana Buhigiro , Liujiang Kang , Qingying Lai , Huijun Sun , Qianwen Xu
This paper proposes a novel rolling-horizon-based optimization framework for managing railway operations, which integrates dynamic train timetable rescheduling and rolling stock reassignment under uncertain disruption durations. Unlike existing approaches that assume fixed-duration disruptions, our method explicitly incorporates real-time uncertainty by enabling adaptive recovery strategies. These include resource schedule adjustments, service cancellations, short-turning, stop-skipping, and the strategic insertion of additional train services. The problem is formulated as a mixed-integer linear programming model that aims to minimize total delay, operational costs, penalties for cancellations, and costs related to slot planning for additional train services. The formulation respects a variety of operational constraints, including fleet feasibility and service continuity, enabling dynamic and feasible rescheduling. To overcome the computational challenges of real-time decision-making with gradually revealed disruption information, we develop an improved Benders decomposition (IBD) algorithm. The method decomposes the model into a master problem (rolling stock reassignment) and a subproblem (timetable rescheduling), and incorporates custom multi-optimality cuts within a rolling horizon framework to enhance convergence. For benchmarking, we also implement a two-stage sequential algorithm (TSA). Numerical experiments on the Beijing Batong metro line demonstrate that IBD significantly outperforms both TSA and commercial solvers in computational efficiency. Our approach provides practically viable solutions for railway operators facing uncertain disruptions, bridging the gap between theoretical models and real-world applicability.
本文提出了一种新的基于滚动水平的铁路运营管理优化框架,该框架将不确定中断持续时间下的列车时刻表动态调度和车辆重新分配相结合。与现有的假设固定时间中断的方法不同,我们的方法通过启用自适应恢复策略明确地结合了实时不确定性。这些措施包括资源调度调整、服务取消、短转、跳站和战略性地插入额外的列车服务。该问题被表述为一个混合整数线性规划模型,其目标是最小化总延误、运营成本、取消处罚以及与额外列车服务的时段规划相关的成本。该方案考虑了各种操作约束,包括机队可行性和服务连续性,实现了动态和可行的重新调度。为了克服实时决策的计算挑战,我们开发了一种改进的Benders分解(IBD)算法。该方法将模型分解为一个主问题(车辆重新分配)和一个子问题(时间表重新调度),并在滚动地平线框架内引入自定义多最优切割以增强收敛性。对于基准测试,我们还实现了两阶段顺序算法(TSA)。在北京八通地铁上的数值实验表明,IBD在计算效率上明显优于TSA和商用求解器。我们的方法为面临不确定中断的铁路运营商提供了切实可行的解决方案,弥合了理论模型与现实应用之间的差距。
{"title":"From railway disruptions to recovery: An improved Benders decomposition for the dynamic train timetable rescheduling and rolling stock reassignment","authors":"Nsabimana Buhigiro ,&nbsp;Liujiang Kang ,&nbsp;Qingying Lai ,&nbsp;Huijun Sun ,&nbsp;Qianwen Xu","doi":"10.1016/j.cie.2025.111794","DOIUrl":"10.1016/j.cie.2025.111794","url":null,"abstract":"<div><div>This paper proposes a novel rolling-horizon-based optimization framework for managing railway operations, which integrates dynamic train timetable rescheduling and rolling stock reassignment under uncertain disruption durations. Unlike existing approaches that assume fixed-duration disruptions, our method explicitly incorporates real-time uncertainty by enabling adaptive recovery strategies. These include resource schedule adjustments, service cancellations, short-turning, stop-skipping, and the strategic insertion of additional train services. The problem is formulated as a mixed-integer linear programming model that aims to minimize total delay, operational costs, penalties for cancellations, and costs related to slot planning for additional train services. The formulation respects a variety of operational constraints, including fleet feasibility and service continuity, enabling dynamic and feasible rescheduling. To overcome the computational challenges of real-time decision-making with gradually revealed disruption information, we develop an improved Benders decomposition (IBD) algorithm. The method decomposes the model into a master problem (rolling stock reassignment) and a subproblem (timetable rescheduling), and incorporates custom multi-optimality cuts within a rolling horizon framework to enhance convergence. For benchmarking, we also implement a two-stage sequential algorithm (TSA). Numerical experiments on the Beijing Batong metro line demonstrate that IBD significantly outperforms both TSA and commercial solvers in computational efficiency. Our approach provides practically viable solutions for railway operators facing uncertain disruptions, bridging the gap between theoretical models and real-world applicability.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111794"},"PeriodicalIF":6.5,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885437","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}
引用次数: 0
A multi-cycle rotation strategy for relief supplies considering demand uncertainty 考虑到需求不确定性的救济物资多周期轮换战略
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-27 DOI: 10.1016/j.cie.2025.111778
Jing Wang , Xiuge Dong , Ling Zhang
Adequate reserves of relief supplies are crucial for rapid emergency response. However, the limited shelf-life of relief supplies and unpredictable emergencies often lead to relief supplies expiration, causing economic losses and reducing rescue efficiency. Relief supplies rotation can solve the relief supplies expiration problem to some extent. Developing a relief supplies rotation strategy requires determining the optimal rotation time, replacement quantity, and replenishment quantity of relief supplies. This paper proposes a multi-cycle rotation strategy for relief supplies considering demand uncertainty. We established a dynamic programming model to maximize total economic and social benefits. Considering demand uncertainty in emergencies, we constructed a data-driven fuzzy set based on Wasserstein distance and formulated the dynamic programming model into a distributionally robust optimization model. The model is validated through numerical experiments using real-world data from EM-DAT, and a four-quadrant model is established to provide practical rotation strategies for each category of relief supplies. Our research has effectively improved relief supplies utilization and strengthened humanitarian supply chain resilience.
充足的救济物资储备对于迅速作出紧急反应至关重要。然而,由于救援物资的保质期有限,加之突发事件不可预测,往往导致救援物资过期,造成经济损失,降低救援效率。救援物资轮转可以在一定程度上解决救援物资过期问题。制定救援物资轮换策略需要确定救援物资的最佳轮换时间、更换数量和补充数量。本文提出了考虑需求不确定性的救援物资多周期轮换策略。建立了经济效益和社会效益最大化的动态规划模型。考虑突发事件下需求的不确定性,构建基于Wasserstein距离的数据驱动模糊集,将动态规划模型转化为分布鲁棒优化模型。利用EM-DAT的实际数据,通过数值实验对模型进行了验证,并建立了四象限模型,为每一类救援物资提供了实用的轮换策略。我们的研究有效提高了救援物资的利用率,增强了人道主义供应链的韧性。
{"title":"A multi-cycle rotation strategy for relief supplies considering demand uncertainty","authors":"Jing Wang ,&nbsp;Xiuge Dong ,&nbsp;Ling Zhang","doi":"10.1016/j.cie.2025.111778","DOIUrl":"10.1016/j.cie.2025.111778","url":null,"abstract":"<div><div>Adequate reserves of relief supplies are crucial for rapid emergency response. However, the limited shelf-life of relief supplies and unpredictable emergencies often lead to relief supplies expiration, causing economic losses and reducing rescue efficiency. Relief supplies rotation can solve the relief supplies expiration problem to some extent. Developing a relief supplies rotation strategy requires determining the optimal rotation time, replacement quantity, and replenishment quantity of relief supplies. This paper proposes a multi-cycle rotation strategy for relief supplies considering demand uncertainty. We established a dynamic programming model to maximize total economic and social benefits. Considering demand uncertainty in emergencies, we constructed a data-driven fuzzy set based on Wasserstein distance and formulated the dynamic programming model into a distributionally robust optimization model. The model is validated through numerical experiments using real-world data from EM-DAT, and a four-quadrant model is established to provide practical rotation strategies for each category of relief supplies. Our research has effectively improved relief supplies utilization and strengthened humanitarian supply chain resilience.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111778"},"PeriodicalIF":6.5,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885570","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}
引用次数: 0
A novel Constraint Programming-Assisted evolutionary algorithm with deep Q-network for flexible job shop scheduling problem with robot constraints 基于深度q网络的约束规划辅助进化算法求解具有机器人约束的柔性作业车间调度问题
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111793
Weiyao Cheng , Leilei Meng , Yushuai Zhang , Chaoyong Zhang , Biao Zhang , Hongyan Sang
Fully automated workshops equipped with robots are trending in the manufacturing industry because of the rapid development in automation. This study addresses the flexible job shop scheduling problem with robot constraints to minimize the makespan. To this end, a mixed integer linear programming (MILP) and constraint programming (CP) models are developed, to achieve optimal solutions for small-scale instances. Further, a novel CP-assisted evolutionary algorithm with deep Q-network (EA-DQN-CP) is proposed to solve the problem effectively given its NP-hard nature, because this algorithm can comprehensively utilize advantages of the CP model, evolutionary algorithm (EA) and deep Q-network (DQN). EA-DQN-CP includes two stages: (1) A DQN-assisted EA (EA-DQN) is designed for obtaining a high-quality solution efficiently, wherein the DQN helps EA to select suitable search operators. (2) The CP model is used to optimize the obtained solution of EA-DQN. Experimental results demonstrate the effectiveness of MILP model, CP model, and EA-DQN-CP.
随着自动化技术的飞速发展,配备机器人的全自动化车间成为制造业发展的趋势。研究了具有机器人约束的柔性作业车间调度问题,以最小化完工时间。为此,建立了混合整数线性规划(MILP)和约束规划(CP)模型,以获得小规模实例的最优解。在此基础上,提出了一种新的基于深度q -网络的CP辅助进化算法(EA-DQN-CP),该算法综合利用了CP模型、进化算法(EA)和深度q -网络(DQN)的优点,有效地解决了np困难的问题。EA-DQN- cp包括两个阶段:(1)设计DQN辅助EA (EA-DQN)是为了高效地获得高质量的解,其中DQN帮助EA选择合适的搜索算子。(2)利用CP模型对得到的EA-DQN解进行优化。实验结果验证了MILP模型、CP模型和EA-DQN-CP模型的有效性。
{"title":"A novel Constraint Programming-Assisted evolutionary algorithm with deep Q-network for flexible job shop scheduling problem with robot constraints","authors":"Weiyao Cheng ,&nbsp;Leilei Meng ,&nbsp;Yushuai Zhang ,&nbsp;Chaoyong Zhang ,&nbsp;Biao Zhang ,&nbsp;Hongyan Sang","doi":"10.1016/j.cie.2025.111793","DOIUrl":"10.1016/j.cie.2025.111793","url":null,"abstract":"<div><div>Fully automated workshops equipped with robots are trending in the manufacturing industry because of the rapid development in automation. This study addresses the flexible job shop scheduling problem with robot constraints to minimize the makespan. To this end, a mixed integer linear programming (MILP) and constraint programming (CP) models are developed, to achieve optimal solutions for small-scale instances. Further, a novel CP-assisted evolutionary algorithm with deep Q-network (EA-DQN-CP) is proposed to solve the problem effectively given its NP-hard nature, because this algorithm can comprehensively utilize advantages of the CP model, evolutionary algorithm (EA) and deep Q-network (DQN). EA-DQN-CP includes two stages: (1) A DQN-assisted EA (EA-DQN) is designed for obtaining a high-quality solution efficiently, wherein the DQN helps EA to select suitable search operators. (2) The CP model is used to optimize the obtained solution of EA-DQN. Experimental results demonstrate the effectiveness of MILP model, CP model, and EA-DQN-CP.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111793"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885572","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}
引用次数: 0
Assessment of pharmaceutical supply risk during COVID-19 crisis: A novel MCGDM approach based on minimum cost consensus models COVID-19危机期间药品供应风险评估:基于最小成本共识模型的新型MCGDM方法
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111790
Wiem Daoud-BenAmor , Diego García-Zamora , Hela Moalla Frikha , Luis Martínez López
The COVID-19 pandemic has significantly affected the global health-product supply chains. Besides, the risks in the pharmaceutical supply chain have also increased accordingly during the pandemic. Therefore, assessment and mitigation of risks in the pharmaceutical supply chain are essential to control and counter such risks. This study aims to address various risks to the best mitigation strategies in the pharmaceutical industry in Tunisia during the COVID-19 crisis. To assess risks and produce an accurate result with more flexibility and robustness, a group decision-making scheme is appropriate. In real-world contexts, it may be challenging for all experts to reach a total agreement on a significant and valid solution. Thus, to handle this problem, this study proposes an innovative Multi-Criteria Group Decision-Making (MCGDM) approach based on Minimum Cost Consensus (MCC) models combined with Additive Ratio Assessment (ARAS) and Best-Worst method (BWM) under a linguistic 2-tuple environment. Such an approach obtains weights priorities of all risk criteria and provides an agreed ranking of each type of risk to the best mitigation strategies. Finally, a sensitivity analysis is conducted.
2019冠状病毒病大流行严重影响了全球卫生产品供应链。此外,在大流行期间,药品供应链的风险也相应增加。因此,评估和减轻药品供应链中的风险对于控制和应对此类风险至关重要。本研究旨在解决2019冠状病毒病危机期间突尼斯制药业最佳缓解战略面临的各种风险。为了评估风险,并产生更准确的结果,具有更大的灵活性和鲁棒性,群体决策方案是合适的。在现实环境中,对于所有专家来说,就一个重要而有效的解决方案达成完全一致可能是一项挑战。因此,为了解决这一问题,本研究提出了一种基于最小成本共识(MCC)模型,结合可加性比率评估(ARAS)和最佳-最差方法(BWM)的语言二元环境下的多准则群体决策(MCGDM)方法。这种方法获得所有风险标准的权重优先级,并为最佳缓解战略提供每种类型风险的商定排名。最后,进行了敏感性分析。
{"title":"Assessment of pharmaceutical supply risk during COVID-19 crisis: A novel MCGDM approach based on minimum cost consensus models","authors":"Wiem Daoud-BenAmor ,&nbsp;Diego García-Zamora ,&nbsp;Hela Moalla Frikha ,&nbsp;Luis Martínez López","doi":"10.1016/j.cie.2025.111790","DOIUrl":"10.1016/j.cie.2025.111790","url":null,"abstract":"<div><div>The COVID-19 pandemic has significantly affected the global health-product supply chains. Besides, the risks in the pharmaceutical supply chain have also increased accordingly during the pandemic. Therefore, assessment and mitigation of risks in the pharmaceutical supply chain are essential to control and counter such risks. This study aims to address various risks to the best mitigation strategies in the pharmaceutical industry in Tunisia during the COVID-19 crisis. To assess risks and produce an accurate result with more flexibility and robustness, a group decision-making scheme is appropriate. In real-world contexts, it may be challenging for all experts to reach a total agreement on a significant and valid solution. Thus, to handle this problem, this study proposes an innovative Multi-Criteria Group Decision-Making (MCGDM) approach based on Minimum Cost Consensus (MCC) models combined with Additive Ratio Assessment (ARAS) and Best-Worst method (BWM) under a linguistic 2-tuple environment. Such an approach obtains weights priorities of all risk criteria and provides an agreed ranking of each type of risk to the best mitigation strategies. Finally, a sensitivity analysis is conducted.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111790"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885435","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}
引用次数: 0
A combinatorial algorithm for three dimensional multi-container loading problem with different capacity constraints 具有不同容量约束的三维多集装箱装载问题的组合算法
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111779
Zhao-hong Jia , Zhong-jun Gao , Chuang Liu , Yun Yang , Tao Fang , Kai Li
In this paper, we study the multi-container loading problem with different capacity constraints to maximize the total filling rate of containers, which belongs to the combinatorial optimization problems. This problem is abstracted from a real-world factory scenario where items are distributed to customers along the same delivery route. To align with practical applications, we simultaneously consider the constraints of multi-drop, geometric, and load-bearing. The problem under study consists of two subproblems: container selection and item loading. We propose two strategies for container selection across diverse operational scenarios: greedy selection and refined search. Simulated annealing and heuristic algorithms are developed to meet varying requirements for item loading. These loading strategies are further integrated with container selection mechanisms, yielding four hybrid algorithms. The proposed algorithms are compared with state-of-the-art methods on two distinct data sets. Experimental results demonstrate that all four hybrid algorithms outperform their respective baselines in key performance metrics.
本文研究了不同容量约束下集装箱总装货率最大化的多集装箱装货问题,该问题属于组合优化问题。这个问题是从一个真实的工厂场景中抽象出来的,在这个场景中,物品沿着相同的交付路线分发给客户。为了配合实际应用,我们同时考虑了多滴、几何和承重的约束。所研究的问题包括两个子问题:容器选择和物品装载。我们提出了两种不同操作场景下的容器选择策略:贪婪选择和精细搜索。模拟退火和启发式算法的发展,以满足不同的要求,项目加载。这些加载策略与容器选择机制进一步集成,产生四种混合算法。在两个不同的数据集上,将提出的算法与最先进的方法进行了比较。实验结果表明,这四种混合算法在关键性能指标上都优于各自的基准。
{"title":"A combinatorial algorithm for three dimensional multi-container loading problem with different capacity constraints","authors":"Zhao-hong Jia ,&nbsp;Zhong-jun Gao ,&nbsp;Chuang Liu ,&nbsp;Yun Yang ,&nbsp;Tao Fang ,&nbsp;Kai Li","doi":"10.1016/j.cie.2025.111779","DOIUrl":"10.1016/j.cie.2025.111779","url":null,"abstract":"<div><div>In this paper, we study the multi-container loading problem with different capacity constraints to maximize the total filling rate of containers, which belongs to the combinatorial optimization problems. This problem is abstracted from a real-world factory scenario where items are distributed to customers along the same delivery route. To align with practical applications, we simultaneously consider the constraints of multi-drop, geometric, and load-bearing. The problem under study consists of two subproblems: container selection and item loading. We propose two strategies for container selection across diverse operational scenarios: greedy selection and refined search. Simulated annealing and heuristic algorithms are developed to meet varying requirements for item loading. These loading strategies are further integrated with container selection mechanisms, yielding four hybrid algorithms. The proposed algorithms are compared with state-of-the-art methods on two distinct data sets. Experimental results demonstrate that all four hybrid algorithms outperform their respective baselines in key performance metrics.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111779"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885573","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}
引用次数: 0
Long-term industrial electricity forecasting using generative adversarial networks and deep learning 使用生成对抗网络和深度学习的长期工业电力预测
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111791
Duy Anh Nguyen , Le Dung Nguyen , Ngoc Cuong Truong
This study employs advanced neural network architectures to propose a robust approach for forecasting industrial electricity consumption in the face of unpredictable disruptions. The proposed method is designed by integrating Long Short-Term Memory Networks (LSTM) into both the Generator and Discriminator of the Conditional Generative Adversarial Network (CGAN) to enhance the system’s forecasting capability. This integration enables the network to effectively capture the intricate temporal patterns in power demand, encompassing both short-term and long-term fluctuations. Additionally, the power consumption data is decomposed into distinct components: trend, seasonal, and residual to improve accuracy and efficiency. Each element is forecasted separately using customized strategies, which allows the model to address specific patterns unique to each data type. Experimental results using real-world industrial data from South Korean manufacturing factories confirm that the LSTM-enhanced CGAN model achieves superior forecasting accuracy and stability. It attains a 24 % accuracy gain in cement prediction as hidden units increase from 16 to 256, while multi-level Wavelet Decomposition further boosts accuracy by 36 % and reduces MAE by 41 % in the paper industry, and by 38 % and 29 % in the cement sector. In comparative testing, the proposed model outperformed traditional forecasting approaches such as Seasonal ARIMA, RNN, LSTM, and standalone CGAN, demonstrating its robustness and effectiveness in complex industrial environments. The study’s results indicate that this model significantly improves electricity consumption forecasting. Its application is particularly beneficial for industrial sectors where precise demand forecasting is crucial for optimizing operations, managing energy costs, and ensuring reliable facility preparation for power needs.
本研究采用先进的神经网络架构,提出了一种强大的方法来预测面对不可预测的中断时的工业用电量。该方法将长短期记忆网络(LSTM)集成到条件生成对抗网络(CGAN)的生成器和判别器中,以提高系统的预测能力。这种整合使电网能够有效地捕捉电力需求中复杂的时间模式,包括短期和长期波动。此外,功耗数据被分解为趋势、季节和剩余的不同成分,以提高准确性和效率。使用自定义策略分别预测每个元素,这允许模型处理每种数据类型特有的特定模式。使用来自韩国制造工厂的真实工业数据的实验结果证实,lstm增强的CGAN模型具有优越的预测精度和稳定性。当隐藏单元从16个增加到256个时,它在水泥预测中获得了24%的精度提高,而多层次小波分解进一步提高了36%的精度,在造纸行业降低了41%,在水泥行业降低了38%和29%。在对比测试中,该模型优于传统的预测方法,如季节性ARIMA、RNN、LSTM和独立CGAN,证明了其在复杂工业环境中的鲁棒性和有效性。研究结果表明,该模型显著改善了用电量预测。它的应用对工业部门尤其有益,因为精确的需求预测对于优化运营、管理能源成本和确保可靠的设施准备以满足电力需求至关重要。
{"title":"Long-term industrial electricity forecasting using generative adversarial networks and deep learning","authors":"Duy Anh Nguyen ,&nbsp;Le Dung Nguyen ,&nbsp;Ngoc Cuong Truong","doi":"10.1016/j.cie.2025.111791","DOIUrl":"10.1016/j.cie.2025.111791","url":null,"abstract":"<div><div>This study employs advanced neural network architectures to propose a robust approach for forecasting industrial electricity consumption in the face of unpredictable disruptions. The proposed method is designed by integrating Long Short-Term Memory Networks (LSTM) into both the Generator and Discriminator of the Conditional Generative Adversarial Network (CGAN) to enhance the system’s forecasting capability. This integration enables the network to effectively capture the intricate temporal patterns in power demand, encompassing both short-term and long-term fluctuations. Additionally, the power consumption data is decomposed into distinct components: trend, seasonal, and residual to improve accuracy and efficiency. Each element is forecasted separately using customized strategies, which allows the model to address specific patterns unique to each data type. Experimental results using real-world industrial data from South Korean manufacturing factories confirm that the LSTM-enhanced CGAN model achieves superior forecasting accuracy and stability. It attains a 24 % accuracy gain in cement prediction as hidden units increase from 16 to 256, while multi-level Wavelet Decomposition further boosts accuracy by 36 % and reduces MAE by 41 % in the paper industry, and by 38 % and 29 % in the cement sector. In comparative testing, the proposed model outperformed traditional forecasting approaches such as Seasonal ARIMA, RNN, LSTM, and standalone CGAN, demonstrating its robustness and effectiveness in complex industrial environments. The study’s results indicate that this model significantly improves electricity consumption forecasting. Its application is particularly beneficial for industrial sectors where precise demand forecasting is crucial for optimizing operations, managing energy costs, and ensuring reliable facility preparation for power needs.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111791"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841691","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}
引用次数: 0
Nonparametric Phase I analysis of multivariate data using PCA for industrial quality control 用PCA对工业质量控制的多变量数据进行非参数第一阶段分析
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111787
Xi Zhang , Amitava Mukherjee , Chenglong Li , Shurong Tong
The retrospective analysis of multivariate and high-dimensional processes in Phase I has garnered increasing attention in the field of industrial quality control. In such complex Phase I settings, where prior information about the underlying process distribution is often scarce, nonparametric methods are particularly valuable. However, research on nonparametric multivariate Phase I analysis remains relatively limited, with most existing studies concentrating on monitoring only a single feature of the underlying distribution. Principal Component Analysis (PCA), a fundamental technique for dimensionality reduction and feature extraction, has been widely adopted in nonparametric Phase II monitoring; however, its potential for Phase I analysis is not yet fully exploited. To address this gap, this paper introduces several novel Phase I schemes that integrate PCA with effective univariate Phase I procedures through different integration strategies. These schemes enable simultaneous monitoring of both location and scale parameters for any unknown multivariate distribution. Extensive Monte Carlo simulation studies demonstrate that the proposed schemes exhibit robust in-control (IC) performance. The results also reveal that some of the proposed schemes outperform others in anomaly detection, particularly in scenarios where out-of-control observations are attributed to shifts in a small subset of variables, as measured by overall performance metrics. The proposed schemes are beneficial for establishing a reference sample and developing an IC model for subsequent Phase II monitoring. Two case studies using real-world data are presented to illustrate the implementation and interpretation of the proposed schemes.
在工业质量控制领域,多变量和高维过程的回顾性分析已引起越来越多的关注。在这种复杂的第一阶段设置中,关于潜在过程分布的先验信息通常是稀缺的,非参数方法特别有价值。然而,对非参数多变量第一阶段分析的研究仍然相对有限,大多数现有研究只集中于监测潜在分布的单一特征。主成分分析(PCA)是一种基本的降维和特征提取技术,在非参数II期监测中得到了广泛的应用。然而,它在第一阶段分析中的潜力尚未得到充分利用。为了解决这一差距,本文介绍了几种新的第一阶段方案,这些方案通过不同的集成策略将PCA与有效的单变量第一阶段过程集成在一起。这些方案能够同时监测任何未知的多变量分布的位置和尺度参数。大量的蒙特卡罗仿真研究表明,所提出的方案具有鲁棒的控制(IC)性能。结果还表明,一些提出的方案在异常检测方面优于其他方案,特别是在失控观测归因于一小部分变量的变化的情况下,如总体性能指标所衡量的那样。建议的方案有利于建立参考样本和开发IC模型,以进行后续的第二阶段监测。本文提出了两个使用真实世界数据的案例研究,以说明所提出方案的实施和解释。
{"title":"Nonparametric Phase I analysis of multivariate data using PCA for industrial quality control","authors":"Xi Zhang ,&nbsp;Amitava Mukherjee ,&nbsp;Chenglong Li ,&nbsp;Shurong Tong","doi":"10.1016/j.cie.2025.111787","DOIUrl":"10.1016/j.cie.2025.111787","url":null,"abstract":"<div><div>The retrospective analysis of multivariate and high-dimensional processes in Phase I has garnered increasing attention in the field of industrial quality control. In such complex Phase I settings, where prior information about the underlying process distribution is often scarce, nonparametric methods are particularly valuable. However, research on nonparametric multivariate Phase I analysis remains relatively limited, with most existing studies concentrating on monitoring only a single feature of the underlying distribution. Principal Component Analysis (PCA), a fundamental technique for dimensionality reduction and feature extraction, has been widely adopted in nonparametric Phase II monitoring; however, its potential for Phase I analysis is not yet fully exploited. To address this gap, this paper introduces several novel Phase I schemes that integrate PCA with effective univariate Phase I procedures through different integration strategies. These schemes enable simultaneous monitoring of both location and scale parameters for any unknown multivariate distribution. Extensive Monte Carlo simulation studies demonstrate that the proposed schemes exhibit robust in-control (IC) performance. The results also reveal that some of the proposed schemes outperform others in anomaly detection, particularly in scenarios where out-of-control observations are attributed to shifts in a small subset of variables, as measured by overall performance metrics. The proposed schemes are beneficial for establishing a reference sample and developing an IC model for subsequent Phase II monitoring. Two case studies using real-world data are presented to illustrate the implementation and interpretation of the proposed schemes.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111787"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885436","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}
引用次数: 0
Pandemic resilience through subway-based multi-center logistics: an immune genetic approach 基于地铁的多中心物流的大流行复原力:免疫遗传方法
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111792
Siqian Cheng, Jiankun Hu, Youfang Huang
The COVID-19 pandemic has underscored significant vulnerabilities in traditional road-based urban logistics systems under stringent lockdown conditions, prompting the exploration of alternative logistics solutions. This study proposes a novel Metro-based Underground Logistics System (M−ULS) to effectively manage emergency logistics during pandemics by leveraging existing subway infrastructure. We developed a multi-distribution center location optimization model integrating critical factors such as traffic flow, delivery time, service coverage, and cost efficiency. An immune genetic algorithm was adopted to solve this multi-objective model efficiently. Comparative analyses with conventional road logistics demonstrated that the M−ULS substantially improved distribution speed and reliability, achieving up to 90% efficiency in service delivery within high-risk zones. A practical application using a Shanghai case study further confirmed the model’s benefits, highlighting reduced delays and enhanced urban supply chain resilience. The proposed subway-based logistics system offers a systematic and innovative approach for urban planners and public health authorities to enhance emergency preparedness, representing a meaningful advancement in the field of urban logistics and epidemic response strategies.
2019冠状病毒病大流行凸显了严格封锁条件下传统道路城市物流系统的重大脆弱性,促使人们探索替代物流解决方案。本研究提出了一种新的基于地铁的地下物流系统(M - ULS),通过利用现有的地铁基础设施,有效地管理流行病期间的应急物流。我们开发了一个综合交通流量、交货时间、服务覆盖范围和成本效率等关键因素的多配送中心选址优化模型。采用免疫遗传算法对该多目标模型进行有效求解。与传统公路物流的对比分析表明,M - ULS大大提高了配送速度和可靠性,在高风险地区实现了高达90%的服务交付效率。上海案例研究的实际应用进一步证实了该模型的好处,突出了减少延误和增强城市供应链弹性。拟议的基于地铁的物流系统为城市规划者和公共卫生当局提供了一种系统和创新的方法来加强应急准备,代表了城市物流和流行病应对战略领域的有意义的进步。
{"title":"Pandemic resilience through subway-based multi-center logistics: an immune genetic approach","authors":"Siqian Cheng,&nbsp;Jiankun Hu,&nbsp;Youfang Huang","doi":"10.1016/j.cie.2025.111792","DOIUrl":"10.1016/j.cie.2025.111792","url":null,"abstract":"<div><div>The COVID-19 pandemic has underscored significant vulnerabilities in traditional road-based urban logistics systems under stringent lockdown conditions, prompting the exploration of alternative logistics solutions. This study proposes a novel Metro-based Underground Logistics System (M−ULS) to effectively manage emergency logistics during pandemics by leveraging existing subway infrastructure. We developed a multi-distribution center location optimization model integrating critical factors such as traffic flow, delivery time, service coverage, and cost efficiency. An immune genetic algorithm was adopted to solve this multi-objective model efficiently. Comparative analyses with conventional road logistics demonstrated that the M−ULS substantially improved distribution speed and reliability, achieving up to 90% efficiency in service delivery within high-risk zones. A practical application using a Shanghai case study further confirmed the model’s benefits, highlighting reduced delays and enhanced urban supply chain resilience. The proposed subway-based logistics system offers a systematic and innovative approach for urban planners and public health authorities to enhance emergency preparedness, representing a meaningful advancement in the field of urban logistics and epidemic response strategies.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111792"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927272","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}
引用次数: 0
Consensus reaching framework for maximum expert consensus with uncertain asymmetric Costs: A data-driven robust approach 具有不确定非对称成本的最大专家共识达成框架:数据驱动的稳健方法
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111781
Qiuyu Yu , Liang Chang , Shaojian Qu , Ying Ji
The maximum expert consensus model (MECM) has emerged as a pivotal framework for group decision-making (GDM) under uncertainty. However, traditional MECM often neglects asymmetric adjustment costs, dynamic opinion evolution, and hybrid uncertainty structures. To overcome these deficiencies, this paper develops the MECM framework that integrates asymmetric costs, linear uncertainty distribution consensus thresholds, and hybrid uncertainty sets. A dynamic weight-driven adjustment mechanism is introduced to refine non-consensus opinions and improve convergence efficiency. Building upon this, a data-driven robust MECM is proposed, which employs historical data for quantifiable decision support. The proposed framework is empirically validated through a carbon quota negotiation case involving eight Chinese regions. Results confirm that the model effectively balances economic efficiency, consensus quality, and collective acceptability while maintaining robustness under uncertain conditions. Sensitivity and comparative analyses further demonstrate the flexibility and practical feasibility of the proposed framework relative to conventional consensus optimization models.
专家最大共识模型(MECM)已成为不确定条件下群体决策的关键框架。然而,传统的MECM往往忽略了不对称调整成本、动态意见演变和混合不确定性结构。为了克服这些不足,本文开发了集成不对称成本、线性不确定性分布共识阈值和混合不确定性集的MECM框架。引入动态权重驱动的调整机制,对非一致意见进行细化,提高收敛效率。在此基础上,提出了一种数据驱动的鲁棒MECM,该MECM利用历史数据提供可量化的决策支持。通过一个涉及中国8个地区的碳配额谈判案例,对所提出的框架进行了实证验证。结果证实,该模型有效地平衡了经济效率、共识质量和集体可接受性,同时在不确定条件下保持鲁棒性。灵敏度分析和对比分析进一步证明了该框架相对于传统共识优化模型的灵活性和实际可行性。
{"title":"Consensus reaching framework for maximum expert consensus with uncertain asymmetric Costs: A data-driven robust approach","authors":"Qiuyu Yu ,&nbsp;Liang Chang ,&nbsp;Shaojian Qu ,&nbsp;Ying Ji","doi":"10.1016/j.cie.2025.111781","DOIUrl":"10.1016/j.cie.2025.111781","url":null,"abstract":"<div><div>The maximum expert consensus model (MECM) has emerged as a pivotal framework for group decision-making (GDM) under uncertainty. However, traditional MECM often neglects asymmetric adjustment costs, dynamic opinion evolution, and hybrid uncertainty structures. To overcome these deficiencies, this paper develops the MECM framework that integrates asymmetric costs, linear uncertainty distribution consensus thresholds, and hybrid uncertainty sets. A dynamic weight-driven adjustment mechanism is introduced to refine non-consensus opinions and improve convergence efficiency. Building upon this, a data-driven robust MECM is proposed, which employs historical data for quantifiable decision support. The proposed framework is empirically validated through a carbon quota negotiation case involving eight Chinese regions. Results confirm that the model effectively balances economic efficiency, consensus quality, and collective acceptability while maintaining robustness under uncertain conditions. Sensitivity and comparative analyses further demonstrate the flexibility and practical feasibility of the proposed framework relative to conventional consensus optimization models.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111781"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145977756","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}
引用次数: 0
Metaheuristic optimization for scheduling mixed-fleet electric buses in a practical urban network 实际城市网络中混合车队电动公交车调度的元启发式优化
IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-26 DOI: 10.1016/j.cie.2025.111782
Tommaso Bosi, Marco Rinaldi, Andrea D’Ariano, Francesco Viti
This study addresses the scalability challenges of the Mixed-Fleet Multi-Terminal Electric Bus Scheduling Problem by exploring various heuristic and metaheuristic approaches applied to large urban networks. A novel Repeated Local Search (RLS) algorithm is developed to optimize full-day scheduling, incorporating key factors such as fleet assignment, charging constraints, and deadheading costs, while accounting for limited charging infrastructure. The RLS method generates initial greedy yet feasible schedules for a mixed fleet of electric and hybrid buses, serving as the foundation for two metaheuristic strategies: Simulated Annealing and a Genetic Algorithm. The Simulated Annealing approach is implemented in two variants: one integrating a Mixed-Integer Linear Programming (MILP)-based move, and the other using an RLS-based move to reschedule trip chains while maintaining feasibility. Meanwhile, the Genetic Algorithm employs repair mechanisms to correct infeasible solutions arising during the crossover process. To evaluate these methodologies, a three-phase experimental framework is employed: (1) stress-testing a MILP model under various fleet and infrastructure conditions, (2) benchmarking MILP performance against metaheuristic methods on small-scale instances, and (3) conducting a comparative analysis of metaheuristics across small, medium, and real-size urban scenarios. The urban-scale instances are derived from real-world public transit timetables in Luxembourg City, encompassing 1,084 trips, 12 terminals, 10 bus lines, and full-day operations. Results indicate that the proposed metaheuristic approaches achieve solutions comparable to exact MILP formulations in small-scale cases while offering substantial scalability improvements for larger networks. Each algorithm exhibits distinct advantages and trade-offs, highlighting the importance of selecting an appropriate method based on the specific scenario and computational constraints. These findings extend prior research on smaller instances and suggest that as urban transit systems transition to electric fleets, the marginal operational benefits for transit agencies may diminish with increasing network size.
本研究通过探索应用于大型城市网络的各种启发式和元启发式方法,解决了混合车队多终端电动巴士调度问题的可扩展性挑战。提出了一种新的重复局部搜索(RLS)算法,在考虑有限的充电基础设施的情况下,将车队分配、充电约束和死头成本等关键因素结合起来,优化全天调度。RLS方法生成了电动和混合动力公交车混合车队的初始贪婪且可行的调度,为模拟退火和遗传算法两种元启发式策略奠定了基础。模拟退火方法有两种变体:一种集成了基于混合整数线性规划(MILP)的移动,另一种使用基于rls的移动来重新安排行程链,同时保持可行性。同时,遗传算法采用修复机制对交叉过程中产生的不可行解进行修正。为了评估这些方法,采用了一个三阶段的实验框架:(1)在各种车队和基础设施条件下对MILP模型进行压力测试;(2)在小规模实例中对MILP性能与元启发式方法进行基准测试;(3)在小型、中型和实际规模的城市场景中对元启发式方法进行比较分析。城市规模的实例来源于卢森堡市真实的公共交通时间表,包括1,084次行程,12个终点站,10条公交线路和全天运营。结果表明,提出的元启发式方法在小规模情况下实现了与精确的MILP公式相当的解决方案,同时为大型网络提供了实质性的可扩展性改进。每种算法都显示出不同的优点和权衡,突出了基于特定场景和计算约束选择适当方法的重要性。这些发现扩展了先前对较小实例的研究,并表明随着城市交通系统向电动车队过渡,交通机构的边际运营效益可能会随着网络规模的增加而减少。
{"title":"Metaheuristic optimization for scheduling mixed-fleet electric buses in a practical urban network","authors":"Tommaso Bosi,&nbsp;Marco Rinaldi,&nbsp;Andrea D’Ariano,&nbsp;Francesco Viti","doi":"10.1016/j.cie.2025.111782","DOIUrl":"10.1016/j.cie.2025.111782","url":null,"abstract":"<div><div>This study addresses the scalability challenges of the Mixed-Fleet Multi-Terminal Electric Bus Scheduling Problem by exploring various heuristic and metaheuristic approaches applied to large urban networks. A novel Repeated Local Search (RLS) algorithm is developed to optimize full-day scheduling, incorporating key factors such as fleet assignment, charging constraints, and deadheading costs, while accounting for limited charging infrastructure. The RLS method generates initial greedy yet feasible schedules for a mixed fleet of electric and hybrid buses, serving as the foundation for two metaheuristic strategies: Simulated Annealing and a Genetic Algorithm. The Simulated Annealing approach is implemented in two variants: one integrating a Mixed-Integer Linear Programming (MILP)-based move, and the other using an RLS-based move to reschedule trip chains while maintaining feasibility. Meanwhile, the Genetic Algorithm employs repair mechanisms to correct infeasible solutions arising during the crossover process. To evaluate these methodologies, a three-phase experimental framework is employed: (1) stress-testing a MILP model under various fleet and infrastructure conditions, (2) benchmarking MILP performance against metaheuristic methods on small-scale instances, and (3) conducting a comparative analysis of metaheuristics across small, medium, and real-size urban scenarios. The urban-scale instances are derived from real-world public transit timetables in Luxembourg City, encompassing 1,084 trips, 12 terminals, 10 bus lines, and full-day operations. Results indicate that the proposed metaheuristic approaches achieve solutions comparable to exact MILP formulations in small-scale cases while offering substantial scalability improvements for larger networks. Each algorithm exhibits distinct advantages and trade-offs, highlighting the importance of selecting an appropriate method based on the specific scenario and computational constraints. These findings extend prior research on smaller instances and suggest that as urban transit systems transition to electric fleets, the marginal operational benefits for transit agencies may diminish with increasing network size.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"213 ","pages":"Article 111782"},"PeriodicalIF":6.5,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885430","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}
引用次数: 0
期刊
Computers & Industrial Engineering
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1