Transportation Research Part B-Methodological最新文献

{"title":"A bi-level optimization model for project scheduling and traffic flow routing in railway networks","authors":"Tomas Lidén ,&nbsp;Filip Kristofersson ,&nbsp;Martin Aronsson","doi":"10.1016/j.trb.2025.103213","DOIUrl":"10.1016/j.trb.2025.103213","url":null,"abstract":"<div><div>Long-term tactical infrastructure planning for a transportation network consists of deciding on renewals and major maintenance works. Such projects constitute large budget volumes and will impair the available traffic capacity during their execution, especially for railway systems. Quantitative methods that schedule and coordinate infrastructure projects together with traffic flow adaptations is however largely lacking today.</div><div>This paper addresses the joint planning of temporary capacity restrictions and traffic flow adaptions during track work closures, by proposing a bi-level optimization model which separates the problem into project scheduling (upper level) and traffic assignment (lower level). The latter model uses a novel traffic flow formulation for routing volumes of trains through the transportation network under the capacity restrictions given by the project scheduling. An aggregated network is used together with time discretized into uniform periods, which makes it possible to treat large national planning problems with a planning horizon of up to a year and a period length of a couple hours. The computational properties are evaluated, both for the individual models, and for their joint usage. Furthermore, results from applying the models on two case studies, concerning Northern and South-Western Sweden, are presented.</div><div>The main conclusion is that the model formulations are capable of solving realistic planning cases and to provide support for capacity planners at an infrastructure manager, even for a large national railway. The results show that a good overview over the collective traffic impact is obtained, but also that details of particular traffic relations or capacity usage over individual network links and their variation over time can be studied. One major deficiency has been identified in the flow-based traffic assignment model, which can lead to incoherent train flows over long traveling distances and many time periods.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"196 ","pages":"Article 103213"},"PeriodicalIF":5.8,"publicationDate":"2025-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143852222","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":"Nonparametric mixed logit model with market-level parameters estimated from market share data","authors":"Xiyuan Ren ,&nbsp;Joseph Y.J. Chow ,&nbsp;Prateek Bansal","doi":"10.1016/j.trb.2025.103220","DOIUrl":"10.1016/j.trb.2025.103220","url":null,"abstract":"<div><div>We propose a nonparametric mixed logit model that is estimated using market-level choice share data. The model treats each market as an agent and represents taste heterogeneity through market-specific parameters by solving a multiagent inverse utility maximization problem, addressing the limitations of existing market-level choice models with parametric estimation. A simulation study is conducted to evaluate the performance of our model in terms of estimation time, estimation accuracy, and out-of-sample predictive accuracy. In a real data application, we estimate the travel mode choice of 53.55 million trips made by 19.53 million residents in New York State. These trips are aggregated based on population segments and census block group-level origin-destination (OD) pairs, resulting in 120,740 markets. We benchmark our model against multinomial logit (MNL), nested logit (NL), inverse product differentiation logit (IPDL), and the BLP models. The results show that the proposed model improves the out-of-sample accuracy from 65.30 % to 81.78 %, with a computation time less than one-tenth of that taken to estimate the BLP model. The price elasticities and diversion ratios retrieved from our model and benchmark models exhibit similar substitution patterns. Moreover, the market-level parameters estimated by our model provide additional insights and facilitate their seamless integration into supply-side optimization models for transportation design. By measuring the compensating variation for the driving mode, we found that a $9 congestion toll would impact roughly 60 % of the total travelers. As an application of supply-demand integration, we showed that a 50 % discount of transit fare could bring a maximum ridership increase of 9402 trips per day under a budget of $50,000 per day.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"196 ","pages":"Article 103220"},"PeriodicalIF":5.8,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143844247","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 train carriage planning for mixed transportation of passengers and uncertain freights in a high-speed railway network","authors":"Chuntian Zhang ,&nbsp;Zhou Xu ,&nbsp;Lixing Yang ,&nbsp;Ziyou Gao ,&nbsp;Yuan Gao","doi":"10.1016/j.trb.2025.103216","DOIUrl":"10.1016/j.trb.2025.103216","url":null,"abstract":"<div><div>Mixed transportation of passengers and freights is an effective strategy for reducing environmental pollution and improving the service level of railway systems. This study addresses the problem of robust train composition and carriage arrangement for the mixed transportation of passengers and freights in a high-speed railway (HSR) network. Specifically, a network-based robust optimization (RO) model is introduced to address the uncertainty in freight demand while considering deterministic passenger demand. The model utilizes space–time network representations to characterize the movements of passengers and freights. To account for various potential scenarios, a polyhedral uncertainty set is integrated into the model. Moreover, we develop a novel exact algorithm called B-C&amp;CG, which utilizes the strengths of Benders decomposition for solving the deterministic passenger sub-problem and the strengths of column-and-constraint generation (C&amp;CG) for solving the robust freight sub-problem. This provides an efficient solution to the RO model formulated for our problem. The objective is to optimize the train operating cost, passenger generalized travel cost, and the worst-case freight travel cost simultaneously. Additionally, a series of numerical experiments based on the real-world instance in a HSR network are conducted to verify the effectiveness of the developed B-C&amp;CG algorithm and the advantages of the proposed RO model. The results demonstrate that (i) the newly developed algorithm outperforms both the Benders decomposition algorithm and the hybrid algorithm (B-BC&amp;CG) in terms of computing time, where the latter differs from B-C&amp;CG by using both Benders decomposition and C&amp;CG to handle the robust freight sub-problem; (ii) the degree of conservatism can be controlled by altering parameters related to uncertain freight demand; (iii) the proposed RO model can improve the worst-case solutions under polyhedral uncertainty set, compared to nominal and stochastic programming models.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"196 ","pages":"Article 103216"},"PeriodicalIF":5.8,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143844209","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":"Managing uncertain traffic and societal externalities in a road and rail network: Pricing versus Permits","authors":"Kexin Geng ,&nbsp;Zhiyuan Liang ,&nbsp;Erik T. Verhoef ,&nbsp;Yacan Wang","doi":"10.1016/j.trb.2025.103214","DOIUrl":"10.1016/j.trb.2025.103214","url":null,"abstract":"<div><div>This paper studies the relative performance of congestion pricing versus tradable permits for a congested bi-modal transport system with traffic externalities, that affect passengers only, and societal externalities that go beyond the passengers. The point in this case is infection risks, as in the pandemic. We study this relative performance for the case where there are uncertainties on both traffic externalities and societal externalities. Earlier literature considered the relative performance of prices and permits for the case with only stochastic traffic externalities. The numerical results indicate that, given how infection risks are likely to affect social cost functions, pricing regulation can be expected to perform better than a tradable permit scheme when there are uncertainties on private infection cost, especially when the uncertainties on the marginal private infection cost increase. However, the government can enhance the performance of tradable permits by allowing the bankability of permits, or by actively engaging in buying or selling permits to optimize the price in response to the realization of stochastic parameters. The results provide theoretical support for policymakers to choose the optimal instruments to internalize the multiple external costs when uncertainties exist.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"196 ","pages":"Article 103214"},"PeriodicalIF":5.8,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143838914","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":"Joint bus dispatching and bus bridging timetabling for mass rapid transit disruption management","authors":"Li Zhang ,&nbsp;Qiang Meng ,&nbsp;Hua Wang ,&nbsp;Bin Yu","doi":"10.1016/j.trb.2025.103215","DOIUrl":"10.1016/j.trb.2025.103215","url":null,"abstract":"<div><div>The mass rapid transit (MRT) systems play a pivotal role in urban mobility services but are frequently susceptible to various disruptions. Bus bridging service is a widely-applied substitute transit service in response to MRT disruptions, which requires a significant number of buses to transport stranded MRT passengers. In practical applications, these buses may be dispatched from the nearby bus lines or bus depots, which inevitably affect bus passengers. However, the literature has paid very little attention to the sources of buses and impractically assumed buses are immediately available. To bridge this gap, this paper proposes a joint optimization problem integrating bus dispatching and bus bridging timetabling, considering the balance between the impact of bus dispatching on bus passengers and evacuation of MRT passengers. A mixed integer linear programming model is developed to minimize total penalties caused by affected onboard passengers and cumulative waiting passengers in both bus and bus bridging systems. A tailored decomposition method is devised to find high-quality solutions efficiently. By applying the decomposition method, the model is split into three sub-problems, which are solved by three tailored and efficient methods developed based on their unique features. The efficiency of the proposed method is demonstrated using Singapore case studies. The computational results show that our method can guide bus dispatching efficiently to evacuate stranded passengers while minimizing the impact on bus passengers. Finally, the impacts of duration, bus frequency, passenger demand, and penalty coefficients are analyzed.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"196 ","pages":"Article 103215"},"PeriodicalIF":5.8,"publicationDate":"2025-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823312","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 novel hierarchical perimeter control method for road networks considering boundary congestion in a mixed CAV and HV traffic environment","authors":"Heng Ding ,&nbsp;Liangwen Wang ,&nbsp;Nan Zheng ,&nbsp;Zeyang Cheng ,&nbsp;Xiaoyan Zheng ,&nbsp;Jiye Li","doi":"10.1016/j.trb.2025.103219","DOIUrl":"10.1016/j.trb.2025.103219","url":null,"abstract":"<div><div>Under dynamic traffic demand conditions, two issues must be addressed when perimeter control is implemented for congested areas of a road network. The first is to avoid intersection spillback at the boundaries and expansion of the congestion, and the second is to improve the output traffic efficiency of the congested areas to quickly relieve traffic congestion. To address these two issues and solve the traffic congestion problem, in this paper, we adopt a dynamic buffer area to store boundary queuing vehicles and use connected and autonomous vehicle (CAV) technology to improve the traffic flow transmission efficiency of a congested area. First, considering the macro- and micro-level relationships between the macroscopic fundamental diagram (MFD) regions and buffer areas (link- and node-based), a traffic flow transmission model of the network embedded in dynamic buffer areas is built. Second, based on road network state sensing, a dynamic adjustment method of buffer volume is presented to optimize MFD region boundary flows. Third, a hierarchical control method based on model prediction (HCMMP) is proposed for the scenario of a single kernel network. The HCMMP's upper level adopts model predictive control (MPC) to adjust the traffic flow into the dynamic buffer area, and the lower level uses real-time CAV information to optimize the signal timing in the dynamic buffer area. Finally, a complex cellular multiregional road network is selected as a scenario case, and the proposed HCMMP is analysed and compared with no control (NC), proportional integral (PI) control, MPC (both without a dynamic buffer area), PI control with a dynamic buffer area (PIBA) and hierarchical control method based on the PI (HCMPI). The results show that the proposed HCMMP can improve the traffic efficiency, outperforming the other control methods.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103219"},"PeriodicalIF":5.8,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143815960","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":"Extended macroscopic node model for multilane traffic","authors":"Xiaolin Gong,&nbsp;Michiel C.J. Bliemer,&nbsp;Mark P.H. Raadsen","doi":"10.1016/j.trb.2025.103208","DOIUrl":"10.1016/j.trb.2025.103208","url":null,"abstract":"<div><div>In a macroscopic assignment model, traffic flows are distributed onto the network by means of a network loading model. The network loading propagates flows along links via a link model and through junctions or intersections via a node model. Most of the travel time delays are caused by queues forming at junctions or intersections, especially in urban networks. Therefore, the efficiency and accuracy of the underlying node model is paramount in capturing these delays (and flows). Existing link-based macroscopic node models make the simplifying assumption that first-in-first-out (FIFO) holds at the link level, which is often unrealistic when a link has multiple approach lanes near an intersection or junction. In this work we propose to relax this assumption such that FIFO holds at the movement level. We do so by developing several model extensions. First, a novel lane-based formulation of the node model is proposed. Secondly, we formulate an equilibrium problem and a general solution algorithm to allocate sending flows to lanes. This allows us to explicitly consider approach lane configurations that contain important information about the layout of an intersection or junction. We show that the conventional link-based node model is a special case of our newly proposed model in case each approach lane on an incoming link allows all possible movements. Various numerical examples are provided, demonstrating the capabilities of the proposed extensions to the node model.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":""},"PeriodicalIF":5.8,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143799416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic traffic assignment for electric vehicles","authors":"Lukas Graf,&nbsp;Tobias Harks ,&nbsp;Prashant Palkar","doi":"10.1016/j.trb.2025.103207","DOIUrl":"10.1016/j.trb.2025.103207","url":null,"abstract":"<div><div>We initiate the study of dynamic traffic assignment for electrical vehicles addressing the specific challenges such as range limitations and the possibility of battery recharge at predefined charging locations. As our main result, we establish the existence of energy-feasible dynamic equilibria within networks using the deterministic queuing model of Vickrey for the flow dynamics on edges.</div><div>There are three key modeling-ingredients for obtaining this existence result:</div><div>1. We introduce a <em>walk-based</em> definition of dynamic traffic flows which allows for cyclic routing behavior as a result of recharging events en route.</div><div>2. We use abstract convex feasibility sets in an appropriate function space to model the energy-feasibility of used walks.</div><div>3. We introduce the concept of <em>capacitated dynamic equilibrium walk-flows</em> which generalize the former unrestricted dynamic equilibrium path-flows.</div><div>Viewed in this framework, we show the existence of an energy-feasible dynamic equilibrium by applying an infinite dimensional variational inequality, which in turn requires a careful analysis of continuity properties of the network loading as a result of injecting flow into walks.</div><div>We complement our theoretical results by a computational study in which we design a fixed-point algorithm computing energy-feasible dynamic equilibria. We apply the algorithm to standard real-world instances from the traffic assignment community. The study demonstrates that battery constraints have a significant impact on the resulting travel times and energy consumption profiles compared to conventional fuel-based vehicles. We further show that our algorithm computes (approximate) equilibria for small and medium sized instances in acceptable running times but struggles for larger instances.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":""},"PeriodicalIF":5.8,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143799415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Preference heterogeneity in a dynamic flow congestion model","authors":"Xiaojuan Yu ,&nbsp;Vincent A.C. van den Berg ,&nbsp;Erik T. Verhoef","doi":"10.1016/j.trb.2025.103193","DOIUrl":"10.1016/j.trb.2025.103193","url":null,"abstract":"<div><div>The bottleneck model has dominated the field on dynamic congestion, as it is tractable and has closed-form solutions. But it has rather specific outcomes that do not occur in most other dynamic models or under static congestion. In the bottleneck model, pricing can remove all travel delays while keeping the generalized price unchanged, making pricing much more beneficial than in other models. Thus, it is important to see how pricing performs in other models. We do so by adding discrete preference heterogeneity to a dynamic flow congestion model, and we study the efficiency and distributional effects of pricing. By formulating a multi-point optimal-control problem using Hamiltonians, we derive the social optimum and analyze the properties of travel equilibrium. Solving our model is more complex than solving the bottleneck model, but still results in closed-from solutions, whereas most other dynamic congestion models have no such solutions. Without tolling, the arrival order is determined by the ratio of the value of time (VOT) to the value of schedule delay, as in the bottleneck model. However, unlike the bottleneck model, the same holds for the social optimum when only the VOT differs across users (as tolling cannot eliminate all travel time delays). In our model, users with a lower VOT always lose from tolling, while those with a higher VOT may gain or lose, depending on the parameters. Compared to the bottleneck model, tolling is less beneficial for society, lengthens the peak, and hurts users more. Our findings reveal the significance of considering congestion type and preference heterogeneity in assessing the implementation of congestion tolling.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103193"},"PeriodicalIF":5.8,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143799234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"New formulations and solution approaches for train eco-driving problems","authors":"Zhuang Xiao,&nbsp;Hongbo Ye,&nbsp;Edward Chung","doi":"10.1016/j.trb.2025.103210","DOIUrl":"10.1016/j.trb.2025.103210","url":null,"abstract":"<div><div>This paper investigates solution methods for train eco-driving problems that include the classic single-train eco-driving problem, the single-train eco-driving problem with intermediate time-window constraints, and the eco-driving problem for a fleet of trains under the green-wave policy. The latter two problems are particularly relevant in modern, busy railway networks. We start from proposing a relaxed continuous optimal control formulation for the classic single-train eco-driving problem and rigorously prove that the relaxation is exact. To solve this relaxed optimal control problem, we use the direct method by discretizing the independent variable in the problem and converting the problem to a nonlinear program, where the latter can be effectively solved to exact solutions. To further enhance the computational efficiency, we introduce valid inequalities for the nonlinear program. Numerical experiments are conducted to demonstrate the performance of our proposed method in terms of solution quality and computing time, which shows that our proposed method outperforms benchmark direct methods in solving the classic single-train eco-driving problem. Furthermore, we extend our proposed method to solve the other two aforementioned more complicated but practical eco-driving problems, and our proposed method can deliver exact solutions for the formulated nonlinear nonconvex programs within reasonable computing time.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":""},"PeriodicalIF":5.8,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143799414","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}