Transportation Research Part B-Methodological最新文献

{"title":"A modified late arrival penalized user equilibrium model and robustness in data perturbation","authors":"Manlan Li ,&nbsp;Huifu Xu","doi":"10.1016/j.trb.2025.103251","DOIUrl":"10.1016/j.trb.2025.103251","url":null,"abstract":"<div><div>In a seminal paper (Watling, 2006), Watling proposes a stochastic variational inequality approach to model traffic flow equilibrium over a network where the transportation time is random and a path is selected by to transport if the user’s expected utility of the transportation of the path is maximized over their paths. A key feature of Watling’s model is that the user’s utility function incorporates a penalty term for lateness and the resulting equilibrium is known as Late Arrival Penalized User Equilibrium (LAPUE). In this paper, we revisit the LAPUE model with a different focus: we begin by adopting a new penalty function which gives a smooth transition of the boundary between lateness and no lateness and demonstrate the LAPUE model based on the new penalty function has a unique equilibrium and is stable with respect to (w.r.t.) small perturbation of probability distribution under moderate conditions. We then move on to discuss statistical robustness of the modified LAPUE (MLAPUE) model by considering the case that the data to be used for fitting the density function may be perturbed in practice or there is a discrepancy between the probability distribution of the underlying uncertainty constructed with empirical data and the true probability distribution in future, we investigate how the data perturbation may affect the equilibrium. We undertake the analysis from two perspectives: (a) a few data are perturbed by outliers and (b) all data are potentially perturbed. In case (a), we use the well-known influence function to quantify the sensitivity of the equilibrium by the outliers and in case (b) we examine the difference between empirical distributions of the equilibrium based on perturbed data and the equilibrium based on unperturbed data. Moreover, we extend the discussions in case (b) to the LAPUE model and the other UE models. To examine the performance of the MLAPUE model and our theoretical analysis of statistical robustness, we carry out some numerical experiments, the preliminary results confirm the statistical robustness as desired.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103251"},"PeriodicalIF":5.8,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144472273","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 closed-form bounded route choice model accounting for heteroscedasticity, overlap, and choice set formation","authors":"Laurent Cazor ,&nbsp;Lawrence Christopher Duncan ,&nbsp;David Paul Watling ,&nbsp;Otto Anker Nielsen ,&nbsp;Thomas Kjær Rasmussen","doi":"10.1016/j.trb.2025.103275","DOIUrl":"10.1016/j.trb.2025.103275","url":null,"abstract":"<div><div>The Multinomial Logit (MNL) model is widely used in route choice modelling due to its simple closed-form choice probability function. However, MNL assumes that the error terms are independently and identically distributed with infinite support. As a result, it imposes homoscedasticity, meaning that long and short trips share the same error variance, disregards correlations between overlapping routes, and assigns non-zero choice probabilities to all available routes, regardless of their cost. This paper addresses these limitations by developing a closed-form route choice model. We introduce the Bounded q-Product Logit (BqPL) model, which incorporates heteroscedastic error terms with bounded support. The parameter <span><math><mi>q</mi></math></span> controls the rate at which error term variance increases with trip cost, and routes that violate cost bounds receive zero choice probabilities, implicitly defining the route choice set. Furthermore, we extend the BqPL model to account for correlations between overlapping routes by integrating path size correction terms within the choice probability function, resulting in the Bounded Path Size q-Product Logit (BPSqPL) model. We illustrate the properties of the BPSqPL model on small-scale networks, contrasting it with a range of existing choice models into which it can collapse. We then present a method to estimate the model parameters and standard errors, using bootstrapping. Finally, we estimate the model using a large-scale bicycle route choice case study, comparing its goodness-of-fit, interpretability, and forecasting ability with relevant collapsing models. We also test the impact of the choice set size on the estimated parameters. The results underscore the importance of addressing the three key limitations of the MNL model and demonstrate the effectiveness of the BPSqPL model in doing so.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103275"},"PeriodicalIF":5.8,"publicationDate":"2025-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144365190","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":"Order dispatching strategy and pricing scheme in ride-sourcing markets with consideration of service cancellation","authors":"Jing-Peng Wang ,&nbsp;Hai Wang ,&nbsp;Peng Liu ,&nbsp;Hai-Jun Huang","doi":"10.1016/j.trb.2025.103266","DOIUrl":"10.1016/j.trb.2025.103266","url":null,"abstract":"<div><div>In a ride-sourcing system, dispatching order requests to available drivers entails a comprehensive consideration of factors such as pickup proximity, order rewards, driver rating, safety behavior, passenger preferences, real-time road conditions, and other relevant variables. Inefficient dispatch processes often result in service cancellation by either the customer or the driver. This paper represents a pioneering effort to examine order dispatching strategy and pricing scheme while taking service cancellation behaviors into account. By assuming the platform has limited knowledge of the valuation of service of each customer and the reservation earning rate of each driver, we develop a two-period model that captures the dynamic decision-making processes of multiple stakeholders (customers, drivers, and platform) and formulate the platform’s order-dispatching problem as a stochastic programming model. Within a greedy approximation framework, our analysis reveals the significant implications of pricing scheme for critical performance metrics while considering service cancellation. These include the matching probability (probability of customer-driver acceptance for platform’s match results), the platform’s rewards, and the effects on the platform’s order-dispatching decisions. Specifically, within the realm of linear pricing, the matching probability demonstrates a positive correlation with trip distance, and thereby establishes a consistent dispatching order compared with one that does not consider service cancellation. Conversely, with nonlinear pricing (whether sublinear or superlinear), extended trip distance is generally associated with a reduced matching probability when it exceeds a threshold; this results in prioritizing orders with intermediate trip distances in order-dispatching decisions. Moreover, numerical experiments support that an integration of sublinear, superlinear, and linear pricing is conducive to optimizing rewards across short-, intermediate, and long-distance trips. Finally, scenarios of unimodal distributions of customer’s valuation of service and driver’s reservation earning rate consistently yield the highest rewards, through sublinear, linear, and superlinear pricing schemes.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103266"},"PeriodicalIF":5.8,"publicationDate":"2025-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144365327","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":"Moving average vs. exponential smoothing cost-updating filters for day-to-day dynamic assignment: fixed-point stability and bifurcation theoretical analysis","authors":"G.E. CANTARELLA ,&nbsp;C. FIORI ,&nbsp;P. VELONÀ","doi":"10.1016/j.trb.2025.103253","DOIUrl":"10.1016/j.trb.2025.103253","url":null,"abstract":"<div><div>Deterministic process (DP) models for day-to-day dynamic assignment can be cast in the general two-equation assignment modelling approach, including the following:</div><div>- the arc cost updating recursive equation in the case of day-to-day dynamic assignment; instances are exponential smoothing (ES) or moving average (MA) filters;</div><div>- the arc flow updating recursive equation in the case of day-to-day dynamic assignment; instances are ES filters.</div><div>Even though ES filters for cost updating may well approximate MA filters, somebody in the scientific community argue against the underlying hypothesis of infinite memory for ES filters with respect to MA ones; numerical results support significant differences for small memory depths, say 2 or 3 days.</div><div>The main original contribution of this study is a formal fixed-point stability and bifurcation analysis of MA-ES DP models with memory depth 2, and a comparison with ES-ES DP. At this aim the Omega method 2.0, suitable for carrying out general fixed-point stability and bifurcation analysis has been developed and discussed. Extremely long proofs have not been included for brevity. This study focused on methodological aspects; thus, numerical examples were not included.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103253"},"PeriodicalIF":5.8,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144322838","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":"Market size and fare-free public transit in theory","authors":"Lewis J. Lehe,&nbsp;Ayush Pandey","doi":"10.1016/j.trb.2025.103265","DOIUrl":"10.1016/j.trb.2025.103265","url":null,"abstract":"<div><div>Studies of fare-free public transit claim it is most convenient in small communities, because their transit systems tend to have lower farebox recovery ratios and more available capacity. This paper offers a rationale for these tendencies by working through a static model of a bus route with boarding/alighting delays, crowding and elastic demand that scales with a “market size” parameter. Due to externalities passengers impose, ridership arises as an equilibrium outcome given a certain market size and the agency’s choice of fare and fleet size. When the fare and fleet size are chosen to satisfy the First- and Second-Order Conditions for maximizing social surplus, the farebox recovery ratio, number of passengers on each bus and the rate passengers board each bus are all smaller in smaller markets. An extension explores capacity choice.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103265"},"PeriodicalIF":5.8,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144298358","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 systematic review of node models for macroscopic network loading of traffic flows","authors":"Xiaolin Gong,&nbsp;Mark P.H. Raadsen,&nbsp;Michiel C.J. Bliemer","doi":"10.1016/j.trb.2025.103273","DOIUrl":"10.1016/j.trb.2025.103273","url":null,"abstract":"<div><div>Node models in macroscopic network loading procedures are used to distribute competing flows arising at motorway ramps, junctions, and intersections, influencing congestion and queuing delays. Despite decades of research on macroscopic node model development, a comprehensive literature review on their characteristics, categories, emerging trends, and further research opportunities does not yet exist. This study fills this gap by conducting a systematic literature review on the node models in macroscopic network loading frameworks. We identify representative characteristics of node models and then systematically classify and interpret those characteristics across existing node model studies present in the literature. We propose six general principles for node models and explore five extension categories characterising additional features. This paper makes two contributions to the field. Firstly, it provides a comprehensive classification of node model research, grounded in the proposed principles and extension categories. This classification is substantiated by relevant references and culminates in the development of a node model classification table. Secondly, it identifies future research directions and opportunities, providing guidance and insights for researchers and practitioners engaged in the study of macroscopic node models.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103273"},"PeriodicalIF":5.8,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144270114","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":"End-to-end logistics in metropolitan areas: A stochastic dynamic order-assignment and dispatching problem","authors":"M. Arya Zamal ,&nbsp;Albert H. Schrotenboer ,&nbsp;Tom Van Woensel","doi":"10.1016/j.trb.2025.103249","DOIUrl":"10.1016/j.trb.2025.103249","url":null,"abstract":"<div><div>The growth of e-commerce requires efficient integration of first-mile pickup, middle-mile consolidation, and last-mile delivery. These so-called integrated end-to-end logistics operations are particularly visible in metropolitan areas where fast delivery services are in high demand. Inspired by real-world practices at our industry partner, this paper introduces the Stochastic Dynamic Order-Assignment and Dispatching Problem (SDOA-DP). It concerns stochastic and dynamic pickup-and-delivery orders arising at an end-to-end logistics delivery platform, for which the company, as a decision maker, needs to determine in real-time how to assign orders to middle-mile linehaul schedules and when to dispatch first- and last-mile two-echelon vehicle routes. We model the SDOA-DP as a Markov Decision Process and propose a novel solution approach based on a parameterized Cost Function Approximation (CFA) for order assignment in the middle mile and a parameterized Adaptive Large Neighborhood Search (ALNS) for vehicle dispatch and two-echelon routing in the first and last-mile. The CFA balances the cost of using linehauls with the time slack available for first- and last-mile planning while ensuring time windows are met. The parameterization in the ALNS ensures that we balance routing cost and delivery speed by limiting the frequency and timing of dispatching vehicle routes. We learn the best value of the parameterization using Bayesian optimization. Computational experiments show that our approach yields a 22% on-average improvement compared to a baseline policy. If we learn a single best parameterization for various system settings, we observe almost as good cost savings, showing that our approach is robust and reliable for practitioners. Finally, we applied our method to a case study of our industry partner and showed that our method could potentially reduce daily costs by 30.5% across various operational contexts.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103249"},"PeriodicalIF":5.8,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144230486","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":"Rolling stock shunt operation planning in urban rail transit depots with maintenance consideration","authors":"Dian Wang ,&nbsp;Ling Yao ,&nbsp;Andrea D’Ariano ,&nbsp;Shuguang Zhan ,&nbsp;Lisha Wang","doi":"10.1016/j.trb.2025.103252","DOIUrl":"10.1016/j.trb.2025.103252","url":null,"abstract":"<div><div>This study investigates the daily rolling stock shunt operation planning in a rail depot. Given the layout of a depot and the rolling stocks (that arrive at and depart from this depot within an operation day) with given maintenance schedule, the studied problem lies in determining: 1) the position where each rolling stock is parked, outside washed, and/or maintained, and 2) the conflict-free shunting plan of rolling stocks to move within a depot. We transform the track-circuits in the depot into different multi-layer directed graphs to illustrate the shunting processes of rolling stocks. By means of these graphs, we formulate the studied problem as a mixed integer linear programming model by considering a more general variant of four requirements that make sense in practice but are not or rarely considered in previous works and by presenting a flexible technique to model the track capacity, to reduce the additional shunting movements of rolling stocks. Besides, we design a two-stage decomposition manner to efficiently solve real-life problem instances, wherein the problem in each stage is addressed by a presented logic-based Benders decomposition algorithm enhanced by customized acceleration mechanisms. Finally, a set of realistic and real-life instances with different scales (derived from the largest depot of the Chongqing Rail Transit Line 3 in China) are investigated. Computational results demonstrate that our best algorithm solves a real-life instance to optimality in approximately 8 s that is considerably shorter than the time of rail staffs to solve this instance manually, thus our approach can provide strong automatical computer-aided decision supports. Our approach is also very efficient in optimizing another objective that is also widely used, and can provide management insights to rail staffs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"199 ","pages":"Article 103252"},"PeriodicalIF":5.8,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144222181","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":"Data-driven optimization for container ship bunkering management under fuel price uncertainty","authors":"Xuecheng Tian ,&nbsp;Shuaian Wang ,&nbsp;Yan Liu ,&nbsp;Ying Yang","doi":"10.1016/j.trb.2025.103250","DOIUrl":"10.1016/j.trb.2025.103250","url":null,"abstract":"<div><div>Fuel prices are a crucial and volatile component of operational costs in maritime transportation. This paper optimizes container ship bunkering decisions under the uncertainty of multi-port fuel prices, using data-driven optimization frameworks that integrate machine learning and mathematical programming models. We address two primary challenges: (i) incorporating spatiotemporal correlations between multi-port fuel prices into predictive models, and (ii) determining the most effective data-driven modeling framework for this problem. To address the first challenge, we develop a two-channel long short-term memory model specifically designed to capture the spatiotemporal dependencies of multi-port fuel prices. For the second challenge, we construct two data-driven modeling frameworks for ship bunkering management: a two-stage contextual deterministic programming model with point predictions (TDP framework) and a multistage contextual stochastic programming model with distributional estimates (MSD framework). Through comprehensive computational experiments using both real-world and synthetic data, we obtain two crucial insights: (i) accounting for the spatiotemporal correlations among multi-port fuel prices significantly improves the accuracy of fuel price predictions; and (ii) the TDP framework is more suited to container shipping routes with fewer ports, while the MSD framework offers advantages in contexts with a higher number of ports.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"198 ","pages":"Article 103250"},"PeriodicalIF":5.8,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144242214","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 ridesharing routing problem with flexible pickup and drop-off points","authors":"Zuhayer Mahtab ,&nbsp;Shichun Hu ,&nbsp;Maged Dessouky ,&nbsp;Fernando Ordoñez","doi":"10.1016/j.trb.2025.103234","DOIUrl":"10.1016/j.trb.2025.103234","url":null,"abstract":"<div><div>In major metropolitan areas, ride-sharing systems can help reduce traffic congestion and increase the transportation system’s efficiency. In this paper, we propose a Branch-and-Price based approach for solving the ride-share routing problem with flexible pickup and drop-off points. We assume a ride-sharing system where drivers have their own origins and destinations, where all the drivers’ and passengers’ information is known beforehand, and all the problem data information is static and deterministic. We assume that drivers can pick up or drop off passengers from or to flexible meeting points that are within a passenger’s walking time limit from their origin or destination and are determined on a continuous plane. We formulate a mixed integer nonlinear model for routing and selecting pickup and drop-off points. Our solution approach decomposes this problem in two: selecting pickup and drop-off points and a rideshare routing problem. We develop an efficient algorithm to select the best pickup and drop-off points and show computationally that it is more efficient at finding pickup and drop-off points than considering a fixed set of discrete meeting points. To evaluate the performance of our approach, we perform numerical experiments on a San Francisco Taxicab dataset. Results show that our approach is efficient, solving instances with up to 600 points within 31 CPU minutes. For these datasets, incorporating flexible pickup and drop-off points can reduce the total vehicle travel time of the rideshare system by 4% on average.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"198 ","pages":"Article 103234"},"PeriodicalIF":5.8,"publicationDate":"2025-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144131233","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}