编者按
在本文章中，我们对交通运筹领域顶刊《Transportation Research Part B: Methodological》于2026年6月份在线发布的文章中进行了精选（共8篇），并总结其基本信息，旨在帮助读者快速洞察行业最新动态。本月 TR-B 发文围绕交通系统运营优化与效能提升核心主题，覆盖城市路网、轨道交通、港口水运、低空物流、客运接驳等多元交通场景，以数学规划与运筹优化方法为核心，融合交通流机理、排队论、图论等多学科理论构建精细化决策模型，并设计列生成、Benders 分解等高效求解算法，为各类交通场景下的资源优化配置、拥堵治理与服务质量提升提供系统性的理论方案与技术支撑。
文章1
●题目：Dynamic syncrolift dock scheduling
动态同步提升式船坞调度研究
●原文链接：https://doi.org/10.1016/j.trb.2026.103520
●作者：
Mengtong Wang (a), Shengnan Shu (b), Qiang Meng (b)
(a)School of Economics and Management, Beijing Jiaotong University, Beijing, 100044, China
(b)Department of Civil and Environmental Engineering, National University of Singapore, 117576, Singapore
●发布时间：2026-6-3
●摘要：
Dry-docking plays a crucial role in the overall maintenance process of ships, enabling maintenance, repair, and inspection operations to be carried out without the constraints of being in the water and allowing merchant ships to renew their safety certificates. As the global merchant fleet continues to grow, the need for regular dry-docking services is also increasing. In response to these pressing needs, the operational efficiency of dry docks, the specialized facilities for these services, has become crucial. This study addresses this challenge by formulating a dynamic scheduling problem for a syncrolift dock, a modern dry-dock facility featuring a lifting platform, a rail-based transfer system, and multiple onshore berths. The proposed model accounts for the dynamic arrival of ships and incorporates time-dependent nature of ship arrival time uncertainty, reflecting the real-world phenomenon that uncertainty diminishes as actual arrival approaches. To generate the dynamic scheduling for the syncrolift dock, we propose an efficient rolling-horizon decision framework. At each decision epoch, this framework iteratively produces an immediate operational plan by solving a robust subproblem aimed at minimizing the worst-case total departure delay cost of ships based on the time-dependent arrival time uncertainty. Each robust subproblem is solved using a column-and-constraint generation (C&CG) method, whose performance is further enhanced by incorporating a novel cycle-and-path-based iterative method for the master problem and utilizing a dedicated network flow formulation for the subproblem. Extensive computational experiments demonstrate the effectiveness of the proposed methodology and provide practical insights for enhancing the operational management of syncrolift dock facilities.
进坞检修在船舶整体维护过程中发挥着关键作用，它使船舶能够摆脱水中作业的限制，进行维护、修理和检验，并让商船得以更新其安全证书。随着全球商船队规模的持续增长，对定期进坞检修服务的需求也在不断上升。为应对这些迫切需求，作为提供此类服务的专用设施，干船坞的运营效率已变得至关重要。本研究通过构建同步升船机船坞的动态调度问题来应对这一挑战。同步升船机船坞是一种现代干船坞设施，配备有升降平台、轨道转运系统和多个岸上泊位。所提出的模型考虑了船舶的动态抵达，并纳入了船舶抵达时间不确定性的时变特性，这反映了实际中随着真实抵达时刻临近、不确定性逐渐降低的现象。为了生成同步升船机船坞的动态调度方案，我们提出了一个高效的滚动时域决策框架。在每个决策时刻，该框架通过求解一个鲁棒子问题迭代生成即时操作计划，该子问题旨在基于时变抵达时间不确定性，最小化船舶最坏情况下的总离港延误成本。每个鲁棒子问题均采用列与约束生成（C&CG）方法求解，其求解性能通过在主问题中引入一种新的基于环与路径的迭代方法，以及在子问题中采用专门的网络流模型而得到进一步增强。大量计算实验证明了所提方法的有效性，并为提升同步升船机船坞设施的运营管理提供了实用洞见。
文章2
●题目：Optimal measurement of traffic hysteresis under traffic oscillations: A binary integer programming approach
交通振荡下交通迟滞的最优测量：一种0-1整数规划方法
●原文链接：https://doi.org/10.1016/j.trb.2026.103521
●作者：
Fan Pu (a), Yang Zhou (a), Soyoung Ahn (b), Sixu Li (a), Wissam Kontar (c), Xiubin Wang (a)
(a)Zachry Department of Civil and Environmental Engineering, Texas A&M University, 77843, Texas, United States
(b)Department of Civil and Environmental Engineering, University of Wisconsin-Madison, 53706, Wisconsin, United States
(c)Department of Civil and Environmental Engineering, University of Nebraska-Lincoln, 68588, Nebraska, United States
●发布时间：2026-6-6
●摘要：
Traffic hysteresis, a phenomenon observed daily in traffic characterized by flow and density loops on the fundamental diagram, is attributed to intra/inter-driver heterogeneity. Despite extensive analysis, a systematic method to measure hysteresis accounting for these heterogeneities, ensuring the traffic state over each measurement time window remains within an approximate speed, is still missing. This gap becomes more pronounced with the advent of mixed traffic, including automated vehicles (AVs) and human-driven vehicles (HDVs), whose behaviors can significantly differ. This paper investigates an optimal method for measuring traffic hysteresis loops, applicable to both AVs and HDVs, without requiring detailed knowledge of car-following behaviors. Specifically, by representing vehicle trajectories as a directed graph, finding the optimal hysteresis measurement window involves finding an optimal matching that accommodates intra/inter-driver heterogeneity and minimizes speed differences within response time boundaries. We further formulate the matching problem as a variant of the minimum-cost network flow problem, commonly encountered in the logistics domain. A binary integer programming model is proposed, which can be efficiently solved using state-of-the-art solvers. We prove the feasibility and boundedness of our framework to ensure its broad applicability. To validate our method, we compared it with the prevailing parallelogram measurement method in a pure AV scenario under single-frequency oscillation. Our method proved to be more effective, providing more accurate estimates close to theoretical derivations. Subsequently, we applied our method to general traffic conditions, demonstrating that it yields a lower speed variation within measurement regions. Through a series of quantitative analyses on hysteresis, our framework also suggests that the prevailing method may overestimate hysteresis.
交通迟滞是日常交通中观察到的一种典型现象，其特征表现为交通流基本图上的流量-密度回线，通常归因于驾驶员内部及驾驶员之间的异质性。尽管已有广泛的研究分析，但目前仍缺乏一种系统性的测量方法，能够兼顾这些异质性、并确保每个测量时间窗内的交通状态保持在相近的速度下。随着由自动驾驶汽车（AV）和人类驾驶汽车（HDV）组成的混合交通流的出现，两者的跟驰行为可能存在显著差异，这一研究空白变得更加突出。
本文研究了一种用于测量交通迟滞回线的最优方法，该方法同样适用于自动驾驶汽车和人类驾驶汽车，且无需掌握详细的车辆跟驰行为知识。具体而言，通过将车辆轨迹表示为有向图，寻找最优迟滞测量窗口的问题便转化为寻找一种最优匹配。这种匹配能够容纳驾驶员内部与驾驶员之间的异质性，并在反应时间边界内使速度差最小化。我们进一步将该匹配问题构建为物流领域中常见的最小费用网络流问题的一种变体。由此提出了一个0-1整数规划模型，该模型可以利用现有的先进求解器进行高效求解。我们从理论上证明了该框架的可行性与有界性，以确保其具有广泛的适用性。
为了验证该方法，我们在单频振荡下的纯自动驾驶汽车（AV）场景中，将其与目前主流的平行四边形测量法进行了对比。结果证明，我们的方法更为有效，能够提供更接近理论推导值的精确估计。随后，我们将该方法应用于一般交通工况，结果表明，它在测量区域内实现的速度波动更低。通过对迟滞现象进行的一系列定量分析，我们的框架还表明，现有主流方法可能会高估迟滞的严重程度。
文章3
●题目：Physics-informed graph modeling for traffic shockwave analysis through optimized change-point detection
基于优化变点检测与物理驱动图建模的交通冲击波分析
●原文链接：https://doi.org/10.1016/j.trb.2026.103522
●作者：
Tianya Zhang (a), Xiunan Wang (b), Pengyuan Sun (c), Maged Shoman (c), Benedetto Piccoli (d), Peter J. Jin (e)
(a)School of Rail Transportation, Soochow University, Suzhou, Jiangsu, 215006, China
(b)Department of Mathematics, University of Tennessee at Chattanooga, 615 McCallie Ave, Chattanooga, TN, 37403, USA
(c)The University of Tennessee-Oak Ridge Innovation Institute, Oak Ridge, TN, 37830, USA
(d)Department of Mathematical Sciences, Rutgers University, Camden, NJ, 08102, USA
(e)Civil and Environmental Engineering Department, Rutgers University, New Brunswick, NJ, 77840, USA
●发布时间：2026-6-8
●摘要：
Shockwaves represent one of the most consequential and pervasive disturbances in highway operations, yet existing shockwave identification methods struggle to capture the underlying causal mechanisms. This paper introduces a novel framework that fundamentally reconceptualizes driver dynamics through graph theory, redefining shockwave formation and dissipation as chains of causally linked braking and acceleration behaviors. The methodology employs an optimized Change Point Detection (CPD) algorithm to segment individual vehicle trajectories and identify significant acceleration and deceleration events at the microscopic level. A graph-based clustering technique then connects these events across multiple vehicles, explicitly capturing the inherent causation of shockwave propagation by tracing how one vehicle’s deceleration triggers a cascade of braking responses in following vehicles, propagating upstream against the direction of traffic flow. This approach transforms shockwave identification from a statistical classification problem into a network propagation perspective, ensuring the detection of physically reasonable propagation waves that reflect actual driver-to-driver interactions. Comprehensive performance evaluation against baseline methods demonstrates the superiority of the framework in characterizing key shockwave properties, including propagation speed, spatial extent, duration, and oscillation intensity. Through sensitivity analysis and ablation study, this approach has been proved a robust foundation for traffic flow analysis, effectively bridging microscopic driver behaviors with macroscopic flow phenomena through the lens of graph modeling methodology.
冲击波是高速公路运营中最具影响且最普遍的干扰之一，然而现有的冲击波识别方法往往难以捕捉其背后的因果机制。本文引入了一个全新的研究框架，通过图论从根本上重新构建了驾驶员动力学，将交通冲击波的形成和消散重新定义为一系列具有因果关联的制动（刹车）与加速行为链。
该方法首先采用一种优化的变点检测（CPD）算法来分割单车行驶轨迹，并在微观层面上识别显著的加速和减速事件。随后，利用一种基于图的聚类技术将多辆车的这些事件有机连接起来。通过追踪前车的减速如何引发后车一系列连锁的刹车反应、并逆着交通流方向向上传播，该技术显式地捕捉了冲击波传播的内在因果关系。这种方法将冲击波识别从传统的统计分类问题转化为网络传播的视角，从而确保检测到能够反映实际驾驶员间互动、且符合物理规律的传播波。与基准方法的全面对比评估表明，该框架在刻画冲击波核心特征（包括传播速度、空间范围、持续时间以及振荡强度）方面具有显著的优越性。通过敏感性分析和消融实验，研究进一步证明了该方法能为交通流分析奠定坚实的基础，并借助图建模的视角，有效架起了微观驾驶员行为与宏观交通流现象之间的桥梁。
文章4
●题目：Queue replacement approach to dynamic user equilibrium assignment with route and departure time choice
动态用户均衡分配中路径与出发时间同步选择的排队替代方法
●原文链接：https://doi.org/10.1016/j.trb.2026.103523
●作者：
Takara Sakai (a), Takashi Akamatsu (b), Koki Satsukawa (b)
(a)Department of Civil and Environmental Engineering, Institute of Science Tokyo, 2-12-1 W6-9, Ookayama, Meguro, Tokyo, 152-8550, Japan
(b)Graduate School of Information Sciences, Tohoku University, 6-6 Aramaki Aoba, Aoba-ku, Sendai, Miyagi, 980-8579, Japan
●发布时间：2026-6-10
●摘要：
This study develops a hybrid analytical and numerical approach for dynamic user equilibrium (DUE) assignment with simultaneous route and departure time choice (RDTC) for homogeneous users. The core concept of the proposed approach is the generalized queue replacement principle (GQRP), which establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem. We first present a method for determining whether the GQRP holds. Based on the GQRP, we then develop a systematic procedure to obtain an exact DUE solution by sequentially solving two LPs: one for the equilibrium cost pattern, including queueing delays, and the other for the corresponding equilibrium flow pattern. Computational results on networks of varying scales confirm the effectiveness of the proposed method.
本研究针对同质用户，为同步进行路径与出发时间选择的动态用户均衡（DUE-RDTC）问题，提出了一种混合解析与数值求解方法。所提方法的核心概念是广义排队替代原理（GQRP），该原理建立了均衡排队延误模式与某个线性规划（LP）问题解之间的等价关系，而该LP问题是通过放松原DUE-RDTC问题中的部分条件得到的。本文首先给出了判定GQRP是否成立的方法。基于GQRP，进而提出了一种通过依次求解两个LP问题来获取精确动态用户均衡解的系统化步骤：第一个LP求解包含排队延误的均衡费用模式，第二个LP求解对应的均衡流量模式。在不同规模路网上的计算结果，验证了所提方法的有效性。
文章5
●题目：Come fly with me: Scheduling point-to-point transports with collective drones
随我翱翔：基于组合式无人机的点对点运输调度研究
●原文链接：https://doi.org/10.1016/j.trb.2026.103526
●作者：
Stefan Schwerdfeger (a) (b), Nils Boysen (b), Dirk Briskorn (c)
(a)Friedrich-Schiller-Universität Jena, Lehrstuhl für Management Science, Carl-Zeiß-Straße 3, Jena, 07743, Germany
(b)Friedrich-Schiller-Universität Jena, Lehrstuhl für Operations Management, Carl-Zeiß-Straße 3, Jena, 07743, Germany
(c)Bergische Universität Wuppertal, Professur für BWL, insbesondere Produktion und Logistik, Gaußstr. 20, Wuppertal, 42119, Germany
●发布时间：2026-6-17
●摘要：
Drone usage for transportation tasks has inspired a vast body of operations research literature. Due to the small payloads of current-generation drones, most predecessors treat drone-based transportation in a one-to-many distribution context where a single fulfillment center distributes lightweight, small-sized goods to many customer households. Recent technological progress, however, advocates a coupling of multiple smaller drones to collective drones, cooperating in the aerial transport of bulky and heavier loads over longer distances. Collective drones, thus, open up the application of drones for point-to-point transportation services. Against this backdrop, we consider the following scheduling problem: Given a set of jobs, each representing a point-to-point transport with a given origin, destination, flight time, and weight, as well as a heterogeneous fleet of drones with varying lifting capacity, we seek a schedule, where the sum of lifting capacities of the drones assigned to each job meets the weight requirement, drones have enough time to move between subsequent jobs, and the makespan is minimum. We formulate the resulting collective drone scheduling problem, provide an in-depth analysis of computational complexity, and introduce suitable solution methods based on decomposition. Our computational study explores the performance of these solution methods and investigates managerial issues such as the impact of different drone fleet compositions.
无人机在运输任务中的应用激发了大量运筹学文献的研究。受限于当前一代无人机的较小有效载荷，多数既有研究将无人机运输置于一对多的配送场景中，即由单个配送中心向众多客户家庭分发轻量、小件商品。然而，近年来的技术进步倡导将多架小型无人机耦合成集体无人机，协同空运大件、较重载荷并进行更长距离的运输。由此，集体无人机开启了无人机在点对点运输服务中的应用。在此背景下，本文考虑如下调度问题：给定一组作业，每项作业代表一次点对点运输，具有确定的起运地、目的地、飞行时间和重量；另有一支具有不同载重能力的异构无人机机队，需寻找一个调度方案，使得分配给每项作业的无人机载重能力之和满足其重量要求，无人机在相继作业之间有足够的转场时间，并最小化最大完工时间。本文构建了由此产生的集体无人机调度问题，深入分析了其计算复杂性，并引入基于分解的合适求解方法。计算实验探究了这些求解方法的性能，并考察了不同无人机机队构成的影响等管理层面的问题。
文章6
●题目：Passenger pickup and drop-off facilities: Throughput capacity evaluation
乘客接送客设施：吞吐能力评估研究
●原文链接：https://doi.org/10.1016/j.trb.2026.103528
●作者：
Anton J. Kleywegt, Xinyu Liu (1) (1)
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 755 Ferst Drive, NW, Atlanta, GA, 30332, USA
●发布时间：2026-6-23
●摘要：
Passenger pickup and drop-off (PUDO) facilities have long been important in facilitating transportation to and from schools, sports facilities, airports, train stations, and other intermodal terminals. Their importance is expected to grow with increasing adoption of on-demand transportation services and self-driving vehicles. The current practice of mostly using curbsides for PUDO will not be sustainable as demand increases.
We develop a stochastic modeling and computational framework to evaluate layout designs and operational policies for PUDO facilities. In this framework, we endogenously model the effects of space utilization, conflicts among vehicle movements, and the resulting delays, on facility throughput rates, whereas these effects were treated as exogenous input by standard aggregate curb-length calculations and queueing approximations. Our results quantify the decreasing returns to scale in throughput capacity and the superlinear growth in congestion with respect to PUDO facility size. We propose a continuous-time Markov decision process formulation to optimize operational policies and to evaluate the performance of near-optimal approximate policies. Computational results are provided to compare facility layouts and operational policies, diagnose congestion in sub-optimally controlled systems, and provide planning-level insights into the design and operation of PUDO facilities.
乘客上下客（PUDO）设施在服务于往返学校、体育场馆、机场、火车站及其他多式联运枢纽的交通方面一直发挥着重要作用。随着按需出行服务和自动驾驶车辆的日益普及，其重要性预计将进一步提升。当前主要依靠路缘进行上下客的做法，在需求持续增长的情况下将难以为继。
本文构建了一个随机建模与计算框架，用于评估PUDO设施的布局设计与运营策略。在该框架中，我们将空间利用、车辆运动冲突及其导致的延误对设施通行率的影响进行内生化建模，而这些影响在标准的集计路缘长度计算和排队论近似方法中通常被处理为外生输入。研究结果量化了通行能力的规模收益递减特征，以及拥堵程度随PUDO设施规模扩大而呈现的超线性增长。我们提出了一种连续时间马尔可夫决策过程模型，用于优化运营策略并评估近优近似策略的性能。本文给出了计算结果，以对比不同设施布局与运营策略，诊断控制欠优系统中的拥堵成因，并为PUDO设施的设计与运营提供规划层面的见解。
文章7
●题目：Train timetabling with rolling stock assignment, short-turning and skip-stop strategy for a bidirectional metro line
双向地铁线路下结合车底运用、小交路运营与跳站停车策略的列车运行图编制研究
●原文链接：https://doi.org/10.1016/j.trb.2026.103529
●作者：
Chanchal Kumar Salode, Prasanna Ramamoorthy
Department of Management Studies, Indian Institute of Technology, Delhi, New Delhi, 110016, India
●发布时间：2026-6-29
●摘要：
Metro train operations are becoming more challenging due to overcrowding and irregular passenger demand. To avoid passenger dissatisfaction, metro operators employ various operational strategies to increase the number of train services using limited number of trains. This paper integrates metro timetabling with several operational strategies to improve passenger services with limited number of trains. We propose three optimization models for timetable planning during both peak and off-peak hours. While the first and second models minimize operational costs, and passenger waiting and travel times, respectively, the third model is a multi-objective model that considers both the objectives simultaneously. These models integrate operational strategies such as rolling-stock assignment, short-turning, and skip-stopping to increase the number of services with limited trains on a bidirectional metro line. To solve the multi-objective model, we propose a Hybrid epsilon-Constraint Logic-Based Benders Decomposition (Hybrid ε-LBBD) approach, which achieves orders-of-magnitude reduction in computation time when compared to the classical epsilon-constraint method. Further, we perform computational experiments for both time-invariant and time-dependent demand arrival patterns. Finally, we also establish relationship of our model with classical queueing theory and thereby propose a Queue-Integrated Fixed-Point Algorithm to reduce congestion. The proposed framework is tested on a simplified version of Santiago Metro Line 1.
随着客流拥挤与非均衡乘客需求的加剧，地铁列车运营面临日益严峻的挑战。为避免引发乘客不满，运营方多采用多样化的运营策略，以利用有限列车数量增开服务班次。本文将地铁运行图编制与多种运营策略相整合，旨在以有限列车资源改善乘客服务质量。针对高峰期与非高峰期的运行图规划，本文提出了三个优化模型：第一个模型最小化运营成本，第二个模型最小化乘客候车时间与在途旅行时间，第三个模型则为同时兼顾上述两类目标的多目标模型。这些模型融合了车底运用、短交路（小交路）运行以及跳站停等运营策略，以在双向地铁线路上实现有限列车条件下的服务班次加密。为求解多目标模型，本文提出一种混合ε约束-逻辑型Benders分解（Hybrid ε-LBBD）方法，与经典ε约束法相比，其计算时间实现了数量级的缩减。此外，针对时不变与时变需求到达模式，均开展了数值计算实验。最后，本文还建立了模型与经典排队论之间的关联，并据此提出排队-集成不动点算法以缓解拥堵。所构建的框架在圣地亚哥地铁1号线的简化线网上进行了测试验证。
文章8
●题目：Mitigating network traffic congestion via link- and path-based incentives
基于路段与路径激励的交通网络拥堵缓解研究
●原文链接：https://doi.org/10.1016/j.trb.2026.103531
●作者：
Ramin Niroumand (a) (b), Shaghayegh Vosough (a), Fahim Kafashan (c), Claudio Roncoli (a) (d), Marco Rinaldi (e), Richard D. Connors (f)
(a)Department of Built Environment, Aalto University, Finland
(b)Optym, USA
(c)Department of Civil, Construction, and Environmental Engineering, North Carolina State University, USA
(d)Mobility and Industrial Management, KU Leuven, Belgium
(e)Department of Transport and Planning, Technical University of Delft, the Netherlands
(f)Luxembourg Institute of Science and Technology, Esch-sur-Alzette, Luxembourg
●发布时间：2026-6-30
●摘要：
This study investigates the potential of link- and path-based incentives to mitigate congestion in urban transportation networks under a budget constraint. Both incentive schemes are formulated as non-linear optimisation problems with complementarity constraints. Mathematically, it is demonstrated that the feasible region of the link-based model is a subset of the feasible region of the path-based model under the same budget constraint. Consequently, path-based incentives exhibit greater potential to shift the user equilibrium flow pattern toward the system optimum compared to link incentives. A column generation-based iterative solution technique, which generates new paths at each iteration, is devised to efficiently solve both optimisation problems. Numerical experiments conducted for various transport networks also highlight the efficiency and scalability of the proposed algorithm, and the superiority of path-based incentives in reducing total travel time in urban transportation networks.
本研究探讨了在预算约束下，基于路段和基于路径的激励措施缓解城市交通网络拥堵的潜力。两种激励方案均被构建为带有互补约束的非线性优化问题。从数学上证明，在相同预算约束下，基于路段模型的可行域是基于路径模型可行域的子集。因此，与路段激励相比，路径激励在将用户均衡流量分布推向系统最优方面具有更大的潜力。为高效求解这两个优化问题，本文设计了一种基于列生成的迭代求解技术，该技术在每次迭代中生成新的路径。针对多种交通网络开展的数值实验，同样凸显了所提算法的高效性与可扩展性，以及路径激励在降低城市交通网络总行程时间方面的优越性。
