Transportation Research Part B-Methodological最新文献

{"title":"Robust coordinated path planning for unmanned aerial vehicles and unmanned surface vehicles in maritime monitoring with travel time uncertainty","authors":"Qingying He ,&nbsp;Wei Liu ,&nbsp;Tian-Liang Liu ,&nbsp;Qiong Tian","doi":"10.1016/j.trb.2025.103284","DOIUrl":"10.1016/j.trb.2025.103284","url":null,"abstract":"<div><div>This study examines the routing and scheduling of an integrated system of unmanned aerial vehicles (UAVs) and unmanned surface vehicles (USVs) for maritime surveillance. The uncertainties in air and maritime conditions can cause delays in the movements of UAVs and USVs. We introduce a robust coordinated path planning approach for the UAV-USV system, optimizing operational efficiency while accounting for UAV/USV travel time unreliability. Specifically, we propose a novel robust compact formulation for the coordinated path planning problem using the budgeted uncertainty sets. To solve this complex problem, we decompose it into a master problem, i.e., a set partitioning problem, and a subproblem that deals with the robust resource-constrained elementary shortest paths. Furthermore, we propose a customized branch-and-price-and-cut solution algorithm to efficiently solve the robust path planning problem. Numerical studies illustrate that our approach can produce solutions that are significantly more robust than those that ignore uncertainty.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103284"},"PeriodicalIF":6.3,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144722124","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":"Bayesian inference of time-varying origin–destination matrices from boarding and alighting counts for transit services","authors":"Xiaoxu Chen,&nbsp;Zhanhong Cheng,&nbsp;Lijun Sun","doi":"10.1016/j.trb.2025.103278","DOIUrl":"10.1016/j.trb.2025.103278","url":null,"abstract":"<div><div>Origin–destination (OD) demand matrices are crucial for transit agencies to design and operate transit systems. This paper presents a novel temporal Bayesian model designed to estimate transit OD matrices at the individual bus-journey level from boarding and alighting counts at bus stops. Our approach begins by modeling the number of alighting passengers at subsequent bus stops, given a boarding stop, through a multinomial distribution parameterized by alighting probabilities. Given the large scale of the problem, we generate alighting probabilities with a latent variable matrix and factorize it into a mapping matrix and a temporal matrix, thereby substantially reducing the number of parameters. To further encode a temporally-smooth structure in the parameters, we impose a Gaussian process prior on the columns of the temporal factor matrix. For model inference, we develop a two-stage algorithm with the Markov chain Monte Carlo (MCMC) method. In the first stage, latent OD matrices are sampled conditional on model parameters using a Metropolis–Hastings sampling algorithm with a Markov model-based proposal distribution. In the second stage, we sample model parameters conditional on latent OD matrices using slice and elliptical slice sampling algorithms. We assess the proposed model using real-world data collected from three bus routes with varying numbers of stops, and the results demonstrate that our model achieves accurate posterior mean estimation and outperforms the widely used iterative proportional fitting (IPF) method. Additionally, our model can provide uncertainty quantification for the OD demand matrices, thus benefiting many downstream planning/operational tasks that require robust decisions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103278"},"PeriodicalIF":5.8,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144714117","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":"Online convoy movement problem with k blocked edges","authors":"Byung Jun Ju,&nbsp;Byung Do Chung","doi":"10.1016/j.trb.2025.103283","DOIUrl":"10.1016/j.trb.2025.103283","url":null,"abstract":"<div><div>In this paper, we propose a novel online variant of the convoy movement problem, termed the online convoy movement problem with <em>k</em> blocked edges. This problem includes up to <em>k</em> unrecoverable blocked edges, which are unknown in advance and are gradually revealed as convoys encounter them. The goal is to obtain conflict-free paths for convoys under the online scenario to minimize the total flow time for all convoys. The competitive ratio is used to evaluate the performance of online algorithms, which involves comparing their worst-case performance with the optimal offline solutions. We prove a lower bound of <span><math><mrow><mfrac><mrow><mn>2</mn><mi>k</mi></mrow><mrow><mo>|</mo><mi>C</mi><mo>|</mo></mrow></mfrac><mo>+</mo><mn>1</mn></mrow></math></span> for the competitive ratio of all deterministic online algorithms for the proposed problem, where <span><math><mrow><mo>|</mo><mi>C</mi><mo>|</mo></mrow></math></span> denotes the cardinality of the set of convoys <span><math><mi>C</mi></math></span>. Additionally, we develop five online algorithms: backtrack, simple backtrack, iterative local search, modified iterative local search, and iterative disjoint path. We prove that the competitive ratios of the backtrack and simple backtrack algorithms are <span><math><mrow><mn>2</mn><mi>k</mi><mo>+</mo><mn>1</mn></mrow></math></span> and <span><math><mrow><mo>|</mo><mi>C</mi><mo>|</mo><mo>·</mo><mo>(</mo><mrow><mn>4</mn><mi>k</mi><mo>+</mo><mn>2</mn></mrow><mo>)</mo></mrow></math></span>, respectively. However, the internal logic of these two algorithms may render them impractical in real-world situations. Therefore, we utilize the three other algorithms to find practically feasible conflict-free paths. Computational experiments are conducted to evaluate these five online algorithms on real-world instances.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103283"},"PeriodicalIF":5.8,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144687244","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":"Promoting carpooling on car-hailing platforms: Order allocation and motivating subsidy","authors":"Rui Yan ,&nbsp;Yuwen Chen ,&nbsp;Baolong Liu ,&nbsp;Xuege Wang","doi":"10.1016/j.trb.2025.103282","DOIUrl":"10.1016/j.trb.2025.103282","url":null,"abstract":"<div><div>This paper investigates an order allocation problem for an online car-hailing platform, including solo-ride and carpooling orders. Compared to solo rides, carpooling provides convenience, reduces emissions, and lowers traveling costs for passengers. However, drivers are unwilling to fulfill carpooling requests due to e.g., extra waiting and detour time to pick up carpooling passengers, and potential disputes and complaints from passengers. Therefore, carpooling brings operational challenges to car-hailing platforms in motivating drivers to serve the carpooling orders and allocating orders to the <em>assign</em> (drivers receive orders reactively) and <em>inform</em> (drivers claim orders proactively) order-dispatching systems. In promoting carpooling services, platforms are willing to provide subsidies to seize the market. In this regard, our study explores the scenario where a car-hailing platform maximizes service-quality-related platform performance by providing subsidies to drivers and optimizing the carpooling order allocation and the matching radius strategies. By taking Didi Chuxing as an example, we build G/M/1-family queueing models to maximize the platform performance measure. Our analysis derives the structure of optimal carpooling order allocation and the threshold subsidy to balance the drivers’ payoff in the two systems at equilibrium. We conduct numerical experiments and sensitivity analysis to simulate close-to-reality cases and find 90% of the carpooling orders should be sent to the assign system with a matching radius of <span><math><mrow><mn>3</mn><mo>∼</mo><mn>5</mn><mspace></mspace><mi>km</mi></mrow></math></span>. For robustness check, we also discuss the cases where the platform’s profit is the objective and the detour time endogenously depends on the matching radius and the order arrival rate. To ensure Pareto improvement for the platform, the drivers, and the passengers, we also apply the <span><math><mi>ɛ</mi></math></span>-constraint method to find the Pareto-improvement sets and the corresponding strategies.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103282"},"PeriodicalIF":5.8,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144680697","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":"Dynamic electric vehicle fleets management problem for multi-service platforms with integrated ride-hailing, on-time delivery, and vehicle-to-grid services","authors":"Qingying He ,&nbsp;Wei Liu ,&nbsp;Haoning Xi","doi":"10.1016/j.trb.2025.103281","DOIUrl":"10.1016/j.trb.2025.103281","url":null,"abstract":"<div><div>The rapid adoption of electric vehicles (EVs) and the surge in mobility service demand necessitate efficient management of EV fleets. In practice, these vehicles often remain idle for extended periods due to fluctuating demand, leading to underutilized resources and lost revenue. In response, this paper investigates a dynamic multi-service platform that concurrently coordinates ride-hailing, on-time delivery, and vehicle-to-grid (V2G) energy services. By leveraging synergies across these services, the proposed coordination strategy improves resource utilization, reduces operational costs, and increases profitability. Upon accessing the platform, users submit various service requests that specify the origin, destination, time windows, and either the number of riders or the weight of goods. To meet these heterogeneous, real-time demands, we propose a dynamic multi-service electric vehicle fleet management (MEFM) problem to optimize the allocation, routing, and scheduling of EV fleets to maximize platform profits over each time period. We formulate the proposed MEFM problem as an arc-based mixed-integer linear programming (MILP) model and develop a customized branch-and-price-and-cut (B&amp;P&amp;C) algorithm for its efficient solution. Our algorithm integrates Dantzig–Wolfe decomposition, improved with subset row cuts, and a novel labeling sub-algorithm that effectively captures multi-service coordination, fleet capacity, and battery-level constraints under partial recharging flexibility. Extensive numerical experiments based on a case study in the context of Shenzhen, China, demonstrate that the customized B&amp;P&amp;C algorithm achieves computation speeds on average 150.99 times faster than the state-of-the-art commercial solver (Gurobi), with speed-ups ranging from 3.33 to 477.42 times, while consistently obtaining optimal solutions for large-scale instances where Gurobi fails. Moreover, our results highlight the benefits of integrating on-time delivery and V2G energy services, e.g., despite a modest increase in operational costs, the substantial rise in profits validates the economic potential of the multi-service platforms. We also identify that partial recharging flexibility for EVs further reduces delay costs by up to 70.27% and boosts overall profits by up to 40.90%.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103281"},"PeriodicalIF":5.8,"publicationDate":"2025-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144664923","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":"Aircraft recovery with precancellation","authors":"Yi Su ,&nbsp;Kexin Xie ,&nbsp;Lei Huang ,&nbsp;Xiaoning Zhang ,&nbsp;Chutian Chen ,&nbsp;Zhe Liang","doi":"10.1016/j.trb.2025.103279","DOIUrl":"10.1016/j.trb.2025.103279","url":null,"abstract":"<div><div>Airlines often adopt a wait-and-see strategy for disruptions, resulting in canceling flights at the last moment. This not only incurs extra compensation costs but also significantly affects passengers’ travel experiences. To mitigate these losses, we introduce the concept of flight precancellation, which is defined as canceling flights one to several days before departure. To make precancellation decisions with respect to stochastic future weather conditions, we develop a two-stage stochastic model aimed at minimizing the overall recovery cost. To solve this model, we design a Lagrangian dual decomposition (LDD) approach, which efficiently decomposes the model into scenario-independent submodels. These submodels are then solved by a column generation framework. Additionally, we propose a dual-based variable evaluation strategy (DVS) to accelerate the solving process of LDD. We evaluate the effectiveness and efficiency of our model and algorithms using real operational data from three airlines, which are tested via real typhoon data. The computational results show that LDD can obtain optimal linear programming (LP) solutions and near-optimal integer programming (IP) solutions. Compared with the baseline column generation algorithm, the solution times for LDD and LDD-DVS are reduced by 41% and 46%, respectively. Additionally, tests conducted on real typhoon data demonstrate that, by incorporating precancellation decisions, it achieves an average cost savings of 17% compared with solutions that consider only real-time cancellation decisions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103279"},"PeriodicalIF":5.8,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144611642","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":"Locational rent vs. monopoly rent on the side-businesses of transport infrastructure","authors":"Yukihiro Kidokoro ,&nbsp;Anming Zhang","doi":"10.1016/j.trb.2025.103280","DOIUrl":"10.1016/j.trb.2025.103280","url":null,"abstract":"<div><div>This paper analyzes the relationship between locational and monopoly rents, developing a model consisting of an airport, shops at the airport, and shops at another (non-airport) location. When the unweighted sum of the utility of the representative consumer and the airport profit is maximized, no monopoly rent exists and thus, monopoly rent is independent of locational rent, but a higher locational rent results in a lower social welfare in equilibrium. On the other hand, when the airport profit is maximized, monopoly rent is an increasing function of locational rent. An increase in locational rent reduces welfare in equilibrium if the effect of the locational rent on the demand of the good sold at the airport is small. As a special case, we demonstrate that the monopoly rent can be separated from locational rent if the demand function of the good sold at an airport is multiplicatively separable regarding locational rent. Another extreme result occurs when the airport and non-airport goods are perfect substitutes: we derive one-to-one relationship between monopoly and locational rents, i.e., an increase in locational rent by one unit immediately implies an increase in monopoly rent by the same amount. Imperfect competition for shops at an airport and another location partly modifies the results, which suggests that market structure in the goods market affects the relationship between monopoly and locational rents. Our analysis demonstrates that in general, locational rent affects monopoly rent and social welfare and the dichotomy between locational and monopoly rents does not hold.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103280"},"PeriodicalIF":5.8,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144604381","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 random utility maximisation model considering the information search process","authors":"Gabriel Nova ,&nbsp;C. Angelo Guevara ,&nbsp;Stephane Hess ,&nbsp;Thomas O. Hancock","doi":"10.1016/j.trb.2025.103264","DOIUrl":"10.1016/j.trb.2025.103264","url":null,"abstract":"<div><div>Discrete choice analysis aims to understand and predict decision-makers’ behaviour, a goal that is crucial across several disciplines, including transportation. This type of analysis has relied predominantly on static representations of preferences, principally through the Random Utility Maximisation (RUM) model, due to its ease of implementation, economic interpretability, and statistical formality. However, this model assumes that individuals possess complete information about all attributes of alternatives and that they can process and recall this information instantaneously, which may not align with actual human behaviour. In contrast, the Decision Field Theory (DFT) model from mathematical psychology explicitly incorporates the repeated scrutiny of attributes and recall effects within the decision-making process, which enables it to model attention weights, but lacks microeconomic interpretability and clear statistical parameter identification. This paper introduces the RUM-DFT model, which seeks to integrate strengths of both approaches. Through Monte Carlo simulations, the proposed model is shown to be able to: (i) recover parameters related to the deliberation process, (ii) replicate the dynamic behaviour of utilities during deliberation as observed in practice, (iii) maintain economic interpretability by estimating coefficients that can be used to calculate the marginal indirect utilities, and (iv) highlight the pitfalls of using a RUM model that disregards the true dynamics of data generation process. The SwissMetro case study is employed also to evaluate the RUM-DFT model using a real-world dataset, demonstrating the viability and superior goodness-of-fit of the proposed model.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103264"},"PeriodicalIF":5.8,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144580273","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":"Contract design for BOT roads in the presence of autonomous vehicles","authors":"Zhuo Feng ,&nbsp;Ying Gao ,&nbsp;Jinbo Song ,&nbsp;Yating Jie ,&nbsp;Bo Lu","doi":"10.1016/j.trb.2025.103277","DOIUrl":"10.1016/j.trb.2025.103277","url":null,"abstract":"<div><div>This paper examines contract design for Build-Operate-Transfer (BOT) road projects in the presence of autonomous vehicles (AVs). We incorporate the impact of AVs on expanding road capacity through their platooning effect, whereby AVs travel in coordinated fleets with reduced headways. We derive the first-best BOT contracts under two distinct traffic management policies: the integrated policy, in which AVs and human-driven vehicles (HVs) share lanes, and the designated-lane policy, in which AVs and HVs use separate lanes. We also characterize the firm’s optimal BOT contracts under each policy. Our results show that under the integrated policy, AVs may be charged a negative toll when their market share is sufficiently small and headways involving AVs are sufficiently reduced, while HVs are consistently charged a positive toll under both policies. We further demonstrate that first-best BOT contracts can be implemented under both policies with the support of government subsidies. In comparing the two policies under BOT contract, we find that the integrated policy outperforms the designated-lane policy in terms of firm profit and social welfare when the AV market share is either very low or very high. Finally, we show how lane capacity allocation under the designated-lane policy affects the policy preferences of both the government and the firm.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103277"},"PeriodicalIF":5.8,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144556742","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":"Modeling the curbside congestion effects of ride-hailing services for morning commute using bi-modal two-tandem bottlenecks","authors":"Yao Deng ,&nbsp;Zhi-Chun Li ,&nbsp;Sean Qian ,&nbsp;Wei Ma","doi":"10.1016/j.trb.2025.103276","DOIUrl":"10.1016/j.trb.2025.103276","url":null,"abstract":"<div><div>With the proliferation of ride-hailing services, curb space in urban areas has become highly congested due to the massive passenger pick-ups and drop-offs. Particularly during peak hours, the massive ride-hailing vehicles waiting to drop off obstruct curb spaces and even disrupt the flow of mainline traffic. However, there is a lack of an analytical model that formulates and mitigates the congestion effects of ride-hailing drop-offs in curb spaces. To address this issue, this paper proposes a novel bi-modal two-tandem bottleneck model to depict the commuting behaviors of private vehicles (PVs) and ride-hailing vehicles (RVs) during the morning peak in a linear city. In the model, the upstream bottleneck models the congestion on highways, and the downstream curbside bottlenecks depict the congestion caused by RV drop-offs in curb spaces, PV queue on main roads, and the spillover effects between them in the urban area. The proposed model can be solved in a closed form under eight different scenarios. A time-varying optimal congestion pricing scheme, combined curbside pricing and parking pricing, is proposed to achieve the social optimum. It is found that potential waste of road capacity could occur when there is a mismatch between the highway and curbside bottlenecks, and hence the optimal pricing should be determined in a coordinated manner. A real-world case from Hong Kong shows that the limited curb space and main road in the urban area could be the major congestion bottleneck. Expanding the capacity of the curb space or the main road in the urban area, rather than the highway bottleneck, can effectively reduce social costs. This paper highlights the critical role of curbside management and provides policy implications for the coordinated management of highways and curb spaces.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103276"},"PeriodicalIF":5.8,"publicationDate":"2025-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144517237","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}