首页 > 最新文献

Transportation Research Part E-Logistics and Transportation Review最新文献

英文 中文
Global maritime embedded carbon flow network: Key factors and formation mechanism 全球海洋嵌入式碳流网络:关键因素与形成机制
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104647
Liang Zhao , Zhenggang He
International maritime transportation is a major yet complex source of greenhouse-gas emissions, whose systemic drivers and network formation mechanisms are not fully captured by existing, often isolated, methodologies. To bridge this gap, this study develops a multi-scale, integrated analytical framework. We first employ an environmentally extended multi-region input–output model to quantify global maritime embedded carbon flows (2000–2020). We then combine a high-precision machine-learning model (MLP) with SHapley Additive exPlanations (SHAP) analysis to identify key drivers, and finally apply a weighted exponential random-graph model to uncover network generative mechanisms. Our analysis yields three pivotal insights that offer new perspectives beyond conventional approaches: (1) The global flow network exhibits a polarized core–periphery structure centered on major hubs like China, Singapore, and the United States. (2) Bilateral flow intensity is primarily driven by asymmetric economic structures, operating through robust nonlinear (e.g., U-shaped, inverted U-shaped) channels rather than linear relationships. (3) Network formation is co-driven by homophily in consumption and heterophily in industrial structure, with geographic distance a persistent barrier. These findings directly inform international climate policy: they advocate for expanding emission responsibility to include major consumer nations and logistics hubs, and call for policies that account for the nonlinear, structural drivers of carbon exchange. The machine learning code and data have been uploaded to GitHub. URL: https://github.com/zhaoliangovo/Project-of-global-maritime-embedded-carbon-flow-network.
国际海上运输是温室气体排放的一个主要而复杂的来源,其系统性驱动因素和网络形成机制并没有被现有的、往往是孤立的方法完全捕捉到。为了弥补这一差距,本研究开发了一个多尺度、集成的分析框架。我们首先采用环境扩展的多区域投入产出模型来量化全球海洋隐含碳流(2000-2020)。然后,我们将高精度机器学习模型(MLP)与SHapley加性解释(SHAP)分析相结合,以确定关键驱动因素,最后应用加权指数随机图模型来揭示网络生成机制。我们的分析得出了三个关键的见解,提供了超越传统方法的新视角:(1)全球流动网络呈现出以中国、新加坡和美国等主要枢纽为中心的两极分化的核心-外围结构。(2)双边流动强度主要由不对称经济结构驱动,通过鲁棒非线性(如u型、倒u型)通道而不是线性关系运行。(3)消费同质性和产业结构异质性共同驱动网络形成,地理距离是网络形成的持久障碍。这些发现直接影响了国际气候政策:他们主张扩大排放责任,将主要消费国和物流中心包括在内,并呼吁制定考虑碳交换非线性结构性驱动因素的政策。机器学习代码和数据已经上传到GitHub。URL: https://github.com/zhaoliangovo/Project-of-global-maritime-embedded-carbon-flow-network。
{"title":"Global maritime embedded carbon flow network: Key factors and formation mechanism","authors":"Liang Zhao ,&nbsp;Zhenggang He","doi":"10.1016/j.tre.2025.104647","DOIUrl":"10.1016/j.tre.2025.104647","url":null,"abstract":"<div><div>International maritime transportation is a major yet complex source of greenhouse-gas emissions, whose systemic drivers and network formation mechanisms are not fully captured by existing, often isolated, methodologies. To bridge this gap, this study develops a multi-scale, integrated analytical framework. We first employ an environmentally extended multi-region input–output model to quantify global maritime embedded carbon flows (2000–2020). We then combine a high-precision machine-learning model (MLP) with SHapley Additive exPlanations (SHAP) analysis to identify key drivers, and finally apply a weighted exponential random-graph model to uncover network generative mechanisms. Our analysis yields three pivotal insights that offer new perspectives beyond conventional approaches: (1) The global flow network exhibits a polarized core–periphery structure centered on major hubs like China, Singapore, and the United States. (2) Bilateral flow intensity is primarily driven by asymmetric economic structures, operating through robust nonlinear (e.g., U-shaped, inverted U-shaped) channels rather than linear relationships. (3) Network formation is co-driven by homophily in consumption and heterophily in industrial structure, with geographic distance a persistent barrier. These findings directly inform international climate policy: they advocate for expanding emission responsibility to include major consumer nations and logistics hubs, and call for policies that account for the nonlinear, structural drivers of carbon exchange. The machine learning code and data have been uploaded to GitHub. URL: <span><span>https://github.com/zhaoliangovo/Project-of-global-maritime-embedded-carbon-flow-network</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104647"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841515","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
Cost allocation in a robust two-stage resource allocation game: Fairness and robustness 鲁棒两阶段资源分配博弈中的成本分配:公平性与鲁棒性
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104633
Menghang Wang, Lan Lu, Lindong Liu, Jie Wu
This paper considers a two-stage resource allocation game within a cooperative game framework from a platform perspective, where the customers’ demands are uncertain. To incentivize all customers (players) into the grand coalition for joint cost sharing in resource allocation, a critical issue for the platform is determining a fair and robust cost allocation solution. To address the challenge, we introduce the concept of the strict robust core to the operations research (OR) game with constraints and propose the Two-stage Resource Allocation-Robust Cost Sharing Problem (TRA-RCSP). Our approach integrates distributionally robust optimization (DRO) and distributionally favorable optimization (DFO) to improve computational tractability. By leveraging the polyhedral ambiguity set to model demand uncertainty, we calculate the worst-case cost for grand coalition and the best-case costs for subcoalitions. Additionally, we develop an iterative constraint generation algorithm to mitigate the exponential growth of constraints in TRA-RCSP. Numerical experiments demonstrate that our algorithm achieves excellent computational efficiency and the strict robust core significantly outperforms the cost allocation of SAA model across both robustness performance metrics, ensuring the formation of the grand cooperation and its long-term stability under uncertain demands.
本文从平台的角度考虑了合作博弈框架下客户需求不确定的两阶段资源分配博弈。为了激励所有客户(玩家)加入大联盟,共同分担资源分配的成本,平台的一个关键问题是确定一个公平而稳健的成本分配解决方案。为了解决这一挑战,我们将严格鲁棒核心的概念引入到具有约束的运筹学博弈中,并提出了两阶段资源分配-鲁棒成本分担问题(TRA-RCSP)。我们的方法集成了分布鲁棒优化(DRO)和分布有利优化(DFO)来提高计算可追溯性。通过利用多面体模糊集来模拟需求不确定性,我们计算了大联盟的最坏情况成本和次联盟的最佳情况成本。此外,我们开发了一种迭代约束生成算法来缓解TRA-RCSP中约束的指数增长。数值实验表明,我们的算法具有优异的计算效率,严格的鲁棒核心在鲁棒性能指标上都明显优于SAA模型的成本分配,保证了大合作的形成及其在不确定需求下的长期稳定性。
{"title":"Cost allocation in a robust two-stage resource allocation game: Fairness and robustness","authors":"Menghang Wang,&nbsp;Lan Lu,&nbsp;Lindong Liu,&nbsp;Jie Wu","doi":"10.1016/j.tre.2025.104633","DOIUrl":"10.1016/j.tre.2025.104633","url":null,"abstract":"<div><div>This paper considers a two-stage resource allocation game within a cooperative game framework from a platform perspective, where the customers’ demands are uncertain. To incentivize all customers (players) into the grand coalition for joint cost sharing in resource allocation, a critical issue for the platform is determining a fair and robust cost allocation solution. To address the challenge, we introduce the concept of the strict robust core to the operations research (OR) game with constraints and propose the Two-stage Resource Allocation-Robust Cost Sharing Problem (TRA-RCSP). Our approach integrates distributionally robust optimization (DRO) and distributionally favorable optimization (DFO) to improve computational tractability. By leveraging the polyhedral ambiguity set to model demand uncertainty, we calculate the worst-case cost for grand coalition and the best-case costs for subcoalitions. Additionally, we develop an iterative constraint generation algorithm to mitigate the exponential growth of constraints in TRA-RCSP. Numerical experiments demonstrate that our algorithm achieves excellent computational efficiency and the strict robust core significantly outperforms the cost allocation of SAA model across both robustness performance metrics, ensuring the formation of the grand cooperation and its long-term stability under uncertain demands.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104633"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145845136","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
Transforming maritime supply chains through digital port policies considering ESG: an evolutionary game theoretical framework with empirical analysis 考虑ESG的数字港口政策转型海上供应链:一个演化博弈理论框架与实证分析
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104648
Shangsong Long , Hui Zhao , Dan Zhu
Recent years have witnessed the growing influence of emerging digital port policies (DPPs) on the maritime shipping industry. These policies have had mixed impacts on firms’ profitability, with the effects varying according to their ESG (Environmental, Social, and Governance) profiles. Motivated by this, this study investigates how DPPs affect port and carrier profits under different ESG conditions. We employ two main approaches: (1) a government–firm evolutionary game theoretical framework with ESG heterogeneity, and (2) empirical analysis based on event study methodology. The theoretical models reveal optimal DPP strategies for governments and identify two stable ESG-related equilibria under varying market scenarios. Key factors such as tax rate and cost coefficient are found to influence equilibrium outcomes. Empirically, we analyze 129 listed maritime firms in China’s A-share market and compare two representative DPPs issued in 2019 and 2023. Results show that the 2019 policy had a negative impact on firm profitability, whereas the 2023 policy produced a positive effect. This phenomenon is consistent with the predictions derived from our theoretical models. Finally, we find that a firm’s ESG level plays a positive moderating role in the relationship between DPPs and firm performance. These findings can provide useful implications for the development and refinement of digital port policies.
近年来,新兴的数字港口政策(dpp)对海运业的影响越来越大。这些政策对公司的盈利能力产生了复杂的影响,其影响因其ESG(环境、社会和治理)概况而异。基于此,本研究探讨了不同ESG条件下dpp对港口和承运人利润的影响。本文主要采用两种方法:(1)考虑ESG异质性的政府-企业演化博弈理论框架;(2)基于事件研究方法的实证分析。理论模型揭示了政府的最优DPP策略,并在不同的市场情景下确定了两个稳定的esg相关均衡。发现了影响均衡结果的关键因素,如税率和成本系数。实证分析了中国a股129家海运上市公司,并比较了2019年和2023年发行的两个具有代表性的dpp。结果表明,2019年政策对企业盈利能力产生了负面影响,而2023年政策对企业盈利能力产生了积极影响。这一现象与我们的理论模型的预测是一致的。最后,我们发现企业ESG水平在dpp与企业绩效的关系中起到正向调节作用。这些发现可以为数字港口政策的制定和完善提供有用的启示。
{"title":"Transforming maritime supply chains through digital port policies considering ESG: an evolutionary game theoretical framework with empirical analysis","authors":"Shangsong Long ,&nbsp;Hui Zhao ,&nbsp;Dan Zhu","doi":"10.1016/j.tre.2025.104648","DOIUrl":"10.1016/j.tre.2025.104648","url":null,"abstract":"<div><div>Recent years have witnessed the growing influence of emerging digital port policies (DPPs) on the maritime shipping industry. These policies have had mixed impacts on firms’ profitability, with the effects varying according to their ESG (Environmental, Social, and Governance) profiles. Motivated by this, this study investigates how DPPs affect port and carrier profits under different ESG conditions. We employ two main approaches: (1) a government–firm evolutionary game theoretical framework with ESG heterogeneity, and (2) empirical analysis based on event study methodology. The theoretical models reveal optimal DPP strategies for governments and identify two stable ESG-related equilibria under varying market scenarios. Key factors such as tax rate and cost coefficient are found to influence equilibrium outcomes. Empirically, we analyze 129 listed maritime firms in China’s A-share market and compare two representative DPPs issued in 2019 and 2023. Results show that the 2019 policy had a negative impact on firm profitability, whereas the 2023 policy produced a positive effect. This phenomenon is consistent with the predictions derived from our theoretical models. Finally, we find that a firm’s ESG level plays a positive moderating role in the relationship between DPPs and firm performance. These findings can provide useful implications for the development and refinement of digital port policies.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104648"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145842054","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
Bus priority: lane-based pre-timed signal timing with buses in different directions at isolated intersections 总线优先:基于车道的预先定时信号配时,不同方向的总线在孤立的交叉路口
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104638
Hui Jin , Yueqi Shu , Pengli Mo , Zhiyuan Liu , Haiming Hao , Daiheng Ni
The existing research on bus signal priority (BSP) with exclusive bus lane (EBL) often assumes that all buses travel straight through, neglecting the presence of turning buses. This oversight can lead to the issues such as BSP green time waste and traffic conflicts with buses turning, resulting in delays and safety concerns. This research investigates the applicability of BSP and EBL combined with lane-based pre-timed signal timing at isolated intersections to accommodate bus and car movements to various directions. By considering the constraints related to lane markings, signal timing, and traffic flow saturation, we develop the models aimed at maximizing passenger throughput and minimizing passenger delay, specifically through mixed-integer linear programming (MILP) and mixed-integer nonlinear programming (MINLP), respectively. The branch-and-bound method is adopted to solve the MILP, while the extended cutting plane method is employed to solve the MINLP with convexity validation against specified lane assignment. To enhance computational efficiency, three acceleration strategies of surrogate model, branch pruning, and parallel computation are implemented for the MINLP. Case studies reveal that EBL is not adopted even bus ratio is high up to 56.5%, different from the previous research on BSP and EBL that assumes all buses travel straight. In contrast, when left- or right- turning cars are prohibited at the target intersection, BSP and EBL are always adopted to enhance passenger throughput by 6% to 15%, or reduce passenger delay by 9% to 21%. This study contributes to the redesign of BSP and EBL for intersection efficiency maximization when buses are allowed to make turns.
现有的公交专用道(EBL)下的公交信号优先(BSP)研究通常假设所有的公交都是直行的,忽略了转弯的存在。这种疏忽可能会导致诸如BSP绿色时间浪费和公共汽车转弯时的交通冲突等问题,从而导致延误和安全问题。本研究探讨了BSP和EBL与基于车道的预定时信号配时在孤立路口的适用性,以适应不同方向的公共汽车和汽车运动。通过考虑与车道标记、信号配时和交通流饱和度相关的约束,我们分别通过混合整数线性规划(MILP)和混合整数非线性规划(MINLP)开发了旨在最大化乘客吞吐量和最小化乘客延误的模型。该算法采用分支定界法求解MILP,采用扩展切割平面法求解针对指定车道分配的凸性验证MINLP。为了提高计算效率,采用了代理模型、分支剪枝和并行计算三种加速策略。案例研究表明,即使公交比例高达56.5%,也不采用EBL,这与以往对BSP和EBL的研究假设所有公交都是直线行驶不同。当目标交叉口禁止左转或右转车辆时,通常采用BSP和EBL,使乘客吞吐量提高6% ~ 15%,或使乘客延误减少9% ~ 21%。本文的研究有助于在允许公交转弯的情况下,对交叉口效率最大化的BSP和EBL进行重新设计。
{"title":"Bus priority: lane-based pre-timed signal timing with buses in different directions at isolated intersections","authors":"Hui Jin ,&nbsp;Yueqi Shu ,&nbsp;Pengli Mo ,&nbsp;Zhiyuan Liu ,&nbsp;Haiming Hao ,&nbsp;Daiheng Ni","doi":"10.1016/j.tre.2025.104638","DOIUrl":"10.1016/j.tre.2025.104638","url":null,"abstract":"<div><div>The existing research on bus signal priority (BSP) with exclusive bus lane (EBL) often assumes that all buses travel straight through, neglecting the presence of turning buses. This oversight can lead to the issues such as BSP green time waste and traffic conflicts with buses turning, resulting in delays and safety concerns. This research investigates the applicability of BSP and EBL combined with lane-based pre-timed signal timing at isolated intersections to accommodate bus and car movements to various directions. By considering the constraints related to lane markings, signal timing, and traffic flow saturation, we develop the models aimed at maximizing passenger throughput and minimizing passenger delay, specifically through mixed-integer linear programming (MILP) and mixed-integer nonlinear programming (MINLP), respectively. The branch-and-bound method is adopted to solve the MILP, while the extended cutting plane method is employed to solve the MINLP with convexity validation against specified lane assignment. To enhance computational efficiency, three acceleration strategies of surrogate model, branch pruning, and parallel computation are implemented for the MINLP. Case studies reveal that EBL is not adopted even bus ratio is high up to 56.5%, different from the previous research on BSP and EBL that assumes all buses travel straight. In contrast, when left- or right- turning cars are prohibited at the target intersection, BSP and EBL are always adopted to enhance passenger throughput by 6% to 15%, or reduce passenger delay by 9% to 21%. This study contributes to the redesign of BSP and EBL for intersection efficiency maximization when buses are allowed to make turns.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104638"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145842053","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
Revealing implicit competition and functional similarity in trade-logistics networks 揭示贸易物流网络中的隐性竞争与功能相似性
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104650
Heng Yong , Yu Yang , Haiping Zhang , Lu Zhang , Jiazheng Chen , Jinzhao Guo
Analyzing interaction relationships and patterns among participants within large-scale complex trade logistics networks can reveal role differentiation, interaction strategies, and latent risks inherent in network systems. Current research predominantly focuses on explicit direct relationships, lacking sufficient understanding of the implicit indirect relationships driven by shared nodes. Such indirect relationships in trade logistics networks carry dual connotations: (1) potential competition between two trade entities sharing the same market, and (2) a functional similarity between them arising from serving the same market. However, existing research is often limited to a singular competition perspective, and its quantification metrics, relying on absolute flows, struggle to measure the true strategic dependence between trade entities. To address this gap, this study introduces the concept of the mediator subgraph as a structured network unit. It proposes a novel statistic based on relative importance to quantify these two indirect relationships and assesses their statistical significance via a permutation test. Building on this, four fundamental interaction patterns are identified from the combination of the strength and significance of these two relationships. The framework’s effectiveness is validated through synthetic data experiments and then applied to the 2013–2023 global crude oil trade network. Results show that the evolution of the indirect relationship network, guided by key players as shared nodes (e.g., Russia and China), highly corresponds with concurrent geopolitical dynamics. This research provides a novel perspective and analytical tool for understanding complex implicit interactions among trade entities, contributing to more precise guidance for trade policy formulation and supply chain optimization.
分析大型复杂贸易物流网络中参与者之间的互动关系和模式,可以揭示网络系统中的角色分化、互动策略和潜在风险。目前的研究主要集中在显性直接关系上,缺乏对共享节点驱动的隐性间接关系的充分理解。贸易物流网络中的这种间接关系具有双重内涵:(1)共享同一市场的两个贸易实体之间的潜在竞争;(2)由于服务于同一市场而产生的功能相似性。然而,现有的研究往往局限于单一的竞争视角,其量化指标依赖于绝对流量,难以衡量贸易实体之间真正的战略依赖。为了解决这一差距,本研究引入了中介子图作为结构化网络单元的概念。提出了一种新的基于相对重要性的统计量来量化这两种间接关系,并通过排列检验来评估它们的统计显著性。在此基础上,从这两种关系的强度和重要性的组合中确定了四种基本的交互模式。通过综合数据实验验证了该框架的有效性,并将其应用于2013-2023年全球原油贸易网络。结果表明,以关键参与者(如俄罗斯和中国)为共享节点的间接关系网络的演变与并发的地缘政治动态高度对应。本研究为理解贸易主体之间复杂的隐性相互作用提供了新的视角和分析工具,有助于为贸易政策制定和供应链优化提供更精确的指导。
{"title":"Revealing implicit competition and functional similarity in trade-logistics networks","authors":"Heng Yong ,&nbsp;Yu Yang ,&nbsp;Haiping Zhang ,&nbsp;Lu Zhang ,&nbsp;Jiazheng Chen ,&nbsp;Jinzhao Guo","doi":"10.1016/j.tre.2025.104650","DOIUrl":"10.1016/j.tre.2025.104650","url":null,"abstract":"<div><div>Analyzing interaction relationships and patterns among participants within large-scale complex trade logistics networks can reveal role differentiation, interaction strategies, and latent risks inherent in network systems. Current research predominantly focuses on explicit direct relationships, lacking sufficient understanding of the implicit indirect relationships driven by shared nodes. Such indirect relationships in trade logistics networks carry dual connotations: (1) potential competition between two trade entities sharing the same market, and (2) a functional similarity between them arising from serving the same market. However, existing research is often limited to a singular competition perspective, and its quantification metrics, relying on absolute flows, struggle to measure the true strategic dependence between trade entities. To address this gap, this study introduces the concept of the mediator subgraph as a structured network unit. It proposes a novel statistic based on relative importance to quantify these two indirect relationships and assesses their statistical significance via a permutation test. Building on this, four fundamental interaction patterns are identified from the combination of the strength and significance of these two relationships. The framework’s effectiveness is validated through synthetic data experiments and then applied to the 2013–2023 global crude oil trade network. Results show that the evolution of the indirect relationship network, guided by key players as shared nodes (e.g., Russia and China), highly corresponds with concurrent geopolitical dynamics. This research provides a novel perspective and analytical tool for understanding complex implicit interactions among trade entities, contributing to more precise guidance for trade policy formulation and supply chain optimization.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104650"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841514","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
Refresh retail: Value of near-expired food commercialization 更新零售:近过期食品商业化的价值
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104630
Zhengwei Lyu , Hongjie Lan , Guowei Hua , Shuai Liu , T.C.E. Cheng
This study addresses the strategic dilemma faced by fresh-food retailers in combating food waste through near-expired food commercialization, comparing direct and outsourced schemes. While both approaches effectively reduce waste, their advantages remain unclear under demand uncertainty. We develop a two-period dynamic game model to elucidate the commercialization process. Our findings indicate that, despite differing operational decisions, both schemes can enhance sales and profitability when the quantity of near-expired food is low. The direct scheme primarily optimizes economic returns from near-expired food, while the outsourced scheme protects the fresh food market. The choice of the preferable scheme largely hinges on the quantity of near-expired food generated. In addition, sensitivity analyses of key supply and demand parameters reinforce the robustness of our findings and provide new insights under specific conditions, contributing to the literature and offering actionable strategies for practitioners managing near-expired food commercialization.
本研究探讨了新鲜食品零售商在通过近过期食品商业化打击食物浪费方面所面临的战略困境,并比较了直接和外包计划。虽然这两种方法都有效地减少了浪费,但在需求不确定的情况下,它们的优势尚不清楚。我们建立了一个两期动态博弈模型来解释商业化过程。我们的研究结果表明,尽管运营决策不同,但当临近过期食品数量较少时,这两种方案都可以提高销售和盈利能力。直接方案主要是优化近过期食品的经济回报,而外包方案则保护新鲜食品市场。更可取的方案的选择在很大程度上取决于生产的近过期食品的数量。此外,对关键供需参数的敏感性分析增强了我们研究结果的稳健性,并在特定条件下提供了新的见解,为文献做出了贡献,并为从业者管理近过期食品商业化提供了可操作的策略。
{"title":"Refresh retail: Value of near-expired food commercialization","authors":"Zhengwei Lyu ,&nbsp;Hongjie Lan ,&nbsp;Guowei Hua ,&nbsp;Shuai Liu ,&nbsp;T.C.E. Cheng","doi":"10.1016/j.tre.2025.104630","DOIUrl":"10.1016/j.tre.2025.104630","url":null,"abstract":"<div><div>This study addresses the strategic dilemma faced by fresh-food retailers in combating food waste through near-expired food commercialization, comparing direct and outsourced schemes. While both approaches effectively reduce waste, their advantages remain unclear under demand uncertainty. We develop a two-period dynamic game model to elucidate the commercialization process. Our findings indicate that, despite differing operational decisions, both schemes can enhance sales and profitability when the quantity of near-expired food is low. The direct scheme primarily optimizes economic returns from near-expired food, while the outsourced scheme protects the fresh food market. The choice of the preferable scheme largely hinges on the quantity of near-expired food generated. In addition, sensitivity analyses of key supply and demand parameters reinforce the robustness of our findings and provide new insights under specific conditions, contributing to the literature and offering actionable strategies for practitioners managing near-expired food commercialization.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104630"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841580","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
Multi-period hub-and-spoke network design considering flow-dependent economies of scale 考虑流量依赖规模经济的多周期轮辐网络设计
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-27 DOI: 10.1016/j.tre.2025.104646
Jianhua Xiao , Yifu Yang , Jiuhong Xiao , Shuyi Wang , George Q. Huang
This study explores a novel and generalized uncapacitated hub location problem (HLP) by integrating time-dependent decisions and flow-dependent economies of scale into the design of multi-allocation hub-and-spoke networks. Substantial investment and long-term strategic planning are required to construct such networks, during which market share often fluctuates significantly out of external factors like global economic dynamics and government policies. Flexible decision-making still lacks sufficient theoretical guidance despite its recognized importance in the timely deployment of hubs and the effective adjustment of transportation routes. Instead of a one-time implementation, this study investigates a budget-constrained phased network design that incorporates flow-dependent economies of scale to improve economic efficiency. This model captures the cost-sharing effects on inter-hub arcs as flow demand fluctuates across time periods. A mixed-integer linear programming model with a piecewise-linear concave cost function is formulated for the problem, posing a computational difficulty. To solve this challenging model, a specialized Benders decomposition algorithm is developed, which incorporates the Benders multi-cuts technique, the idea of approximate Pareto-optimal cuts, and a rolling horizon heuristic strategy. Through extensive numerical experiments, the proposed algorithm outperforms benchmark approaches. Findings include: (1) the impacts of budget and economies of scale are more significant in longer planning horizons but gradually diminish; (2) the flow-dependent approach enables more effective route consolidation and greater cost savings through economies of scale, an advantage that becomes more apparent over time.
本文通过将时间依赖决策和流量依赖的规模经济整合到多分配轮辐网络的设计中,探讨了一种新的、广义的无能力枢纽定位问题。建立这样的网络需要大量的投资和长期的战略规划,在此期间,市场份额往往受全球经济动态和政府政策等外部因素的影响而大幅波动。尽管灵活决策在枢纽的及时部署和运输路线的有效调整中具有公认的重要性,但仍然缺乏足够的理论指导。与一次性实施不同,本研究探讨了一种预算受限的分阶段网络设计,该设计结合了流量依赖的规模经济以提高经济效率。当流量需求在不同时间段波动时,该模型捕捉了枢纽间弧线的成本分摊效应。针对该问题,建立了一个带有分段线性凹代价函数的混合整数线性规划模型,计算难度较大。为了解决这一具有挑战性的模型,开发了一种专门的Benders分解算法,该算法结合了Benders多重切割技术、近似帕累托最优切割思想和滚动地平线启发式策略。通过大量的数值实验,该算法优于基准方法。研究发现:(1)预算和规模经济的影响在较长的规划周期内更为显著,但逐渐减弱;(2)依赖流量的方法可以通过规模经济实现更有效的路线整合和更大的成本节约,这一优势随着时间的推移变得更加明显。
{"title":"Multi-period hub-and-spoke network design considering flow-dependent economies of scale","authors":"Jianhua Xiao ,&nbsp;Yifu Yang ,&nbsp;Jiuhong Xiao ,&nbsp;Shuyi Wang ,&nbsp;George Q. Huang","doi":"10.1016/j.tre.2025.104646","DOIUrl":"10.1016/j.tre.2025.104646","url":null,"abstract":"<div><div>This study explores a novel and generalized uncapacitated hub location problem (HLP) by integrating time-dependent decisions and flow-dependent economies of scale into the design of multi-allocation hub-and-spoke networks. Substantial investment and long-term strategic planning are required to construct such networks, during which market share often fluctuates significantly out of external factors like global economic dynamics and government policies. Flexible decision-making still lacks sufficient theoretical guidance despite its recognized importance in the timely deployment of hubs and the effective adjustment of transportation routes. Instead of a one-time implementation, this study investigates a budget-constrained phased network design that incorporates flow-dependent economies of scale to improve economic efficiency. This model captures the cost-sharing effects on inter-hub arcs as flow demand fluctuates across time periods. A mixed-integer linear programming model with a piecewise-linear concave cost function is formulated for the problem, posing a computational difficulty. To solve this challenging model, a specialized Benders decomposition algorithm is developed, which incorporates the Benders multi-cuts technique, the idea of approximate Pareto-optimal cuts, and a rolling horizon heuristic strategy. Through extensive numerical experiments, the proposed algorithm outperforms benchmark approaches. Findings include: (1) the impacts of budget and economies of scale are more significant in longer planning horizons but gradually diminish; (2) the flow-dependent approach enables more effective route consolidation and greater cost savings through economies of scale, an advantage that becomes more apparent over time.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104646"},"PeriodicalIF":8.8,"publicationDate":"2025-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841581","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 distributed parallel simulation method with dynamic partitioning using KLeiden-based community detection 一种基于kleden社区检测的动态分区分布式并行仿真方法
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-26 DOI: 10.1016/j.tre.2025.104625
Hong Zhu , Xiaolong Xie , Keshuang Tang , Jialong Feng , Weixiong Rao
Microscopic traffic simulation constitutes a foundational technology in Intelligent Transportation Systems, and as traffic management paradigms continue to evolve, the requirements for its real-time application have become increasingly stringent. The computational efficiency of microscopic traffic simulation in large-scale road networks remains a critical issue. Distributed parallel simulation is considered one of the viable measures to address the above issue. However, this approach currently encounters challenges in the following three aspects: (a) the integration of network partitioning scheme and computational resources; (b) developing an efficient solver for the network partitioning problem; (c) enabling dynamic partitioning in distributed parallel simulation under time-varying OD (Origin-Destination) patterns. In order to address the aforementioned challenges, this study applies Amdahl’s Law to analyze the relationship between partitioning schemes and simulation time considering parallel and serial computations. Based on this finding, a network partition optimization model is formulated aiming at minimizing simulation time. Consequently, a dedicated solving algorithm is created based on analytical derivation and community detection that simultaneously preserves each subnetwork’s internal connectivity and satisfies the minimum-cut criterion. Meanwhile, the proof for the optimality of the solving algorithm is also provided. Furthermore, a distributed parallel simulation framework with dynamic partitioning is introduced to address load imbalance arising from changes in OD patterns. Extensive experiments conducted on several large-scale urban traffic networks demonstrate that the proposed method achieves up to 17.5 times real acceleration, while maintaining overall macroscopic errors within 1 %. In particular, under varying OD conditions, the proposed dynamic partitioning framework consistently yields superior acceleration performance compared with static partitioning schemes. The code will be released upon acceptance at https://github.com/TJINTO/parallel_sumo.
微观交通仿真是智能交通系统的基础技术,随着交通管理模式的不断发展,对微观交通仿真的实时性要求越来越高。大规模路网微观交通仿真的计算效率一直是一个关键问题。分布式并行仿真被认为是解决上述问题的可行措施之一。然而,这种方法目前面临以下三个方面的挑战:(a)网络划分方案与计算资源的整合;(b)开发网络分区问题的有效求解器;(c)在时变OD (Origin-Destination)模式下实现分布式并行仿真的动态分区。为了解决上述挑战,本研究应用Amdahl定律分析了分区方案与仿真时间之间的关系,同时考虑了并行和串行计算。基于这一发现,建立了以最小化仿真时间为目标的网络分区优化模型。因此,基于解析推导和社区检测,创建了一个专用的求解算法,该算法同时保留了每个子网的内部连通性并满足最小切割标准。同时,给出了求解算法的最优性证明。在此基础上,提出了一种基于动态分区的分布式并行仿真框架,解决了由于OD模式变化引起的负载不平衡问题。在多个大型城市交通网络上进行的大量实验表明,该方法可实现17.5倍的实际加速度,同时将总体宏观误差保持在1%以内。特别是,在不同的OD条件下,与静态分区方案相比,所提出的动态分区框架始终具有更好的加速性能。一经接受,代码将在https://github.com/TJINTO/parallel_sumo上发布。
{"title":"A novel distributed parallel simulation method with dynamic partitioning using KLeiden-based community detection","authors":"Hong Zhu ,&nbsp;Xiaolong Xie ,&nbsp;Keshuang Tang ,&nbsp;Jialong Feng ,&nbsp;Weixiong Rao","doi":"10.1016/j.tre.2025.104625","DOIUrl":"10.1016/j.tre.2025.104625","url":null,"abstract":"<div><div>Microscopic traffic simulation constitutes a foundational technology in Intelligent Transportation Systems, and as traffic management paradigms continue to evolve, the requirements for its real-time application have become increasingly stringent. The computational efficiency of microscopic traffic simulation in large-scale road networks remains a critical issue. Distributed parallel simulation is considered one of the viable measures to address the above issue. However, this approach currently encounters challenges in the following three aspects: (a) the integration of network partitioning scheme and computational resources; (b) developing an efficient solver for the network partitioning problem; (c) enabling dynamic partitioning in distributed parallel simulation under time-varying OD (Origin-Destination) patterns. In order to address the aforementioned challenges, this study applies Amdahl’s Law to analyze the relationship between partitioning schemes and simulation time considering parallel and serial computations. Based on this finding, a network partition optimization model is formulated aiming at minimizing simulation time. Consequently, a dedicated solving algorithm is created based on analytical derivation and community detection that simultaneously preserves each subnetwork’s internal connectivity and satisfies the minimum-cut criterion. Meanwhile, the proof for the optimality of the solving algorithm is also provided. Furthermore, a distributed parallel simulation framework with dynamic partitioning is introduced to address load imbalance arising from changes in OD patterns. Extensive experiments conducted on several large-scale urban traffic networks demonstrate that the proposed method achieves up to 17.5 times real acceleration, while maintaining overall macroscopic errors within 1 %. In particular, under varying OD conditions, the proposed dynamic partitioning framework consistently yields superior acceleration performance compared with static partitioning schemes. The code will be released upon acceptance at <span><span>https://github.com/TJINTO/parallel_sumo</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104625"},"PeriodicalIF":8.8,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841516","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 comparison of cost-sharing models in horizontal cooperative routing 横向协同路由中成本分担模型的比较
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-26 DOI: 10.1016/j.tre.2025.104626
Jessica Rodríguez-Pereira , Marilène Cherkesly , Marie-Ève Rancourt , Gilbert Laporte
We develop and compare several cost-sharing models for cooperative vehicle routing problems formulated under various objectives and constraints. Our study is motivated by a real-world case involving smallholder farmers in the Province of Quebec. We examine the issues of fairness and stability in cooperative routing, and we show that coalitions served by single routes are sufficient to impose stability conditions. To evaluate equity, we use the Gini coefficient to measure the dispersion of individual savings. Hence we can analyze the trade-offs between fairness and stability. We demonstrate that widely used fairness proxies do not necessarily yield equitable outcomes. We test our methodology on randomly generated instances and on a Quebec-based case study.
我们开发并比较了在不同目标和约束条件下制定的合作车辆路径问题的几个成本分担模型。我们的研究是基于魁北克省一个涉及小农的真实案例。我们研究了合作路由的公平性和稳定性问题,并表明由单一路由服务的联盟足以施加稳定条件。为了评估公平,我们使用基尼系数来衡量个人储蓄的分散性。因此,我们可以分析公平与稳定之间的权衡。我们证明广泛使用的公平代理并不一定产生公平的结果。我们在随机生成的实例和基于魁北克的案例研究中测试了我们的方法。
{"title":"A comparison of cost-sharing models in horizontal cooperative routing","authors":"Jessica Rodríguez-Pereira ,&nbsp;Marilène Cherkesly ,&nbsp;Marie-Ève Rancourt ,&nbsp;Gilbert Laporte","doi":"10.1016/j.tre.2025.104626","DOIUrl":"10.1016/j.tre.2025.104626","url":null,"abstract":"<div><div>We develop and compare several cost-sharing models for cooperative vehicle routing problems formulated under various objectives and constraints. Our study is motivated by a real-world case involving smallholder farmers in the Province of Quebec. We examine the issues of fairness and stability in cooperative routing, and we show that coalitions served by single routes are sufficient to impose stability conditions. To evaluate equity, we use the Gini coefficient to measure the dispersion of individual savings. Hence we can analyze the trade-offs between fairness and stability. We demonstrate that widely used fairness proxies do not necessarily yield equitable outcomes. We test our methodology on randomly generated instances and on a Quebec-based case study.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104626"},"PeriodicalIF":8.8,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841517","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
Optimization of load reduction and berth shifting operations in green ports: a collaborative scheduling model for berths, unloaders, and tugboats 绿色港口减载和移泊作业的优化:泊位、卸货机和拖船的协同调度模型
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2025-12-26 DOI: 10.1016/j.tre.2025.104637
Haijiang Li , Ya Sheng , Peng Jia , Shenyi Li , Qianli Ma
With the increasing trend of large-scale vessels, the shortage of deep-water berth resources in ports has become increasingly prominent, severely restricting vessel turnover rates and cargo unloading efficiency. To address this bottleneck, this study proposes an optimization approach for load reduction and berth shifting of large dry bulk carriers, coordinating the allocation of core resources such as berths, unloaders, and tugboats to enhance the overall operational efficiency of ports. A multi-objective, two-stage joint scheduling optimization model for berth, unloader, and tugboat operations is developed. The model decouples the problem into two stages: berth-unloader joint allocation and tugboat scheduling. It comprehensively considers operation time and costs to achieve full-process optimization of load reduction and berth shifting. Furthermore, a two-layer solution framework integrating the Starfish Optimization Algorithm (SFOA) with the Non-dominated Sorting Genetic Algorithm (NSGA-II) is proposed. The framework employs tabu search to enhance Pareto front exploration in berth-unloader allocation and utilizes an elite-based chromosome generation mechanism in tugboat scheduling to improve solution quality. Additionally, a multi-energy hybrid tugboat fleet comprising diesel and clean energy-powered vessels is designed, along with a vessel-tugboat matching strategy that factors in emission reduction requirements based on varying tugboat demands of different bulk carrier sizes. Finally, a case study based on a real port in northern China demonstrates the effectiveness of the proposed optimization scheme in alleviating deep-water berth shortages, reducing tugboat emissions, and promoting the intelligent and green transformation of port operations.
随着船舶大型化趋势的增加,港口深水泊位资源短缺的问题日益突出,严重制约了船舶周转率和货物卸载效率。针对这一瓶颈,本研究提出了大型干散货船减载移泊的优化方法,协调泊位、卸货机、拖船等核心资源的配置,提高港口整体运营效率。建立了泊位、卸船和拖船作业的多目标两阶段联合调度优化模型。该模型将该问题解耦为泊位卸载联合分配和拖船调度两个阶段。综合考虑作业时间和成本,实现减载移泊全过程优化。在此基础上,提出了海星优化算法(SFOA)与非支配排序遗传算法(NSGA-II)相结合的两层求解框架。该框架采用禁忌搜索增强卸泊位机分配中的帕累托前沿探索能力,采用基于精英的染色体生成机制提高拖船调度的求解质量。此外,设计了由柴油和清洁能源驱动的船舶组成的多能混合拖船船队,以及船舶-拖船匹配策略,该策略基于不同散货船尺寸的拖船需求,考虑了减排要求。最后,以中国北方某实际港口为例,验证了所提出的优化方案在缓解深水泊位短缺、减少拖船排放、促进港口运营智能化和绿色化转型方面的有效性。
{"title":"Optimization of load reduction and berth shifting operations in green ports: a collaborative scheduling model for berths, unloaders, and tugboats","authors":"Haijiang Li ,&nbsp;Ya Sheng ,&nbsp;Peng Jia ,&nbsp;Shenyi Li ,&nbsp;Qianli Ma","doi":"10.1016/j.tre.2025.104637","DOIUrl":"10.1016/j.tre.2025.104637","url":null,"abstract":"<div><div>With the increasing trend of large-scale vessels, the shortage of deep-water berth resources in ports has become increasingly prominent, severely restricting vessel turnover rates and cargo unloading efficiency. To address this bottleneck, this study proposes an optimization approach for load reduction and berth shifting of large dry bulk carriers, coordinating the allocation of core resources such as berths, unloaders, and tugboats to enhance the overall operational efficiency of ports. A multi-objective, two-stage joint scheduling optimization model for berth, unloader, and tugboat operations is developed. The model decouples the problem into two stages: berth-unloader joint allocation and tugboat scheduling. It comprehensively considers operation time and costs to achieve full-process optimization of load reduction and berth shifting. Furthermore, a two-layer solution framework integrating the Starfish Optimization Algorithm (SFOA) with the Non-dominated Sorting Genetic Algorithm (NSGA-II) is proposed. The framework employs tabu search to enhance Pareto front exploration in berth-unloader allocation and utilizes an elite-based chromosome generation mechanism in tugboat scheduling to improve solution quality. Additionally, a multi-energy hybrid tugboat fleet comprising diesel and clean energy-powered vessels is designed, along with a vessel-tugboat matching strategy that factors in emission reduction requirements based on varying tugboat demands of different bulk carrier sizes. Finally, a case study based on a real port in northern China demonstrates the effectiveness of the proposed optimization scheme in alleviating deep-water berth shortages, reducing tugboat emissions, and promoting the intelligent and green transformation of port operations.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"207 ","pages":"Article 104637"},"PeriodicalIF":8.8,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841579","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
期刊
Transportation Research Part E-Logistics and Transportation Review
全部 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