首页 > 最新文献

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

英文 中文
An integrated framework of vessel demand shifting and port capacity utilization for congestion mitigation 船舶需求转移和港口能力利用的综合框架缓解拥堵
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-09 DOI: 10.1016/j.tre.2025.104660
Haowen Lei , Shuai Jia
Port congestion remains a critical hurdle for global maritime logistics, particularly as opportunities for infrastructure expansion become increasingly limited. In this study, we introduce a unified optimization framework that coordinates vessel service demand with port capacity, empowering the mitigation of port congestion. The integrated framework comprises three key components: A demand shifting model that optimizes vessel arrival distributions over time; a descriptive queueing model that characterizes vessel arrival and service processes, enabling a holistic evaluation of congestion levels; and a resource management model that effectively allocates available port resources to vessels by leveraging a data-driven throughput envelope calibrated from port operational data. To address the computational challenges posed by the integration these models, we develop a bi-level iterative solution algorithm that iteratively enhances the coordination between demand-side and supply-side decisions, achieving a satisfactory performance with respect to tractability and scalability. Empirical validation is performed using a large-scale, real-world operational dataset from a major container port in Shanghai. Our algorithm proves highly scalable, solving large-scale instances 20–30 times faster than Gurobi and achieving near-optimal solutions (e.g., optimality gaps as low as 0.91 %). The framework delivers economic value with a substantial reduction of total system costs (ranging from 14.47 %-16.67 %) over a non-integrated baseline. The results highlight the practical value and generalizability of the unified approach for enhancing the efficiency and resilience of port systems.
港口拥堵仍然是全球海运物流的一个关键障碍,尤其是在基础设施扩张的机会越来越有限的情况下。在本研究中,我们引入了一个统一的优化框架,协调船舶服务需求和港口容量,增强港口拥堵的缓解能力。集成框架包括三个关键部分:需求转移模型,优化船舶到达分布;描述船舶到达和服务过程的描述性排队模型,能够全面评估拥堵程度;资源管理模型,通过利用港口运营数据校准的数据驱动吞吐量包络,有效地将可用的港口资源分配给船舶。为了解决这些模型集成带来的计算挑战,我们开发了一种双级迭代求解算法,该算法迭代地增强了需求侧和供给侧决策之间的协调,在可追溯性和可扩展性方面取得了令人满意的性能。使用上海一个主要集装箱港口的大规模真实操作数据集进行实证验证。我们的算法被证明具有高度的可扩展性,解决大规模实例的速度比robi快20-30倍,并获得接近最优的解决方案(例如,最优性差距低至0.91 %)。与非集成基线相比,该框架提供了经济价值,大大降低了总系统成本(范围从14.47 %-16.67 %)。结果突出了统一方法在提高港口系统效率和弹性方面的实用价值和可推广性。
{"title":"An integrated framework of vessel demand shifting and port capacity utilization for congestion mitigation","authors":"Haowen Lei ,&nbsp;Shuai Jia","doi":"10.1016/j.tre.2025.104660","DOIUrl":"10.1016/j.tre.2025.104660","url":null,"abstract":"<div><div>Port congestion remains a critical hurdle for global maritime logistics, particularly as opportunities for infrastructure expansion become increasingly limited. In this study, we introduce a unified optimization framework that coordinates vessel service demand with port capacity, empowering the mitigation of port congestion. The integrated framework comprises three key components: A demand shifting model that optimizes vessel arrival distributions over time; a descriptive queueing model that characterizes vessel arrival and service processes, enabling a holistic evaluation of congestion levels; and a resource management model that effectively allocates available port resources to vessels by leveraging a data-driven throughput envelope calibrated from port operational data. To address the computational challenges posed by the integration these models, we develop a bi-level iterative solution algorithm that iteratively enhances the coordination between demand-side and supply-side decisions, achieving a satisfactory performance with respect to tractability and scalability. Empirical validation is performed using a large-scale, real-world operational dataset from a major container port in Shanghai. Our algorithm proves highly scalable, solving large-scale instances 20–30 times faster than Gurobi and achieving near-optimal solutions (e.g., optimality gaps as low as 0.91 %). The framework delivers economic value with a substantial reduction of total system costs (ranging from 14.47 %-16.67 %) over a non-integrated baseline. The results highlight the practical value and generalizability of the unified approach for enhancing the efficiency and resilience of port systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104660"},"PeriodicalIF":8.8,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940544","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
Service network design for electric vehicles with combined battery swapping and recharging 混合换电池充电的电动汽车服务网络设计
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-09 DOI: 10.1016/j.tre.2026.104668
Xudong Diao , Meng Qiu
Incorporating both battery swapping and recharging strategies within electric vehicle (EV) service networks provides a flexible means of mitigating range limitations. While jointly optimizing these strategies poses significant modeling and computational challenges, it also yields valuable insights into their relative operational performance. We develop an optimization framework that jointly determines service network design, EV routing decisions, and the scheduling of recharging and battery swapping operations, while respecting capacity constraints on both activities. This study establishes a unified mixed-integer programming framework for EV service network design that integrates the two replenishment strategies under system-wide capacity limitations. To handle large-scale instances efficiently, we employ a column generation scheme, in which the pricing subproblem is solved using a bidirectional labeling algorithm supported by tailored dominance rules and problem-specific resource extension functions. In addition, a dedicated heuristic is designed to construct high-quality integer solutions. Computational experiments based on real-world case studies show that when both strategies are available, battery swapping tends to outperform recharging due to its shorter service time, highlighting the scalability and practical relevance of the proposed approach.
在电动汽车(EV)服务网络中结合电池交换和充电策略提供了一种灵活的缓解里程限制的方法。虽然联合优化这些策略会带来重大的建模和计算挑战,但它也会对它们的相对操作性能产生有价值的见解。我们开发了一个优化框架,共同确定服务网络设计、电动汽车路线决策以及充电和电池交换操作的调度,同时尊重这两项活动的容量约束。本文建立了一个统一的混合整数规划框架,用于电动汽车服务网络设计,该框架在全系统容量限制下集成了两种补充策略。为了有效地处理大规模实例,我们采用了一种列生成方案,其中定价子问题使用由定制的优势规则和问题特定的资源扩展函数支持的双向标记算法来解决。此外,还设计了一个专门的启发式算法来构造高质量的整数解。基于实际案例研究的计算实验表明,当两种策略都可用时,电池交换往往优于充电,因为其使用时间更短,突出了所提出方法的可扩展性和实际相关性。
{"title":"Service network design for electric vehicles with combined battery swapping and recharging","authors":"Xudong Diao ,&nbsp;Meng Qiu","doi":"10.1016/j.tre.2026.104668","DOIUrl":"10.1016/j.tre.2026.104668","url":null,"abstract":"<div><div>Incorporating both battery swapping and recharging strategies within electric vehicle (EV) service networks provides a flexible means of mitigating range limitations. While jointly optimizing these strategies poses significant modeling and computational challenges, it also yields valuable insights into their relative operational performance. We develop an optimization framework that jointly determines service network design, EV routing decisions, and the scheduling of recharging and battery swapping operations, while respecting capacity constraints on both activities. This study establishes a unified mixed-integer programming framework for EV service network design that integrates the two replenishment strategies under system-wide capacity limitations. To handle large-scale instances efficiently, we employ a column generation scheme, in which the pricing subproblem is solved using a bidirectional labeling algorithm supported by tailored dominance rules and problem-specific resource extension functions. In addition, a dedicated heuristic is designed to construct high-quality integer solutions. Computational experiments based on real-world case studies show that when both strategies are available, battery swapping tends to outperform recharging due to its shorter service time, highlighting the scalability and practical relevance of the proposed approach.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104668"},"PeriodicalIF":8.8,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940543","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
Climate shock impacts on supply chains: the case of the truckload spot market 气候冲击对供应链的影响:以卡车现货市场为例
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-09 DOI: 10.1016/j.tre.2025.104609
Sara Hsu , Andrew Balthrop , Dan Pellathy , Travis Kulpa , Gonzalo Andrew Ferrada , Joshua Fu
Climate shocks increasingly disrupt supply chains, yet research has focused primarily on mitigation strategies (i.e., carbon reduction), leaving adaptation strategies comparatively understudied. We begin to fill this gap by studying how transportation managers within a supply chain respond to climate-related shocks, defined as a month in which a state’s exposure to extreme temperature or precipitation events rises significantly, measured by the custom University of Tennessee Climate Index (UTCI), which combines anomalies in high/low temperature and heavy precipitation with population exposure. Drawing on structured interviews with transportation managers, we uncover beliefs that shippers tend to be less demand-responsive in the short-term to climate-related shocks, often prioritizing the desire to move freight at any reasonable cost. Motor carriers, in contrast, are more sensitive to price. To test these qualitative assessments, we regress monthly state-level truckload spot market data from the contiguous 48 states on the UTCI in reduced-form two-way fixed effects specifications, finding that a one-standard-deviation increase in climate shocks increases freight prices by 1.9%, with minimal effects on freight volume, indicating that market adjustments occur primarily through price rather than quantity. We further estimate IV specifications based on three-stage least squares (3SLS) models to disentangle the net causal effects from the reduced form specification. Consistent with our interviews, we find motor carriers are more sensitive than shippers to climate shocks. The results have important implications, offering shippers, carriers, and brokers with concrete price-change benchmarks they can use to budget transportation spend, design contract–spot portfolios, and plan capacity during climate shocks.
气候冲击日益扰乱供应链,但研究主要集中在缓解战略(即碳减排)上,对适应战略的研究相对不足。我们开始通过研究供应链内的运输管理人员如何应对气候相关冲击来填补这一空白,气候冲击的定义是一个州暴露于极端温度或降水事件显著上升的一个月,由定制的田纳西大学气候指数(UTCI)测量,该指数将高/低温和强降水的异常与人口暴露相结合。通过对运输经理的结构化访谈,我们发现,托运人在短期内对气候相关冲击的需求反应往往较弱,往往优先考虑以任何合理的成本运输货物。相比之下,汽车运输公司对价格更为敏感。为了验证这些定性评估,我们以简化形式的双向固定效应规范对UTCI上连续48个州的月度州一级卡车现货市场数据进行回归,发现气候冲击增加一个标准差会使货运价格上涨1.9%,对货运量的影响最小,这表明市场调整主要通过价格而不是数量发生。我们基于三阶段最小二乘(3SLS)模型进一步估计IV规范,以从简化形式规范中分离出净因果效应。与我们的采访一致,我们发现汽车运输公司比托运人对气候冲击更敏感。研究结果具有重要意义,为托运人、承运人和经纪人提供了具体的价格变化基准,他们可以利用这些基准来预算运输支出,设计合同现货组合,并在气候冲击期间规划运力。
{"title":"Climate shock impacts on supply chains: the case of the truckload spot market","authors":"Sara Hsu ,&nbsp;Andrew Balthrop ,&nbsp;Dan Pellathy ,&nbsp;Travis Kulpa ,&nbsp;Gonzalo Andrew Ferrada ,&nbsp;Joshua Fu","doi":"10.1016/j.tre.2025.104609","DOIUrl":"10.1016/j.tre.2025.104609","url":null,"abstract":"<div><div>Climate shocks increasingly disrupt supply chains, yet research has focused primarily on mitigation strategies (i.e., carbon reduction), leaving adaptation strategies comparatively understudied. We begin to fill this gap by studying how transportation managers within a supply chain respond to climate-related shocks, defined as a month in which a state’s exposure to extreme temperature or precipitation events rises significantly, measured by the custom University of Tennessee Climate Index (UTCI), which combines anomalies in high/low temperature and heavy precipitation with population exposure. Drawing on structured interviews with transportation managers, we uncover beliefs that shippers tend to be less demand-responsive in the short-term to climate-related shocks, often prioritizing the desire to move freight at any reasonable cost. Motor carriers, in contrast, are more sensitive to price. To test these qualitative assessments, we regress monthly state-level truckload spot market data from the contiguous 48 states on the UTCI in reduced-form two-way fixed effects specifications, finding that a one-standard-deviation increase in climate shocks increases freight prices by 1.9%, with minimal effects on freight volume, indicating that market adjustments occur primarily through price rather than quantity. We further estimate IV specifications based on three-stage least squares (3SLS) models to disentangle the net causal effects from the reduced form specification. Consistent with our interviews, we find motor carriers are more sensitive than shippers to climate shocks. The results have important implications, offering shippers, carriers, and brokers with concrete price-change benchmarks they can use to budget transportation spend, design contract–spot portfolios, and plan capacity during climate shocks.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104609"},"PeriodicalIF":8.8,"publicationDate":"2026-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940515","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
Optimizing on-site green hydrogen consumption using heavy-duty hydrogen fuel cell electric vehicles 使用重型氢燃料电池电动汽车优化现场绿色氢消耗
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-08 DOI: 10.1016/j.tre.2025.104627
Mohammad Reza Ghorbanali Zadegan , Zhaomiao Guo
Transitioning to zero-emission heavy-duty freight vehicles, such as fuel cell electric vehicles (FCEVs), could contribute to mitigating the environmental footprint in the freight sector. However, sustainable and economical production, transportation, and storage of hydrogen fuels remain challenging. The goal of this study is to leverage the flexibility of logistics delivery to maximize the utilization of green hydrogen while balancing the freight operational costs. To achieve this goal, we develop a mixed integer programming (MIP) model that optimizes the planning, routing/scheduling, refueling, and on-site “green” hydrogen production to support the operations of FCEVs. The model strategically determines the locations and sizes of hydrogen refueling stations (HRSs) and the corresponding vehicle routing/refueling plans to minimize total costs, while utilizing solar-powered on-site hydrogen generation in freight operations. Our model was initially tested using the Solomon benchmark and later implemented in a real-world case study of freight distribution systems in Florida to evaluate its robustness and efficiency. Computational performance between exact methods and a customized Adaptive Large Neighborhood Search (ALNS) metaheuristic algorithm are also compared. Extensive sensitivity analyses were conducted on operational and environmental parameters to generate numerical insights. We found that strategic trade-offs in routing the FCEV fleet and placing HRSs, coupled with optimized solar hydrogen production, substantially reduce operational costs and enhance sustainability.
向燃料电池电动汽车(fcev)等零排放重型货运车辆过渡,可能有助于减轻货运行业的环境足迹。然而,可持续和经济的氢燃料生产、运输和储存仍然具有挑战性。本研究的目标是利用物流配送的灵活性,最大限度地利用绿色氢,同时平衡货运运营成本。为了实现这一目标,我们开发了一个混合整数规划(MIP)模型,该模型可以优化规划、路由/调度、加油和现场“绿色”氢气生产,以支持fcev的运行。该模型战略性地确定了加氢站(HRSs)的位置和大小,以及相应的车辆路线/加油计划,以最大限度地降低总成本,同时在货运业务中利用太阳能现场制氢。我们的模型最初使用Solomon基准进行测试,后来在佛罗里达州货运配送系统的实际案例研究中实施,以评估其稳健性和效率。比较了精确方法与自适应大邻域搜索(ALNS)元启发式算法的计算性能。对操作和环境参数进行了广泛的敏感性分析,以产生数值见解。我们发现,在FCEV车队的路线和HRSs的配置上进行战略权衡,再加上优化的太阳能制氢,大大降低了运营成本,提高了可持续性。
{"title":"Optimizing on-site green hydrogen consumption using heavy-duty hydrogen fuel cell electric vehicles","authors":"Mohammad Reza Ghorbanali Zadegan ,&nbsp;Zhaomiao Guo","doi":"10.1016/j.tre.2025.104627","DOIUrl":"10.1016/j.tre.2025.104627","url":null,"abstract":"<div><div>Transitioning to zero-emission heavy-duty freight vehicles, such as fuel cell electric vehicles (FCEVs), could contribute to mitigating the environmental footprint in the freight sector. However, sustainable and economical production, transportation, and storage of hydrogen fuels remain challenging. The goal of this study is to leverage the flexibility of logistics delivery to maximize the utilization of green hydrogen while balancing the freight operational costs. To achieve this goal, we develop a mixed integer programming (MIP) model that optimizes the planning, routing/scheduling, refueling, and on-site “green” hydrogen production to support the operations of FCEVs. The model strategically determines the locations and sizes of hydrogen refueling stations (HRSs) and the corresponding vehicle routing/refueling plans to minimize total costs, while utilizing solar-powered on-site hydrogen generation in freight operations. Our model was initially tested using the Solomon benchmark and later implemented in a real-world case study of freight distribution systems in Florida to evaluate its robustness and efficiency. Computational performance between exact methods and a customized Adaptive Large Neighborhood Search (ALNS) metaheuristic algorithm are also compared. Extensive sensitivity analyses were conducted on operational and environmental parameters to generate numerical insights. We found that strategic trade-offs in routing the FCEV fleet and placing HRSs, coupled with optimized solar hydrogen production, substantially reduce operational costs and enhance sustainability.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104627"},"PeriodicalIF":8.8,"publicationDate":"2026-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940545","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
Optimizing driver’s discount order acceptance strategies: A policy-improved deep deterministic policy gradient framework 优化司机折扣订单接受策略:一个策略改进的深度确定性策略梯度框架
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-06 DOI: 10.1016/j.tre.2025.104628
Hanwen Dai , Chang Gao , Fang He , Congyuan Ji , Yanni Yang
The rapid expansion of platform integration has emerged as an effective solution to mitigate market fragmentation by consolidating multiple ride-hailing platforms into a single application. To address heterogeneous passenger preferences, third-party integrators provide Discount Express service delivered by express drivers at lower trip fares. For the individual platform, encouraging broader participation of drivers in Discount Express services has the potential to expand the accessible demand pool and improve matching efficiency, but often at the cost of reduced profit margins. This study aims to dynamically manage drivers’ acceptance of Discount Express from the perspective of an individual platform, incorporating the spatiotemporal demand-supply patterns. The lack of historical data under the new business model necessitates online learning. However, early-stage exploration through trial and error can be costly in practice, highlighting the need for reliable early-stage performance in real-world deployment. To address these challenges, this study formulates the decision regarding the proportion of drivers accepting discount orders as a continuous control task. In response to the high stochasticity, the opaque matching mechanisms employed by third-party integrator, and the limited availability of historical data, we propose an innovative policy-improved deep deterministic policy gradient (pi-DDPG) framework. The proposed framework incorporates a refiner module to boost policy performance during the early training phase, leverages a convolutional long short-term memory network to effectively capture complex spatiotemporal patterns, and adopts a prioritized experience replay mechanism to enhance learning efficiency. A customized simulator based on a real-world dataset is developed to validate the effectiveness of the proposed pi-DDPG. Numerical experiments demonstrate that pi-DDPG achieves superior learning efficiency and significantly reduces early-stage training losses, enhancing its applicability to practical ride-hailing scenarios.
平台整合的快速扩张已经成为一种有效的解决方案,通过将多个网约车平台整合到一个应用程序中来缓解市场分化。为了解决乘客的不同偏好,第三方集成商提供了折扣快递服务,由快递司机以更低的票价提供服务。对于单个平台而言,鼓励司机更广泛地参与折扣快递服务,有可能扩大可访问的需求池,提高匹配效率,但往往以降低利润率为代价。本研究旨在从个体平台角度,结合时空供需模式,动态管理司机对折扣快递的接受度。在新的商业模式下,缺乏历史数据使得在线学习成为必要。然而,在实践中,通过试错进行的早期探索可能代价高昂,这突出了在实际部署中对可靠的早期性能的需求。为了解决这些挑战,本研究将司机接受折扣订单比例的决策制定为连续控制任务。针对高随机性、第三方集成商采用的不透明匹配机制以及历史数据可用性有限等问题,提出了一种创新的策略改进深度确定性策略梯度(pi-DDPG)框架。该框架采用细化模块提高策略在早期训练阶段的性能,利用卷积长短期记忆网络有效捕获复杂的时空模式,并采用优先体验重放机制提高学习效率。开发了一个基于真实数据集的定制模拟器来验证所提出的pi-DDPG的有效性。数值实验表明,pi-DDPG取得了优异的学习效率,显著降低了早期训练损失,增强了对实际网约车场景的适用性。
{"title":"Optimizing driver’s discount order acceptance strategies: A policy-improved deep deterministic policy gradient framework","authors":"Hanwen Dai ,&nbsp;Chang Gao ,&nbsp;Fang He ,&nbsp;Congyuan Ji ,&nbsp;Yanni Yang","doi":"10.1016/j.tre.2025.104628","DOIUrl":"10.1016/j.tre.2025.104628","url":null,"abstract":"<div><div>The rapid expansion of platform integration has emerged as an effective solution to mitigate market fragmentation by consolidating multiple ride-hailing platforms into a single application. To address heterogeneous passenger preferences, third-party integrators provide Discount Express service delivered by express drivers at lower trip fares. For the individual platform, encouraging broader participation of drivers in Discount Express services has the potential to expand the accessible demand pool and improve matching efficiency, but often at the cost of reduced profit margins. This study aims to dynamically manage drivers’ acceptance of Discount Express from the perspective of an individual platform, incorporating the spatiotemporal demand-supply patterns. The lack of historical data under the new business model necessitates online learning. However, early-stage exploration through trial and error can be costly in practice, highlighting the need for reliable early-stage performance in real-world deployment. To address these challenges, this study formulates the decision regarding the proportion of drivers accepting discount orders as a continuous control task. In response to the high stochasticity, the opaque matching mechanisms employed by third-party integrator, and the limited availability of historical data, we propose an innovative policy-improved deep deterministic policy gradient (pi-DDPG) framework. The proposed framework incorporates a refiner module to boost policy performance during the early training phase, leverages a convolutional long short-term memory network to effectively capture complex spatiotemporal patterns, and adopts a prioritized experience replay mechanism to enhance learning efficiency. A customized simulator based on a real-world dataset is developed to validate the effectiveness of the proposed pi-DDPG. Numerical experiments demonstrate that pi-DDPG achieves superior learning efficiency and significantly reduces early-stage training losses, enhancing its applicability to practical ride-hailing scenarios.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104628"},"PeriodicalIF":8.8,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940519","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
Discriminatory order assignment and payment-setting of on-demand food-delivery platforms: A multi-action and multi-agent reinforcement learning framework 按需外卖平台的歧视性订单分配和支付设置:一个多行动和多智能体强化学习框架
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-06 DOI: 10.1016/j.tre.2025.104653
Zijian Zhao , Sen Li
This paper studies the discriminatory order assignment and payment-setting strategies for on-demand food-delivery platforms. We consider an on-demand food-delivery platform that coordinates customers, couriers, and restaurants to maximize the profit. It determines how to bundle orders, assign orders to couriers, and set payments to couriers in real-time. These decisions are made in a personalized manner, depending on the historical data collected from each of the couriers, such as the order acceptance and rejection rates under distinct scenarios of order assignment and payment values. A Markov Decision Process is formulated for the courier, capturing the decisions of the platform (including differentiated order assignment/bundling strategies and the discriminatory payment-settings decisions) while considering its dependence on the personalized work-related data of each individual courier. To derive the optimal policies, we propose a novel multi-action and multi-agent deep reinforcement learning framework, where a double Deep Q-Network is employed to develop discrete order assignment strategies, and double Proximal Policy Optimization is utilized to determine continuous payment decisions. Within this learning framework, we introduce a novel neural network architecture that leverages the Query-Key attention mechanism to transform multiplicative time complexities into additive computation complexity for order assignment, and we adopt a variable-length Bi-LSTM module that compresses variable-length order sequence into a fixed-dimensional feature space to enhance scalability. The proposed neural network and algorithmic framework was validated in a case study using real-world food-delivery data from Hong Kong. By comparing the proposed method with a vanilla MLP-based neural network architecture, we find that the proposed neural network architecture significantly enhances platform performance: it increases the number of orders served by 5.25%, reduces platform expenses by 10%, and improves the overall reward of the platform by over 50%. Additionally, our results reveal that couriers with higher order rejection rates receive more orders during peak hours but earn lower wages. This counterintuitive finding is attributed to a strategic approach by the platform to differentiate order allocation: instead of simply allocating fewer orders to couriers with higher rejection rates, the platform preferentially assigns longer-distance trips to couriers with a higher likelihood of order acceptance. These findings expose the implicit biases in the discriminatory algorithms used by the profit-maximizing platform and highlight potential areas for governmental regulatory intervention. The code of this paper is provided at https://github.com/RS2002/Discriminatory-Food-Delivery.
本文研究了按需外卖平台的歧视性订单分配和支付设置策略。我们考虑建立一个按需送餐平台,协调顾客、快递员和餐馆,以实现利润最大化。它决定如何捆绑订单,如何将订单分配给快递员,以及如何实时设置支付给快递员的费用。这些决策以个性化的方式做出,取决于从每个快递员收集的历史数据,例如在不同的订单分配和支付值场景下的订单接受率和拒绝率。为快递员制定了一个马尔可夫决策过程,在考虑其对每个快递员个性化工作数据的依赖的同时,捕获平台的决策(包括差异化订单分配/捆绑策略和歧视性支付设置决策)。为了获得最优策略,我们提出了一种新的多动作和多智能体深度强化学习框架,其中使用双deep Q-Network来制定离散订单分配策略,使用双Proximal Policy Optimization来确定连续支付决策。在这个学习框架中,我们引入了一种新的神经网络架构,利用Query-Key关注机制将乘法时间复杂度转化为加性计算复杂度进行顺序分配,并采用变长Bi-LSTM模块将变长顺序序列压缩到固定维特征空间中以增强可扩展性。所提出的神经网络和算法框架在使用香港实际送餐数据的案例研究中得到验证。通过与基于mlp的神经网络架构进行比较,我们发现该神经网络架构显著提高了平台性能:服务订单数量增加了5.25%,平台费用减少了10%,平台整体回报提高了50%以上。此外,我们的研究结果显示,高拒收率的快递员在高峰时段收到的订单更多,但工资却更低。这一违反直觉的发现归因于该平台区分订单分配的战略方法:该平台不是简单地将较少的订单分配给拒收率较高的快递员,而是优先将较长距离的行程分配给接受订单可能性较高的快递员。这些发现揭示了利润最大化平台使用的歧视性算法中的隐性偏见,并突出了政府监管干预的潜在领域。本文的代码在https://github.com/RS2002/Discriminatory-Food-Delivery上提供。
{"title":"Discriminatory order assignment and payment-setting of on-demand food-delivery platforms: A multi-action and multi-agent reinforcement learning framework","authors":"Zijian Zhao ,&nbsp;Sen Li","doi":"10.1016/j.tre.2025.104653","DOIUrl":"10.1016/j.tre.2025.104653","url":null,"abstract":"<div><div>This paper studies the discriminatory order assignment and payment-setting strategies for on-demand food-delivery platforms. We consider an on-demand food-delivery platform that coordinates customers, couriers, and restaurants to maximize the profit. It determines how to bundle orders, assign orders to couriers, and set payments to couriers in real-time. These decisions are made in a personalized manner, depending on the historical data collected from each of the couriers, such as the order acceptance and rejection rates under distinct scenarios of order assignment and payment values. A Markov Decision Process is formulated for the courier, capturing the decisions of the platform (including differentiated order assignment/bundling strategies and the discriminatory payment-settings decisions) while considering its dependence on the personalized work-related data of each individual courier. To derive the optimal policies, we propose a novel multi-action and multi-agent deep reinforcement learning framework, where a double Deep Q-Network is employed to develop discrete order assignment strategies, and double Proximal Policy Optimization is utilized to determine continuous payment decisions. Within this learning framework, we introduce a novel neural network architecture that leverages the Query-Key attention mechanism to transform multiplicative time complexities into additive computation complexity for order assignment, and we adopt a variable-length Bi-LSTM module that compresses variable-length order sequence into a fixed-dimensional feature space to enhance scalability. The proposed neural network and algorithmic framework was validated in a case study using real-world food-delivery data from Hong Kong. By comparing the proposed method with a vanilla MLP-based neural network architecture, we find that the proposed neural network architecture significantly enhances platform performance: it increases the number of orders served by 5.25%, reduces platform expenses by 10%, and improves the overall reward of the platform by over 50%. Additionally, our results reveal that couriers with higher order rejection rates receive more orders during peak hours but earn lower wages. This counterintuitive finding is attributed to a strategic approach by the platform to differentiate order allocation: instead of simply allocating fewer orders to couriers with higher rejection rates, the platform preferentially assigns longer-distance trips to couriers with a higher likelihood of order acceptance. These findings expose the implicit biases in the discriminatory algorithms used by the profit-maximizing platform and highlight potential areas for governmental regulatory intervention. The code of this paper is provided at <span><span>https://github.com/RS2002/Discriminatory-Food-Delivery</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104653"},"PeriodicalIF":8.8,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940520","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
Inventory-constrained online learning for revenue management with delayed feedback 具有延迟反馈的收入管理的库存约束在线学习
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-06 DOI: 10.1016/j.tre.2025.104649
Sheng Ji
Delayed feedback is a prevalent challenge in modern logistics and transportation systems, especially on digital retail platforms. This paper investigates an online learning and pricing problem characterized by aggregated and anonymous delays. In this setting, neither demand nor revenue is immediately observable following a pricing decision; instead, these metrics become available to the retailer only after some stochastic delay. The retailer also faces an initial inventory constraint, creating a complex exploration-exploitation trade-off among learning demand, generating revenue, and managing inventory. To address this challenge, we propose a novel batch-based learning algorithm, referred to as Bandits with Dual Mirror Descent (BUD for short), which integrates mirror descent with bandit control. The algorithm employs a carefully designed batch structure to isolate the impact of delayed feedback, while combining Upper Confidence Bound (UCB) for pricing with dual updates for inventory management. Our theoretical analysis shows that the regret (defined as the revenue gap between the optimal policy and the learning algorithm) of BUD grows sublinearly with the selling horizon and matches the known lower bounds in both bandit with delays and online pricing problems. We conducted numerical experiments to demonstrate that the regret of BUD converges to 0 in various scenarios.
延迟反馈是现代物流和运输系统中普遍存在的挑战,特别是在数字零售平台上。本文研究了一个以聚合和匿名延迟为特征的在线学习和定价问题。在这种情况下,定价决定后,需求和收入都无法立即观察到;相反,这些指标只有在经过一些随机延迟后才对零售商可用。零售商还面临最初的库存约束,在了解需求、产生收入和管理库存之间产生了复杂的探索-开发权衡。为了解决这一挑战,我们提出了一种新的基于批处理的学习算法,称为具有双镜像下降的强盗(简称BUD),它将镜像下降与强盗控制相结合。该算法采用精心设计的批处理结构来隔离延迟反馈的影响,同时将定价的上置信限(UCB)与库存管理的双更新相结合。我们的理论分析表明,BUD的后悔(定义为最优策略与学习算法之间的收入差距)随着销售水平的次线性增长,并且在具有延迟和在线定价问题的强盗中都匹配已知的下界。我们通过数值实验证明了在各种情况下BUD的后悔收敛于0。
{"title":"Inventory-constrained online learning for revenue management with delayed feedback","authors":"Sheng Ji","doi":"10.1016/j.tre.2025.104649","DOIUrl":"10.1016/j.tre.2025.104649","url":null,"abstract":"<div><div>Delayed feedback is a prevalent challenge in modern logistics and transportation systems, especially on digital retail platforms. This paper investigates an online learning and pricing problem characterized by aggregated and anonymous delays. In this setting, neither demand nor revenue is immediately observable following a pricing decision; instead, these metrics become available to the retailer only after some stochastic delay. The retailer also faces an initial inventory constraint, creating a complex exploration-exploitation trade-off among learning demand, generating revenue, and managing inventory. To address this challenge, we propose a novel batch-based learning algorithm, referred to as Bandits with Dual Mirror Descent (BUD for short), which integrates mirror descent with bandit control. The algorithm employs a carefully designed batch structure to isolate the impact of delayed feedback, while combining Upper Confidence Bound (UCB) for pricing with dual updates for inventory management. Our theoretical analysis shows that the regret (defined as the revenue gap between the optimal policy and the learning algorithm) of BUD grows sublinearly with the selling horizon and matches the known lower bounds in both bandit with delays and online pricing problems. We conducted numerical experiments to demonstrate that the regret of BUD converges to 0 in various scenarios.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104649"},"PeriodicalIF":8.8,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145940516","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
Joint optimization of flood water routing and congestion-aware evacuation scheduling 洪水路径与拥挤感知疏散调度的联合优化
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-03 DOI: 10.1016/j.tre.2025.104645
Sina Bahrami , Mehdi Nourinejad , Matthew J. Roorda , Yafeng Yin
Urban flood emergencies pose significant risks to human safety and infrastructure operability, particularly in smart cities with interdependent systems. This study proposes an integrated optimization model for coordinating water and transportation networks during flood evacuations. The model simultaneously determines optimal reservoir discharge rates and dynamic vehicular evacuation schedules to maximize the number of evacuees within the limited warning time. Water flow is modeled using the Muskingum-Cunge flood-routing method to simulate flood propagation through a river-reservoir system, while traffic flow is captured via the Cell Transmission Model, which accounts for congestion dynamics and road capacities. The problem is formulated as a nonlinear program and solved through a linear relaxation using generalized Benders decomposition. A case study of the Town of High River, Canada, illustrates the model’s practical utility. Results show that the integrated strategy extends warning times, reduces congestion, and lowers the number of individuals exposed to flood risks compared to uncoordinated approaches. By enabling real-time, infrastructure-aware evacuation planning, the proposed framework offers a scalable decision-support tool for emergency managers. This work contributes to the growing body of research on the management of city infrastructures under disruption and supports the development of resilient and coordinated evacuation strategies in smart urban environments.
城市突发洪水事件对人类安全和基础设施的可操作性构成重大风险,特别是在具有相互依存系统的智慧城市。本研究提出洪水疏散过程中水运网络协调的综合优化模型。该模型同时确定最优水库流量和动态车辆疏散计划,在有限的预警时间内实现疏散人数最大化。通过Muskingum-Cunge洪水路径方法模拟洪水在河流-水库系统中的传播,而通过细胞传输模型(Cell Transmission Model)捕获交通流量,该模型考虑了拥堵动态和道路容量。该问题被表述为一个非线性规划,并通过广义Benders分解的线性松弛来求解。以加拿大High River镇为例,说明了该模型的实用性。结果表明,与不协调的方法相比,综合策略延长了预警时间,减少了拥堵,降低了暴露于洪水风险的个体数量。通过实现实时、感知基础设施的疏散规划,提议的框架为应急管理人员提供了可扩展的决策支持工具。这项工作有助于对城市基础设施在中断下的管理进行越来越多的研究,并支持在智能城市环境中制定有弹性和协调的疏散策略。
{"title":"Joint optimization of flood water routing and congestion-aware evacuation scheduling","authors":"Sina Bahrami ,&nbsp;Mehdi Nourinejad ,&nbsp;Matthew J. Roorda ,&nbsp;Yafeng Yin","doi":"10.1016/j.tre.2025.104645","DOIUrl":"10.1016/j.tre.2025.104645","url":null,"abstract":"<div><div>Urban flood emergencies pose significant risks to human safety and infrastructure operability, particularly in smart cities with interdependent systems. This study proposes an integrated optimization model for coordinating water and transportation networks during flood evacuations. The model simultaneously determines optimal reservoir discharge rates and dynamic vehicular evacuation schedules to maximize the number of evacuees within the limited warning time. Water flow is modeled using the Muskingum-Cunge flood-routing method to simulate flood propagation through a river-reservoir system, while traffic flow is captured via the Cell Transmission Model, which accounts for congestion dynamics and road capacities. The problem is formulated as a nonlinear program and solved through a linear relaxation using generalized Benders decomposition. A case study of the Town of High River, Canada, illustrates the model’s practical utility. Results show that the integrated strategy extends warning times, reduces congestion, and lowers the number of individuals exposed to flood risks compared to uncoordinated approaches. By enabling real-time, infrastructure-aware evacuation planning, the proposed framework offers a scalable decision-support tool for emergency managers. This work contributes to the growing body of research on the management of city infrastructures under disruption and supports the development of resilient and coordinated evacuation strategies in smart urban environments.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104645"},"PeriodicalIF":8.8,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886032","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
Offline operations strategies of bike-sharing platforms: pure profit or beyond profit? 共享单车平台的线下运营策略:纯利润还是超利润?
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-02 DOI: 10.1016/j.tre.2025.104644
Dongliang Guo , Zhi-Ping Fan , Minghe Sun
Bike-sharing platforms can adopt two different offline operations strategies, i.e., independent operations (Strategy I), where each platform independently manages its offline operations, and outsourcing (Strategy O), where one platform outsources its offline operations to another competing platform. With the rise of the “beyond profit” management doctrine, many bike-sharing platforms have begun to pursue dual purposes, i.e., both profits and consumer surpluses, instead of the single purpose, i.e., “pure profit”. Given these facts, this work examines the equilibrium offline operations strategies of two bike-sharing platforms in a duopoly market based on the Hotelling framework and analyzes the platform profits and consumer surplus when the platforms pursue a single purpose or dual purposes. Several important results are obtained. When the platforms engage in intensive competition, the equilibrium operations strategy of the two platforms is Strategy O, and pursuing dual purposes can harm their respective profits. Under weak platform competition, both the investment synergy effect and the investment efficiency of offline operations can significantly affect the platform equilibrium offline operations strategies, and the platforms can obtain higher profits when pursuing dual purposes than pursuing a single purpose if they give low attention weightings to consumer surplus. Additionally, consumer surplus can always be higher when the platforms pursue dual purposes than when pursuing a single purpose, but Pareto improvement may be achieved by the platforms and consumers regardless of the platform competition intensity and the adoption of Strategy I or O.
共享单车平台可以采用两种不同的线下运营策略,即独立运营(策略I)和外包(策略O),即一个平台将其线下运营外包给另一个竞争平台。随着“超越利润”管理理念的兴起,许多共享单车平台开始追求双重目的,即利润和消费者剩余,而不是单一目的,即“纯利润”。在此基础上,本文基于Hotelling框架,考察了双寡头市场下两个共享单车平台的均衡线下运营策略,并分析了平台追求单一目的和双重目的时的平台利润和消费者剩余。得到了几个重要的结果。当平台处于激烈竞争时,两个平台的均衡运营策略为O策略,追求双重目的会损害各自的利润。在弱平台竞争条件下,线下运营的投资协同效应和投资效率都会显著影响平台均衡的线下运营策略,且当平台对消费者剩余的关注权重较低时,追求双重目标的平台可以比追求单一目标的平台获得更高的利润。此外,当平台追求双重目标时,消费者剩余总是比追求单一目标时更高,但无论平台竞争强度和采用策略I或O,平台和消费者都可能实现帕累托改进。
{"title":"Offline operations strategies of bike-sharing platforms: pure profit or beyond profit?","authors":"Dongliang Guo ,&nbsp;Zhi-Ping Fan ,&nbsp;Minghe Sun","doi":"10.1016/j.tre.2025.104644","DOIUrl":"10.1016/j.tre.2025.104644","url":null,"abstract":"<div><div>Bike-sharing platforms can adopt two different offline operations strategies, i.e., independent operations (Strategy I), where each platform independently manages its offline operations, and outsourcing (Strategy O), where one platform outsources its offline operations to another competing platform. With the rise of the “beyond profit” management doctrine, many bike-sharing platforms have begun to pursue dual purposes, i.e., both profits and consumer surpluses, instead of the single purpose, i.e., “pure profit”. Given these facts, this work examines the equilibrium offline operations strategies of two bike-sharing platforms in a duopoly market based on the Hotelling framework and analyzes the platform profits and consumer surplus when the platforms pursue a single purpose or dual purposes. Several important results are obtained. When the platforms engage in intensive competition, the equilibrium operations strategy of the two platforms is Strategy O, and pursuing dual purposes can harm their respective profits. Under weak platform competition, both the investment synergy effect and the investment efficiency of offline operations can significantly affect the platform equilibrium offline operations strategies, and the platforms can obtain higher profits when pursuing dual purposes than pursuing a single purpose if they give low attention weightings to consumer surplus. Additionally, consumer surplus can always be higher when the platforms pursue dual purposes than when pursuing a single purpose, but Pareto improvement may be achieved by the platforms and consumers regardless of the platform competition intensity and the adoption of Strategy I or O.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104644"},"PeriodicalIF":8.8,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145876989","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
Spatiotemporal Features-Aware relocating for idle vehicles using spatial mean field deep Q network reinforcement learning 基于空间平均场深度Q网络强化学习的空闲车辆时空特征感知定位
IF 8.8 1区 工程技术 Q1 ECONOMICS Pub Date : 2026-01-02 DOI: 10.1016/j.tre.2025.104651
Zhiju Chen , Kai Liu , Jiangbo Wang , Jintao Ke
The cruising behavior of idle ride-hailing vehicles in search of passengers is a key influencing factor that restricts the spatiotemporal balance between online ride-hailing supply and passenger demands. This paper aims to simulate the strategy of transferring idle vehicles in multiple hexagonal partitions to adjacent grid partitions by proposing a spatiotemporal features-aware relocating approach (STFAR) that integrates spatiotemporal features of ride hailing into deep reinforcement learning. Specifically, spatial clustering algorithm and time series clustering algorithm are used to identify the spatiotemporal pattern of ride-hailing demand in each hexagonal partition. In addition, the direction of central hot spot is determined by accurately predicting the future short-term travel demand of each hexagonal partition. Finally, a spatial mean field deep Q network (SMFDQN) reinforcement learning method which regards the hexagonal partition as limited and fixed numbers spatial multi-agents is proposed to optimize the efficiency of idle vehicle transfer. STFAR improves the SMFDQN method by integrating the above spatiotemporal features into state space and action space designs and effectively improves the supply and demand balance in the entire region. Experiments based on Didi Chuxing order data during a certain time period in Chengdu showed that STFAR increases the cumulative order revenue by 3.64%, increases the completion rate of demand by 4.03%, and increases the dispatched rate of idle vehicles by 2.98% compared with the state-of-the-art algorithms.
空闲网约车寻客巡航行为是制约网约车供需时空平衡的关键影响因素。本文提出了一种时空特征感知的重新定位方法(STFAR),该方法将网约车的时空特征集成到深度强化学习中,旨在模拟将多个六边形分区中的闲置车辆转移到相邻网格分区的策略。具体而言,利用空间聚类算法和时间序列聚类算法识别每个六边形分区内网约车需求的时空格局。此外,通过对各六边形分区未来短期出行需求的准确预测,确定中心热点的方向。最后,提出了一种将六边形划分为有限固定数量的空间多智能体的空间均场深度Q网络(SMFDQN)强化学习方法来优化闲置车辆转移效率。STFAR改进了SMFDQN方法,将上述时空特征整合到状态空间和动作空间设计中,有效改善了整个区域的供需平衡。基于滴滴出行在成都某时间段的订单数据进行的实验表明,与现有算法相比,STFAR算法使累计订单收入提高3.64%,使需求完成率提高4.03%,使闲置车辆调度率提高2.98%。
{"title":"Spatiotemporal Features-Aware relocating for idle vehicles using spatial mean field deep Q network reinforcement learning","authors":"Zhiju Chen ,&nbsp;Kai Liu ,&nbsp;Jiangbo Wang ,&nbsp;Jintao Ke","doi":"10.1016/j.tre.2025.104651","DOIUrl":"10.1016/j.tre.2025.104651","url":null,"abstract":"<div><div>The cruising behavior of idle ride-hailing vehicles in search of passengers is a key influencing factor that restricts the spatiotemporal balance between online ride-hailing supply and passenger demands. This paper aims to simulate the strategy of transferring idle vehicles in multiple hexagonal partitions to adjacent grid partitions by proposing a spatiotemporal features-aware relocating approach (STFAR) that integrates spatiotemporal features of ride hailing into deep reinforcement learning. Specifically, spatial clustering algorithm and time series clustering algorithm are used to identify the spatiotemporal pattern of ride-hailing demand in each hexagonal partition. In addition, the direction of central hot spot is determined by accurately predicting the future short-term travel demand of each hexagonal partition. Finally, a spatial mean field deep Q network (SMFDQN) reinforcement learning method which regards the hexagonal partition as limited and fixed numbers spatial multi-agents is proposed to optimize the efficiency of idle vehicle transfer. STFAR improves the SMFDQN method by integrating the above spatiotemporal features into state space and action space designs and effectively improves the supply and demand balance in the entire region. Experiments based on Didi Chuxing order data during a certain time period in Chengdu showed that STFAR increases the cumulative order revenue by 3.64%, increases the completion rate of demand by 4.03%, and increases the dispatched rate of idle vehicles by 2.98% compared with the state-of-the-art algorithms.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"208 ","pages":"Article 104651"},"PeriodicalIF":8.8,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145876990","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