Transportation Research Part B-Methodological最新文献

{"title":"Exact solution method for multi-stakeholder freight transportation systems under uncertainty","authors":"Gita Taherkhani ,&nbsp;Mojtaba Hosseini ,&nbsp;Ali Hassanzadeh","doi":"10.1016/j.trb.2025.103288","DOIUrl":"10.1016/j.trb.2025.103288","url":null,"abstract":"<div><div>At a time where efficient freight logistics are crucial to global commerce, integrated multi-stakeholder freight transportation systems play a pivotal role in ensuring timely delivery and operational adaptability under uncertainty. This study focuses on the tactical planning of such a system, which processes time-sensitive requests from both carriers and shippers. It orchestrates operations spatially and temporally, combining loads from various shippers into unified transport units. Our approach utilizes a two-stage stochastic programming model that effectively captures the uncertainties inherent in demand. The model formulates an efficient service network that not only meets the immediate logistical demands but also adapts to fluctuating conditions by leveraging available service capacities. To solve this complex model, we develop and implement an exact Benders decomposition-based algorithm. Our solution methodology incorporates several advanced techniques including partial decomposition, cut-lifting for both optimality and feasibility cuts, and various preprocessing steps including variable fixing and the use of valid inequalities. Additionally, we implement acceleration techniques that capitalize on the repetitive nature of our algorithm to enhance efficiency. We design and generate test instances inspired by real-world freight logistics, capturing key operational constraints and varying demand uncertainty levels. These instances enable a systematic evaluation of our model under diverse settings. We then perform extensive computational experiments. Our solution methodology demonstrates superior performance compared to a commercial solver. We also explore the impact of varying service availability among other parameters and the benefits of using stochastic modeling over deterministic approaches. These experiments underscore our model’s capacity to improve operational efficacy and responsiveness when dealing with uncertainty, thereby providing significant insights for both practitioners and researchers involved in freight logistics.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103288"},"PeriodicalIF":6.3,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144922205","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}

{"title":"Evidence and quantification of cooperation of driving agents in mixed traffic flow","authors":"Di Chen ,&nbsp;Jia Li ,&nbsp;Michael Zhang","doi":"10.1016/j.trb.2025.103285","DOIUrl":"10.1016/j.trb.2025.103285","url":null,"abstract":"<div><div>Cooperation is a ubiquitous phenomenon in many natural, social, and engineered systems with multiple agents. Understanding the formation of cooperation in mixed traffic is of theoretical interest in its own right, and could also benefit the design and operations of future automated and mixed-autonomy transportation systems. However, how cooperativeness of driving agents can be defined and identified from empirical data seems ambiguous and this hinders further empirical characterizations of the phenomenon and revealing its behavior mechanisms. Towards mitigating this gap, in this paper, we propose a unified conceptual framework to identify collective cooperativeness of driving agents. This framework expands the concept of collective rationality from our recent model (Li et al., 2022), making it empirically identifiable and behaviorally interpretable in realistic (microscopic and dynamic) settings. This framework integrates mixed traffic observations at both microscopic and macroscopic scales to estimate critical behavioral parameters that describe the collective cooperativeness of driving agents. Applying this framework to NGSIM I-80 trajectory data, we empirically confirm the existence of collective cooperation and quantify the condition and likelihood of its emergence. This study provides the first empirical understanding of collective cooperativeness in human-driven mixed traffic and points to new possibilities to manage mixed autonomy traffic systems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103285"},"PeriodicalIF":6.3,"publicationDate":"2025-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144920016","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}

{"title":"Solving connected automated vehicle merging problems: A generalized benders decomposition-based approach for mixed-integer nonlinear programming","authors":"Jieming Chen ,&nbsp;Yiwei Wu ,&nbsp;Yue Zhou ,&nbsp;Edward Chung ,&nbsp;Shuaian Wang","doi":"10.1016/j.trb.2025.103293","DOIUrl":"10.1016/j.trb.2025.103293","url":null,"abstract":"<div><div>Intensive interactions among vehicles often lead to congestion and accidents, particularly at freeway merging sections. As connected automated vehicles (CAVs) become a reality, their collaborative driving offers a promising solution. However, the real-time scheduling and trajectory planning for multiple CAV streams remain challenging and are not adequately addressed in the existing literature. To this end, this study formulates an integrated mixed-integer nonlinear programming (MINLP) model to jointly optimize lane change decisions, vehicle sequences, and vehicle trajectories, with the objective of maximizing traffic efficiency and driving comfort at multi-lane freeway merging sections. Existing commercial software struggles to handle such a complicated model. To rapidly obtain solutions, this study designs a Generalized Benders Decomposition (GBD)-based solution algorithm to tackle the problem of multi-vehicle combinatorial optimization and nonlinear trajectory optimization. Meanwhile, the finite convergence property of the GBD approach is proved. Numerical experimental results demonstrate that the proposed model outperforms three benchmark CAV control methods and a two-step method under various traffic demands and mainline-ramp demand ratios, highlighting significant traffic benefits from jointly planning lane changes and driving sequences, as well as utilizing microscopic vehicle information. Furthermore, this study evaluates traffic delay and the number of lane changes under varying road lengths, i.e., the lengths of lane-changing and merging areas, identifying recommended lengths for the maximum traffic efficiency, and analyzing the performance trend under varying traffic demands.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103293"},"PeriodicalIF":6.3,"publicationDate":"2025-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144920015","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}

