Transportation Research Part B-Methodological最新文献

{"title":"Designing reliable bus services with on-time arrival via lane reservation under uncertain travel times","authors":"Xinyi Zhang ,&nbsp;Ada Che ,&nbsp;Peng Wu ,&nbsp;Andrea D’ Ariano","doi":"10.1016/j.trb.2025.103322","DOIUrl":"10.1016/j.trb.2025.103322","url":null,"abstract":"<div><div>The deployment of dedicated bus lanes is a crucial strategy to improve the appeal of bus transit and is significantly affected by a variety of unpredictable events. This study proposes and investigates a novel optimization problem that jointly considers bus lane deployment and bus routing under uncertain travel times, with the objective of achieving reliable bus services with on-time arrivals. We first formulate it as a stochastic programming model. By leveraging prior data, we then construct a flexible moment information-based ambiguity set to capture uncertain link travel times and incorporate it into a distributionally robust optimization (DRO) model with a probabilistic objective function. The DRO model maximizes the reliability of bus services, defined as the probability of ensuring that a bus arrives on time at each stop in the worst-case scenario while simultaneously limiting passenger waiting times. Furthermore, we introduce a convex decision measure called <em>Probability of Violation Risk</em> to evaluate the risk of any stop not being arrived at within the predetermined expected time window. The designed model is then reformulated as a more tractable mixed-integer second-order cone program, upon which a two-stage matheuristic algorithm (TSMA) is developed specifically to solve large-scale realistic networks. Extensive computational tests are performed to verify the effectiveness and efficiency of the TSMA. The results demonstrate that the DRO model can generate robust dedicated lane deployment and bus routing schemes, with worst-case performance that surpasses those achieved using the widely adopted sample average approximation-based approach, an adapted Monte Carlo simulation-based metaheuristic algorithm, and the conventional Bonferroni correction-based method. Moreover, we compare the obtained solutions with those derived from deterministic and robust optimization models, as well as the DRO model based on the traditional moment ambiguity set. Additionally, we conduct numerical experiments to draw meaningful conclusions regarding the budget, maximum negative impact, tightness of expected arrival time windows, and on-time stop arrival rates.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103322"},"PeriodicalIF":6.3,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269298","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":"Dynamics in credit-based mobility systems: Convergence to periodic mode usage equilibrium","authors":"Hongxing Ding ,&nbsp;Xinwei Li ,&nbsp;Hai Yang ,&nbsp;Yafeng Yin","doi":"10.1016/j.trb.2025.103310","DOIUrl":"10.1016/j.trb.2025.103310","url":null,"abstract":"<div><div>This study examines the flow, behavior, and credit dynamics under a credit charge-cum-reward (CCR) scheme that operates periodically. In this scheme, travelers incur an end-of-period credit cost, determined by their periodic mode usage patterns, in addition to regular mode-specific time and monetary costs. As such, travelers are incentivized to make decisions minimizing individual periodic travel costs rather than focusing solely on daily cost minimization. To formulate a CCR-scheme-based dynamic system, we analyze travelers’ intra-period and inter-period learning behaviors and propose two adaptation rules—myopic and forward-looking—for travelers making day-to-day choices. We provide optimal strategies for each traveler under these two rules and derive stability conditions for the dynamic system. Our findings demonstrate that, under mild conditions, both rules, along with travelers’ learning behaviors, lead the dynamic system to converge to a periodic mode usage equilibrium (PUE), where each traveler minimizes their periodic travel costs. Numerical examples illustrate the variations in system performance and traveler behavior across two adaptation rules. This study not only explores the evolution of a CCR-scheme-based dynamic mobility system toward the PUE but also highlights the distinct adaptation behaviors under periodic mobility management policies.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103310"},"PeriodicalIF":6.3,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269297","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":"Nonlinear oscillatory response of automated vehicle car-following: Theoretical analysis with traffic state and control input limits","authors":"Sixu Li,&nbsp;Yang Zhou","doi":"10.1016/j.trb.2025.103315","DOIUrl":"10.1016/j.trb.2025.103315","url":null,"abstract":"<div><div>This paper presents a framework grounded in the theory of describing function (DF) and incremental-input DF to theoretically analyze the nonlinear oscillatory response of automated vehicles (AVs) car-following (CF) amidst traffic oscillations, considering the limits of traffic state and control input. While prevailing approaches largely ignore these limits (i.e., saturation of acceleration/deceleration and speed) and focus on linear string stability analysis, this framework establishes a basis for theoretically analyzing the frequency response of AV systems with nonlinearities imposed by these limits. To this end, trajectories of CF pairs are decomposed into nominal and oscillatory trajectories, subsequently, the controlled AV system is repositioned within the oscillatory trajectory coordinates. Built on this base, DFs are employed to approximate the frequency responses of nonlinear saturation components by using their first harmonic output, thereby capturing the associated amplification ratio and phase shift. Considering the closed-loop nature of AV control systems, where system states and control input mutually influence each other, amplification ratios and phase shifts are balanced within the loop to ensure consistency. This balancing process may render multiple solutions, hence the incremental-input DF is further applied to identify the reasonable ones. The proposed method is validated by estimations from Simulink, and further comparisons with prevailing methods are conducted. Results confirm the alignment of our framework with Simulink results and exhibit its superior accuracy in analysis compared to the prevailing methods. Furthermore, the framework proves valuable in string stability analysis, especially when conventional linear methods offer misleading insights.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103315"},"PeriodicalIF":6.3,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223010","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":"The multi-commodity flow problem with outsourcing decisions","authors":"Elena Fernández ,&nbsp;Ivana Ljubić ,&nbsp;Nicolás Zerega","doi":"10.1016/j.trb.2025.103333","DOIUrl":"10.1016/j.trb.2025.103333","url":null,"abstract":"<div><div>We introduce a new prize-collecting problem involving the routing of commodities in a network composed of predefined hub and non-hub nodes. In this setting, the service of non-hub nodes is outsourced to third-party carriers. This study is motivated by the growing prevalence of outsourcing practices in real-world transportation systems, where new entrants or local suppliers increasingly take over parts of the transportation chain – enabling higher volumes and broader network coverage. The problem is modeled as a Stackelberg game: a major firm (the leader) chooses a subset of commodities to serve. The leader aims to outsource the first and last legs of the transportation services to smaller carriers (the followers), assigning at most one carrier to each non-hub node. Each carrier seeks to maximize its own profit, which depends on the offers made by the leader. The goal of the leader is to determine the optimal outsourcing fees, along with the allocation of carriers to the non-hub nodes, so that the profit from the routed commodities is maximized. The optimal response of the followers must be taken into account, as the followers may reject assignments that do not align with their profit-maximizing goals. We also consider two alternative settings: one in which outsourcing fees are fixed, and another where carriers accept any offer yielding non-negative profit. We demonstrate that the set of feasible outsourcing fees can be discretized and formulate the problem as single-level mixed-integer (non)linear program. For all problem variants, we prove NP-hardness and conduct a computational study of various single-level MIP reformulations. Our benchmark instances cover various applications in transportation, such as air transportation, postal delivery and freight transportation. We assess the scalability of proposed formulations and analyze the impact of different carrier reservation prices on solution quality. Finally, by comparing the alternative problem settings, we extract valuable managerial insights.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103333"},"PeriodicalIF":6.3,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223097","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":"Integrated cruise fleet deployment and itinerary scheduling problem: An enhanced Benders decomposition approach","authors":"Ying Yang,&nbsp;Silong Zhang,&nbsp;Shuaian Wang","doi":"10.1016/j.trb.2025.103321","DOIUrl":"10.1016/j.trb.2025.103321","url":null,"abstract":"<div><div>With the growing popularity of cruise tourism, the issue of comprehensive and precise cruise management is emphasized by the industrial field, which demands effective strategies in both tactical-level cruise deployment and operational-level itinerary scheduling. This rising concern and the expectation of integrated decision, however, increase the complexity of the problem and the difficulty of optimization. This paper provides a cohesive framework and scalable algorithms for the integrated cruise fleet deployment and itinerary scheduling problem. First, to address this problem, we propose an integer programming model based on a time-expanded network that captures the movement dynamics of cruises over a planning horizon. Several problem-specific reformulations including cumulative-flow-based variables and route-based time-expanded network representation are introduced, based on which, we prove that the itinerary scheduling problem is totally unimodular and the integer variables can be relaxed. Second, we introduce a tailored Benders decomposition approach augmented by the simultaneous Magnanti–Wong method, where a valid and pre-obtainable Magnanti–Wong bound is designed, yielding Pareto-optimal cuts in small computation time in each iteration. Finally, we validate our approach using extensive numerical experiments on both simulation instances and a real case study. The results demonstrate the effectiveness of our integrated solving scheme and the practical applicability of our advanced decomposition method, marking a significant advancement in the field of cruise fleet management.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103321"},"PeriodicalIF":6.3,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145223011","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":"A scalable optimization approach for equitable facility location: Methodology and transportation applications","authors":"Drew Horton ,&nbsp;Joshua Murrell ,&nbsp;Daphne Skipper ,&nbsp;Emily Speakman ,&nbsp;Tom Logan","doi":"10.1016/j.trb.2025.103319","DOIUrl":"10.1016/j.trb.2025.103319","url":null,"abstract":"<div><div>Efficient and equitable access to essential services, such as healthcare, food, and education, is an important goal in urban planning, public policy, and transport logistics. However, existing facility location models often do not scale well to large instances, or primarily focus on optimizing average accessibility, neglecting equity concerns, particularly for disadvantaged populations. This paper proposes a novel, scalable framework for equitable facility location, introducing a linearized proxy for the Kolm-Pollak Equally-Distributed Equivalent (EDE) metric to balance efficiency and fairness. Computational experiments demonstrate that our approach scales to extremely large problem instances, while being sensitive enough to account for inequity throughout the distribution, not merely via the maximum value. Moreover, optimal solutions represent significant improvements for the worst-off residents in terms of distance to an open amenity, while also attaining a near-optimal average experience for all users. An extensive real-world case study on supermarket access illustrates the practical applicability of the framework, with additional examples coming from polling applications. As such, the model is extended to handle real-world considerations such as capacity constraints, split demand assignments, and location-specific penalties. By bridging the gap between equity theory and practical optimization, this work offers a robust and versatile tool for researchers and practitioners in urban planning, transportation, and public policy.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103319"},"PeriodicalIF":6.3,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222821","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":"Toward mobility incentive: Integrating green service and carbon inclusion scheme into the ride-hailing market","authors":"Wei Tang ,&nbsp;Xiqun (Michael) Chen ,&nbsp;Der-Horng Lee","doi":"10.1016/j.trb.2025.103320","DOIUrl":"10.1016/j.trb.2025.103320","url":null,"abstract":"<div><div>Increasing individual responsibility for reducing emissions is a potentially effective way to address mobility sustainability issues. In recent years, the carbon inclusion scheme has been widely implemented to incentivize individual low-carbon travel behaviors. Motivated by the practice, this paper examines the ride-hailing market that integrates the green service with the carbon inclusion scheme to comprehend how the government-led carbon inclusion scheme affects the operation of the ride-hailing market and the prospects of reducing carbon emissions and promoting electrification. We propose two product strategies for the ride-hailing platform: (a) One-product strategy with mixed service provided by electric vehicles (EVs) and fuel vehicles (FVs); and (b) Differentiated-product strategy with green service provided by EVs and basic service provided by FVs. We also consider the significant differences in adopting electric buses in different countries/regions when discussing the impact of carbon inclusion on the ride-hailing market. Our findings indicate that without government-led carbon inclusion, it is more appropriate for the ride-hailing platform to adopt the one-product strategy. With government-led carbon inclusion, when the electrification rate of external public transportation is not very high, and the carbon incentive is high enough, the platform can improve its profit by adopting the differentiated-product strategy. Considering the platform's profit maximization decisions, our analysis also highlights that when the electrification rate of the external option is low and the carbon incentive is high, the impact of the carbon inclusion scheme on the ride-hailing market is better in all aspects, which is a win-win outcome that the ride-hailing platform, drivers, and the government would all like (if the government wants to see better driver welfare, electrification and carbon reduction in the ride-hailing market). Additionally, increasing the potential number of EVs in the ride-hailing market and the total number of drivers makes sense both for the platform (to gain higher profits) and government (which may be concerned about increasing driver welfare, the electrification rate and total carbon reduction of the ride-hailing market). The gained managerial insights provide decision support for the platform operating differentiated services and the government implementing carbon inclusion schemes.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103320"},"PeriodicalIF":6.3,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145128230","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":"A modeling methodology for car-following behaviors of automated vehicles: Trade-off between stability and mobility","authors":"Yuqin Zhang ,&nbsp;Ke Ma ,&nbsp;Zhigang Xu ,&nbsp;Hang Zhou ,&nbsp;Chengyuan Ma ,&nbsp;Xiaopeng Li","doi":"10.1016/j.trb.2025.103316","DOIUrl":"10.1016/j.trb.2025.103316","url":null,"abstract":"<div><div>Empirical studies have indicated that automated vehicle (AV) automakers tend to prioritize mobility over stability in designing car-following (CF) models, which may raise safety concerns. A likely explanation for this issue is that hardware-induced response delays challenge the ability of the CF models, as designed by automakers, to maintain an equilibrium between stability and mobility. To address these concerns, this study proposes a modeling methodology for the CF model in AVs aimed at achieving a trade-off between stability and mobility. This methodology seeks to identify the optimal parameters that enhance mobility under stability constraints. First, the linear CF model is calibrated using data from 20 commercial AVs produced by multiple automakers, and the unique response delay values of the linear CF model for each AV are identified. Next, the parameter regions ensuring stability are derived theoretically based on the calibrated response delays for each AV. An optimal mobility objective function is constructed to minimize time headway and reaction time, with the boundaries of the stable parameter regions serving as constraints. It allows the selection of CF parameters that maximize mobility while remaining within the stable regions. This proposed modeling method is applied to all AVs, and the optimal parameters are tested in simulations. Simulation results demonstrate that the proposed optimal model effectively dampens oscillations, reduces safety risks, and maintains shorter spacing, thus achieving an ideal trade-off between stability and mobility for AVs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103316"},"PeriodicalIF":6.3,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145095629","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":"Optimizing continuous-time berth allocation, time-variant quay crane and yard assignment","authors":"Zhiyuan Yang ,&nbsp;Miaomiao Wang ,&nbsp;Shuaian Wang ,&nbsp;Lu Zhen","doi":"10.1016/j.trb.2025.103317","DOIUrl":"10.1016/j.trb.2025.103317","url":null,"abstract":"<div><div>Efficient container terminal operations depend on the coordinated use of three key resources: berths, quay cranes (QCs), and yard space. Decisions involving these components are highly interrelated. Berth allocation affects QC scheduling, which in turn influences yard-side transport. However, the majority of the literature treat these problems separately or under simplifying assumptions such as discrete berth allocation, time-invariant QC allocation, or omission of yard assignment. To the best of our known, this paper is the first to formulate a unified continuous-time optimization model that integrates continuous berth allocation, time-variant QC scheduling, and yard space assignment. To solve our proposed comprehensive decision model, we develop an exact algorithm and accelerate this by designing some novel valid inequalities and M-tightening techniques. The algorithmic efficiency and the benefits of considering the aforementioned decision features are validated through computational experiments. In addition, sensitivity analyses are conducted to derive potentially useful managerial insights.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103317"},"PeriodicalIF":6.3,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145060023","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":"Deep learning-based travel choice prediction with provable and adaptable fairness guarantees","authors":"Zhiwei Chen ,&nbsp;Yufei Xu ,&nbsp;Srinivas Peeta","doi":"10.1016/j.trb.2025.103318","DOIUrl":"10.1016/j.trb.2025.103318","url":null,"abstract":"<div><div>Deep Learning (DL) models offer substantial potential for travel choice predictions but are often plagued by algorithmic unfairness where disadvantaged population groups such as racial minorities and low-income populations often receive disproportionately worse prediction outcomes (e.g. accuracy) compared to their counterparts. Studies to address this issue in the transportation domain are relatively new and they fail to provide provable fairness guarantees and cannot address the diverse interpretations of fairness in practice. This study introduces a novel DL approach that provides provable fairness guarantees while being adaptable to various fairness standards. It embeds statistical hypothesis testing within a practical equality constraint to control disparities in prediction accuracy across different population groups, thus providing provable and adaptable fairness guarantees. This approach results in a threshold modification problem, formulated as a mixed-integer non-linear programming model that is proven to be NP-hard. To allow for efficient problem solving, theoretical properties of the threshold modification problem are investigated, enabling the decomposition of the original problem into smaller, more manageable subproblems. This decomposition provides insights into the problem's structure and enables the development of an efficient \"Accuracy-First-Threshold-Second \" algorithmic framework. Within this framework, an exact solution method is proposed to achieve optimal solutions, whereas a heuristic method, incorporating a sandwich algorithm and a bounded-enumeration algorithm, is designed to efficiently approximate near-optimal solutions. Extensive experiments demonstrate the computational performance of the proposed solution algorithms as well as the ability of the proposed fair DL approach to provide provable and adaptable fairness guarantees for travel choice predictions. This study offers a flexible and theoretically robust solution to fairness in travel choice prediction, with potential applications for enhancing equity in transportation systems.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"200 ","pages":"Article 103318"},"PeriodicalIF":6.3,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049026","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}