Transportation Research Part B-Methodological最新文献

{"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}

{"title":"A game-theoretical model of road pricing with an endogenized user-equilibrium with multiple user classes","authors":"Gaurav Malik ,&nbsp;Stef Proost ,&nbsp;Chris M․J․ Tampère","doi":"10.1016/j.trb.2025.103211","DOIUrl":"10.1016/j.trb.2025.103211","url":null,"abstract":"<div><div>This paper presents a game-theoretical model of road pricing. The model incorporates an endogenized demand and path-choice user-equilibrium with variable user demand and multiple user classes. Different to most of the literature, the proposed model allows to compute in a direct way the optimal tolls, rather than by trial and error of exogenous toll values and tackles the problem of inactive paths that can become active (and vice-versa). Additionally, games with multiple government in different settings can be solved. We proceed in four stages. Firstly, the user-equilibrium model is developed to predict the response of general users to toll instruments of the government(s). Modelling of multiple user classes allows to differentiate users who have different Value of Time and Willingness-To-Pay for their trips. Further, it allows such users to be targeted by different toll instruments. Secondly, a single-player optimization problem is formulated to find optimal toll values for a government acting as a Stackelberg leader over the users. Thirdly, to handle the non-uniqueness of user-equilibrium path flows, a heuristic-based post-processing method is presented that helps in identifying suitable access restrictions necessary to avoid the suboptimal user responses. Fourthly, the single-player optimization problem is used as a building block to develop a general game-theoretical framework that can be applied to different competition scenarios between different types of governments with each, possibly, tolling a different part of the network or the society. The model is, then, applied to four illustrative case-studies. The first case-study involves a single-player optimization problem and ends with a comparison of three solution methods. Mixed Integer Quadratic Program is shown to be the fastest as well as the most consistent. The second case-study involves a game-theoretical problem with two governments and two user classes, and four competition scenarios are elaborated. It is demonstrated how the central objective function can only be worsened by any type of competition between players, and that players have an incentive to take leadership to convert a Nash game to a Stackelberg game. The third case study specifically addresses the non-uniqueness of user-equilibrium path flows, and two different levels of access restrictions are assessed in the post-processing. Finally, the fourth case study shows an application of the single-player optimization problem to a real-world urban mobility problem.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103211"},"PeriodicalIF":5.8,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143783891","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":"Conflict-free optimal control of connected automated vehicles at unsignalized intersections: A condition-based computational framework with constrained terminal position and speed","authors":"Yongjie Xue ,&nbsp;Li Zhang ,&nbsp;Yuxuan Sun ,&nbsp;Yu Zhou ,&nbsp;Zhiyuan Liu ,&nbsp;Bin Yu","doi":"10.1016/j.trb.2025.103209","DOIUrl":"10.1016/j.trb.2025.103209","url":null,"abstract":"<div><div>Conventional intersection management relies on traffic signals to coordinate conflicting traffic flows and distribute right-of-way. However, delays caused by traffic signals remain a major burden on urban transportation systems. Emerging connected automated vehicles (CAVs) are expected to improve the intersection management by coordinating vehicle movements without relying on traffic signals. Hence, this paper primarily focuses on coordinating CAVs at unsignalized intersections, especially common unsignalized intersections composed of major and minor roads, which exhibit inherent asymmetries such as higher speed limits and vehicle arrival rates on major roads compared to minor roads. We propose a conflict-free optimal control method to achieve highly efficient coordination of CAVs at these unsignalized intersections. The method employs a hierarchical coordination framework, in which an upper layer optimizes the passing order for CAVs through the intersection, and a lower layer designs a second-order optimal control model with constrained terminal position and speed for trajectory planning. Specifically, the upper layer adopts an improved Incremental Learning Monte Carlo Tree Search to efficiently generate a nearly global-optimal passing order for CAVs within a very short planning time. The lower layer introduces a condition-based computational framework that enhances the standard iterative solution procedure used in the constrained Hamiltonian analysis, and derives a closed-form analytical solution for the constrained optimal control problem without any recursive steps. The results of numerical experiments show that the proposed method can achieve real-time conflict-free optimal trajectory planning for all CAVs. Compared with fully-actuated signal control, the proposed method reduces the average delay for all CAVs by <span><math><mrow><mn>19</mn><mo>.</mo><mn>92</mn><mi>s</mi></mrow></math></span>, <span><math><mrow><mn>16</mn><mo>.</mo><mn>46</mn><mi>s</mi></mrow></math></span>, and <span><math><mrow><mn>15</mn><mo>.</mo><mn>47</mn><mi>s</mi></mrow></math></span> under both symmetric and asymmetric traffic demands (i.e., the ratios of CAV arrival rates on the major to minor roads are 1:1, 2:1, and 3:1, respectively).</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103209"},"PeriodicalIF":5.8,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143759600","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":"Computational investigations of a multi-class traffic flow model: Mean-field and microscopic dynamics","authors":"A. Machtalay ,&nbsp;A. Habbal ,&nbsp;A. Ratnani ,&nbsp;I. Kissami","doi":"10.1016/j.trb.2025.103196","DOIUrl":"10.1016/j.trb.2025.103196","url":null,"abstract":"<div><div>We address a multi-class traffic model, for which we computationally assess the ability of mean-field games (MFGs) to yield approximate Nash equilibria for traffic flow games of intractable large finite-players. We introduce <em>ad hoc</em> numerical methodologies, with recourse to techniques such as High-Performance Computing (HPC) and regularization of Loose Generalized Minimal Residual (LGMRES) solvers. The developed apparatus allows us to perform simulations at significantly larger space and time discretization scales. For three generic scenarios of cars and trucks, and three cost functionals, we provide numerous numerical results related to the autonomous vehicles (AVs) traffic dynamics, which corroborate for the multi-class case the effectiveness of the approach emphasized in Huang et al. (2020). We additionally provide several original comparisons of macroscopic Nash mean-field speeds with their microscopic versions, allowing us to computationally validate the so-called <span><math><mrow><mi>ϵ</mi><mo>−</mo></mrow></math></span>Nash approximation, with a rate slightly better than theoretically expected.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103196"},"PeriodicalIF":5.8,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143695910","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":"There is something more fundamental than fundamental diagram","authors":"Daiheng Ni","doi":"10.1016/j.trb.2025.103206","DOIUrl":"10.1016/j.trb.2025.103206","url":null,"abstract":"<div><div>Revealing the inherent relationships among traffic flow characteristics, fundamental diagram has long been regarded as one of the pillars of traffic flow theory since Greenshields seminal work. When it is combined with the law of (mass/vehicle) conservation, dynamic modelling of traffic flow at the macroscopic level such as LWR and others have thrived. This paper shows that fundamental diagram is only a shadow of something more fundamental, i.e., phase diagram, which is originated from first principles of physics. At the microscopic level, traffic flow can be analyzed by examining the relative motion of two vehicles in car following. When the coordinate system is fixed on the leading vehicle, the Hamiltonian of this system can be defined as the total energy of the system. Conservation of total energy is established by incorporating physical entities (vehicles) and non-physical entities (drivers), the latter of which is enabled by the field theory of traffic flow. Consequently, the Hamilton's equations stipulate a vector field that constitutes the phase diagram of the system which, in turn, specifies Hamiltonian flow swirling around some equilibrium points. When focusing on the equilibrium points, the phase diagram reduces to the fundamental diagram, during which process much information is lost. Consequently, the lost information obscures the origin of the equilibrium points and further the fundamental diagram. This research roots traffic flow theory in first principles of physics and offers an example to address the dynamics of similar systems that involve human intelligence.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103206"},"PeriodicalIF":5.8,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143637759","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 flexible non-normal random coefficient multinomial probit model: Application to investigating commuter's mode choice behavior in a developing economy context","authors":"Chandra R. Bhat ,&nbsp;Aupal Mondal ,&nbsp;Abdul Rawoof Pinjari","doi":"10.1016/j.trb.2025.103186","DOIUrl":"10.1016/j.trb.2025.103186","url":null,"abstract":"<div><div>There is growing interest in employing non-normal parameter distributions on covariates to account for random taste heterogeneity in multinomial choice models. In this study, we propose a flexible, computationally tractable, structurally simple, and parsimonious-in-specification random coefficients multinomial probit (MNP) model that can accommodate non-normality in the random coefficients. Our proposed methodology subsumes the normally distributed random coefficient MNP model as a special case, thus eliminating the need to a priori decide on the distributional assumption for each coefficient. The approach employs an implicit Gaussian copula to combine the univariate coefficient distributions into a multivariate distribution with a flexible dependence structure. Using our new flexible MNP framework, we investigate the commute mode choice behavior for workers in the city of Bengaluru, a metropolitan city in southern India. Results from our analysis indicate that sociodemographic variables, commute characteristics, and mode-related attributes significantly impact the commute mode choice decision. Importantly, our results indicate the presence of unobserved taste heterogeneity in the sensitivities to the travel time and travel cost variables; moreover, the distribution of the travel time coefficient is found to be significantly non-normal. In terms of data fit, our proposed model statistically outperforms the traditional MNP model as well as an MNP model that imposes normality on the travel time coefficient. The pitfalls of ignoring non-normality in the distribution of parameters are also discussed, as are several policies to promote a shift from private modes of transportation to more sustainable public transportation/walk modes.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103186"},"PeriodicalIF":5.8,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143627570","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":"Bounding the efficiency of vehicle automation in general transportation networks","authors":"Fang Zhang ,&nbsp;Qiang Meng ,&nbsp;Araz Taeihagh","doi":"10.1016/j.trb.2025.103204","DOIUrl":"10.1016/j.trb.2025.103204","url":null,"abstract":"<div><div>Emerging autonomous vehicle (AV) technology is expected to bring substantive benefits to the transportation systems. This study focuses on the improvement of travel efficiency in transportation networks with AVs. Inspired by the concept of price of anarchy (PoA), we introduce a novel indicator, the benefit of vehicle automation (BVA), to quantify the efficiency benefit brought by AVs. The BVA is defined as the ratio of the transportation network performances under the two user equilibrium states before and after the penetration of AVs. In characterizing the BVA, both the AV market penetration rates and the automation levels are used to describe AV deployment, and the impact of AVs in terms of capacity improvement and value-of-travel-time (VOTT) compensation are explicitly considered. Under mild assumptions, we derive a family of bounds of BVA that are independent of the network topology, including two types of lower bounds and four types of upper bounds. These bounds have different degrees of generality and effectiveness in distinct scenarios. Properties including tightness, monotonicity and generality of the bounds are discussed. Numerical experiments on general networks are conducted to verify the effectiveness and applicability of them. Furthermore, we also propose two bicriteria bounds of BVA. The first specifies the maximum level of rising demand whose induced efficiency loss can be offset by the benefit of AV penetration, while the second provides an upper bound on the worse-off degree of the performance due to non-uniform AV penetration across origin-destination pairs. This work is expected to deepen our understanding of the efficiency benefit of AVs in general transportation networks, and to provide a guideline for policymakers to navigate the integration of AVs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103204"},"PeriodicalIF":5.8,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143628274","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}