{"title":"Choice-driven bilevel optimization for multiclass traffic congestion management via eco-routing incentives","authors":"Mingye Luan ,&nbsp;Taha Hossein Rashidi ,&nbsp;S. Travis Waller ,&nbsp;David Rey","doi":"10.1016/j.trb.2025.103289","DOIUrl":"10.1016/j.trb.2025.103289","url":null,"abstract":"<div><div>This study contributes to sustainable transportation modeling by proposing a user-centric approach to incentivize eco-routing travel behavior. We propose a novel reward credit scheme to provide path-based commuter incentives with the goal of reducing <span><math><mrow><mi>C</mi><msub><mrow><mi>O</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math></span> emissions and the total system travel time. The scheme takes into account multiple classes of commuters in the network that differ by their value of time and their vehicle energy type. Users subscribing to the scheme may earn monetary reward credits which act as incentives to promote sustainable mobility. Two types of reward credits are considered: subscription- and path-based credits. A discrete choice model is embedded within a traffic assignment model to capture the endogenous impact of commuters’ scheme adoption onto network congestion effects. We introduce a bilevel optimization formulation to determine optimal non-additive, path-based reward credits and subscription-based reward credits within a predefined budget under traffic equilibrium conditions. In this formulation, the follower problem is a parameterized multi-class user equilibrium traffic assignment problem with non-additive path costs and incorporates a logit choice model for scheme adoption. The leader represent the network regulator whose goal is to maximize social welfare by minimizing the total system travel time and total <span><math><mrow><mi>C</mi><msub><mrow><mi>O</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></math></span> emissions. We develop a single-level Karush–Kuhn–Tucker reformulation and propose a customized branch-and-bound algorithm to solve this bilevel optimization problem. Numerical experiments demonstrate the potential of eco-routing incentives to promote sustainable urban mobility and highlight the benefits of combining subscription- and path-based reward credits for traffic congestion management.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103289"},"PeriodicalIF":6.3,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144912654","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}

{"title":"C-MP: A decentralized adaptive-coordinated traffic signal control using the Max Pressure framework","authors":"Tanveer Ahmed ,&nbsp;Hao Liu ,&nbsp;Vikash V. Gayah","doi":"10.1016/j.trb.2025.103308","DOIUrl":"10.1016/j.trb.2025.103308","url":null,"abstract":"<div><div>Coordinated traffic signals seek to provide uninterrupted vehicular flow through a series of closely spaced intersections, typically using pre-defined fixed signal timings and offsets. However, coordination is typically not possible when using adaptive traffic signals that dynamically change signal timings based on observed traffic conditions, particularly in decentralized systems where these decisions are made independently at each intersection. To alleviate this issue, this paper introduces a novel Max Pressure-based traffic signal framework that specifically seeks to provide coordination even under decentralized decision-making. The proposed Coordinated Max Pressure (C-MP) algorithm uses the space mean speeds of vehicles – obtained from detectors or in a connected vehicle (CV) environment – to explicitly detect freely flowing platoons of vehicles and prioritizes their movement along a corridor. Specifically, upstream platoons are detected, and their weight in the MP framework is increased to provide priority, while downstream platoons are detected, and their weight is reduced to ensure smooth traffic flow across corridors. The study analytically proves that C-MP maintains the desirable maximum stability property, while micro-simulation analyses conducted on an arterial network demonstrate its ability to achieve a larger stable region compared to benchmark MP control policies. Simulation results also reveal that the proposed control algorithm can effectively coordinate traffic signals in both directions along an arterial without explicitly assigned offsets or constraints. The results also reveal C-MP's superiority to benchmark coordination strategies in reducing travel time, and fuel consumption both at the corridor level and the network level by balancing the negative impact imparted to vehicles in the minor direction. The proposed algorithm also functions effectively when a subset of vehicles provide input to the controller, as would be the case in a partial CV environment.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103308"},"PeriodicalIF":6.3,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144912534","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}

{"title":"Robust planning for electric vehicle charging stations under congestion","authors":"Yongzhen Li ,&nbsp;Jia Shu ,&nbsp;Chengyao Wang ,&nbsp;Ting Wu ,&nbsp;Yinghui Wu","doi":"10.1016/j.trb.2025.103291","DOIUrl":"10.1016/j.trb.2025.103291","url":null,"abstract":"<div><div>The last decades have witnessed the rise of electric vehicle (EV) sales, accompanied by a growing demand for readily accessible public EV charging facilities. Unlike refueling a fossil fuel vehicle, charging an EV requires significantly more time, which may lead to congestion if the public charging infrastructure is not well-designed. In this paper, we study the strategic planning of public EV charging stations, aiming to place chargers with a limited investment budget to maximize the coverage of uncertain charging demand. To ensure service quality under possible congestion, we introduce two types of chance constraints to mitigate long waiting times and reduce demand loss in situations with limited waiting space. Given the challenges in accurately estimating charging demand and charging time, we apply a robust approach to model this problem with uncertain charging demand arrival and service rates. The robust model is then reformulated into an equivalent mixed integer linear program of moderate size, which is tractable by commercial solvers. A case study based on data from Nanjing demonstrates the effectiveness of the proposed robust approach and provides insights into real-world applications. Extensions with a general charging process and decentralized driver selection of charging stations are also discussed and verified through extensive numerical experiments, which indicates the stable performance of the proposed approach under general settings.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103291"},"PeriodicalIF":6.3,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144904235","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}

{"title":"Real-time vehicle location estimation in signalized networks using partial connected vehicle trajectory data","authors":"Shaocheng Jia ,&nbsp;S.C. Wong ,&nbsp;Wai Wong","doi":"10.1016/j.trb.2025.103292","DOIUrl":"10.1016/j.trb.2025.103292","url":null,"abstract":"<div><div>Real-time vehicle location estimation is essential for diverse transportation applications, such as travel time estimation, arrival pattern estimation, and adaptive signal control. Existing connected vehicle-based studies rely on either black-box neural networks requiring large training datasets or computationally intensive time-continuous movement simulations grounded in car-following models. However, they often overlook the distinct vehicle location patterns in source lanes, which define network boundaries and experience random arrivals, and intermediate lanes, situated between intersections and receiving traffic discharged from upstream. These patterns are critical for accurate vehicle location estimation. To address these limitations, this study proposes a generic and fully analytical CV-based vehicle location (CVVL) model for estimating vehicle locations within a signalized lane in a network using readily available partial CV trajectory data. The proposed model is applicable to any signal timing, traffic demand, and CV penetration rate and consists of two sub-models: CVVL-S and CVVL-I. The CVVL-S sub-model estimates vehicle locations in source lanes, where vehicle distribution tends to be relatively homogeneous owing to random arrivals. In contrast, the CVVL-I sub-model focuses on estimating vehicle locations in intermediate lanes, where sequential discharges from different upstream lanes can lead to the formation of multiple platoons, adding complexity to vehicle location estimation. The proposed model decomposes the complex task into three sequential sub-problems: identifying candidate platoons (CPs), estimating the number of vehicles in each CP, and determining the spatial distribution of vehicles within each CP. Extensive numerical experiments were conducted under various traffic conditions, CV penetration rates, and times of interest using the VISSIM platform and the real-world Next Generation Simulation dataset. The results demonstrate that the proposed CVVL model achieved improvements of 0–45 %, 0–37 %, and 4–34 % in precision, recall, and F1 score, respectively, compared with the competing method. These results highlight the model’s potential to enhance the accuracy and reliability of various downstream applications.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103292"},"PeriodicalIF":6.3,"publicationDate":"2025-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144866928","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}

{"title":"Hierarchical bus transit network design in coordination with an existing metro system","authors":"Xingrong Wang ,&nbsp;David Canca ,&nbsp;Ying Lv ,&nbsp;Yiwei Zhao ,&nbsp;Huijun Sun ,&nbsp;Jianjun Wu","doi":"10.1016/j.trb.2025.103286","DOIUrl":"10.1016/j.trb.2025.103286","url":null,"abstract":"<div><div>The construction of a well-coordinated metro-bus bimodal system may benefit not only passengers performing bimodal trips but also passengers using each individual transit mode. With this aim, this paper focuses on jointly designing a bus network and determining the frequency of bus lines to ensure coordinated operation with an existing metro system. In particular, rather than implementing a single regular line type, a hierarchical bus network structure consisting of different types of bus lines is proposed with the objective of reaching better intermodal coordination. Each line type is characterized by a specific stopping pattern, commercial speed level, and terminal stations. A novel inter-stop distance-based model is proposed to determine the number and the itinerary of the different types of lines and the appropriate bus frequencies so that the total passenger travel time in the bimodal network is minimized under capacity limitations. Meanwhile, a multinomial logit model is incorporated to explicitly capture the endogenous multimodal passenger assignment regarding service level and ticket price. To efficiently solve the hierarchical network design problem, the concept of an improved hierarchical virtual road network is defined. Based on it, a bi-level heuristic decomposition method that breaks down the integrated problem into two simpler subproblems and then solves them iteratively is presented. In addition, the passenger demand information is used internally by the solving procedure in several specialized operators to accelerate the convergence of the algorithm and improve the quality of the solutions. The results of a small-scale case and a real-world network design instance considering three types of lines show that by making a trade-off between lines with different running speeds resulting from different average inter-stop distances, the hierarchical bus network can incentivize commuters into route choices that improve the overall system performance of the integrated metro-bus bimodal network.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103286"},"PeriodicalIF":6.3,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144864554","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}

{"title":"Optimal matching for ridesharing systems with endogenous and flexible user participation","authors":"Patrick Stokkink ,&nbsp;Zhenyu Yang ,&nbsp;Nikolas Geroliminis","doi":"10.1016/j.trb.2025.103290","DOIUrl":"10.1016/j.trb.2025.103290","url":null,"abstract":"<div><div>The performance of ridesharing systems is intricately entwined with user participation. To characterize such interplay, we adopt a repeated multi-player, non-cooperative game approach to model a ridesharing platform and its users’ decision-making. Users reveal to the platform their participation preferences over being only riders, only drivers, flexible users, and opt-out based on the expected utilities of each mode. The platform optimally matches users with different itineraries and participation preferences to maximize social welfare. We analytically establish the existence and uniqueness of equilibria and design an iterative algorithm for the solution, for which convergence is guaranteed under mild conditions. A case study is conducted with real travel demand data in Chicago. The results highlight the effect of users’ flexibility regarding mode preferences on system performance (i.e., the average utility of users and the percentage of successful matches). A sensitivity analysis on the level of subsidy and the distribution of utility between matched riders and drivers shows that uneven distributions of utility may lead to a higher percentage of successful matches. Additional insights are provided on the effect of a user’s origin and destination locations on their role choice and likelihood to be matched.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103290"},"PeriodicalIF":6.3,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144860278","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}

{"title":"Scheduling UAV-assisted urban subway inspection services","authors":"Bolong Zhou ,&nbsp;Wenjia Zeng ,&nbsp;Wei Liu ,&nbsp;Hai Yang","doi":"10.1016/j.trb.2025.103287","DOIUrl":"10.1016/j.trb.2025.103287","url":null,"abstract":"<div><div>The periodic inspection and maintenance of subway facilities are essential for ensuring system and passenger safety. However, the current manual inspection practices conducted by expert engineers are time-consuming, costly, and pose risks to workers. Unmanned aerial vehicles (UAVs) offer a promising solution for automatically inspecting subway facilities. This paper investigates an operational-level synchronized optimization problem, aiming to determine an optimal inspection timetable while simultaneously optimizing working schedules for both human teams and UAVs. Demand heterogeneity is taken into account since the variety of facilities and equipment in subway tunnels may have different required inspection cycles. By constructing “feasible and optimal task combination” sets, an Integer Linear Programming (ILP) model is formulated to address this NP-hard problem. We apply Dantzig–Wolfe decomposition to obtain a set-covering reformulation and develop an exact solution algorithm integrating Benders decomposition within a branch-and-price framework to solve the model efficiently. The approach is strengthened by implementing several tailored acceleration strategies. Extensive numerical experiments have been carried out. The results show that our proposed optimization model and algorithms can find the optimal or near-optimal solution for real-world scale instances, resulting in cost savings and improved efficiency. Furthermore, we highlight the benefits of integrated optimization by comparing our solution approach with a sequential method that addresses inspection timetables and working schedules separately.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103287"},"PeriodicalIF":6.3,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144771497","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}