Optimal locations and travel time display for variable message signs

This paper first develops a network equilibrium model with the travel time information displayed via variable message signs (VMS). Specifically, the equilibrium considers the impact of the displayed travel time information on travelers’ route choices under the recurrent congestion, with the endogenous utilization rates of displayed information by travelers. The existence of the equilibrium is proved and an iterative solution procedure is provided. Then, we conduct the sensitivity analyses of the network equilibrium and further propose a paradox, i.e., providing travel time information via VMS to travelers may degrade the network performance under some poor designs. Therefore, we investigate the problem of designing the VMS locations and travel time display within a given budget, and formulate it as a mixed integer nonlinear program, solved by an active-set algorithm. Lastly, numerical examples are presented to offer insights on the equilibrium results and optimal designs of VMS.     

A path-based flow formulation for the traffic assignment problem

In order to improve cooperation between traffic management and travelers, traffic assignment is the key component to achieve the objectives of both traffic management and route choice decisions for travelers. Traffic assignment can be classified into two models based on the behavioral assumptions governing route choices: User Equilibrium (UE) and System Optimum (SO) traffic assignment. According to UE and SO traffic assignment, travelers usually compete to choose the least cost routes to minimize their own travel costs, while SO traffic assignment requires travelers to work cooperatively to minimize overall cost in the road network. Thus, the paradox of benefits between UE and SO indicates that both are not practical. Thus, a solution technique needs to be proposed to balance UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment problem, which can achieve the trade-off process between traffic management and travelers. Since traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve efficiency.     

Expirable parking reservations for managing morning commute with parking space constraints

When total parking supply in an urban downtown area is insufficient, morning commuters would choose their departure times not only to trade off bottleneck congestion and schedule delays, but also to secure a parking space. Recent studies found that an appropriate combination of reserved and unreserved parking spaces can spread the departures of those morning commuters and hence reduce their total travel cost. To further mitigate both traffic congestion and social cost from competition for parking, this study considers a parking reservation scheme with expiration times, where commuters with a parking reservation have to arrive at parking spaces for the reservation before a predetermined expiration time. We first show that if all parking reservations have the same expiration time, it is socially preferable to set the reservations to be non-expirable, i.e., without expiration time. However, if differentiated expiration times are properly designed, the total travel cost can be further reduced as compared with the reservation scheme without expiration time, since the peak will be further smoothed out. We explore socially desirable equilibrium flow patterns under the parking reservation scheme with differentiated expiration times. Finally, efficiencies of the reservation schemes are examined.     

A survey on planning semi-flexible transit systems: Methodological issues and a unifying framework

When demand for transportation is low or sparse, traditional transit cannot provide efficient and good-quality service, due to its fixed structure. New transportation alternatives are therefore increasingly proposed, combining on-demand service adjustment capabilities to the regular route and schedule characteristics of traditional transit. Such so-called semi-flexible systems require careful planning, but no formalization of the corresponding decisions problems, nor any comprehensive methodology has been proposed yet. This paper aims at contributing to fill this gap by presenting a comprehensive literature review, and a general and unifying modeling framework for representing and planning semi-flexible systems. The latter takes the form of the Demand Adaptive Systems, which generalizes the semi-flexible systems described in the literature, and also offers a number of advanced features, the scheduling mechanism, in particular. The paper then provides a classification of planning decisions, which is used to structure a comprehensive and comparative literature review of the field of semi-flexible systems, including methodological contributions as well as a number of particularly significant practical experiences.     

Is equilibrium in transport pure Nash,mixed or Stochastic?

The classical theory of transport equilibrium is based on the Wardrop’s first principle that describes a Nash User Equilibrium (UE), where in no driver can unilaterally change routes to improve his/her travel times. A growing number of economic laboratory experiments aiming at testing Nash-Wardrop equilibrium have shown that the Pure Strategy Nash Equilibrium (PSNE) is not able to explain the observed strategic choices well. In addition even though Mixed Strategy Nash Equilibrium (MSNE) has been found to fit better the observed aggregate choices, it does not explain the variance in choices well. This study analyses choices made by users in three different experiments involving strategic interactions in endogenous congestion to evaluate equilibrium prediction. We compare the predictions of the PSNE, MSNE and Stochastic User Equilibrium (SUE). In SUE, the observed variations in choices are assumed to be due to perception errors. The study proposes a method to iteratively estimate SUE models on choice data with strategic interactions. Among the three sets of experimental data the SUE approach was found to accurately predict the average choices, as well as the variances in choices. The fact that the SUE model was found to accurately predict variances in choices, suggests its applicability for transport equilibrium models that attempt to evaluate reliability in transportation systems. This finding is fundamental in the effort to determining a behaviourally consistent paradigm to model equilibrium in transport networks. The study also finds that Fechner error which is the inverse of the scale parameter in the SUE model is affected by the group sizes and the complexity of the cost function. In fact, the larger group sizes and complexity of cost functions increased the variability in choices. Finally, from an experimental design standpoint we show that it is not possible to estimate a noise parameter associate to Fechner error in the case when the choices are equally probable.     

Network equilibrium models with battery electric vehicles

The limited driving ranges, the scarcity of recharging stations and potentially long battery recharging or swapping time inevitably affect route choices of drivers of battery electric vehicles (BEVs). When traveling between their origins and destinations, this paper assumes that BEV drivers select routes and decide battery recharging plans to minimize their trip times or costs while making sure to complete their trips without running out of charge. With different considerations of flow dependency of energy consumption of BEVs and recharging time, three mathematical models are formulated to describe the resulting network equilibrium flow distributions on regional or metropolitan road networks. Solution algorithms are proposed to solve these models efficiently. Numerical examples are presented to demonstrate the models and solution algorithms.     

非圆弧滑面滑坡中满足平衡条件的预应力锚索设计拉力的确定方法

在以往的设计计算中 ,对非圆弧滑坡预应力锚索的设计一般采用指定设计外力而根据整体平衡来确定锚索根数 ,并认为锚索作用力以集中荷载作用在滑面上 ,实际上由于作用在地面的荷载经滑体传递后发生了很大的扩散作用 ,且以往的计算方法是不能找到理论依据的 ,即不满足任何力及力矩的平衡条件 ,因而不尽合理 ,本文根据其受力特点从平衡条件出发 ,导出了确定锚索设计外力的迭代算法公式 ,对工程实际具有较大的理论意义。     

A capacity restraint transit assignment with elastic line frequency

This paper proposes a new formulation for the capacity restraint transit assignment problem with elastic line frequency, in which the line frequency is related to the passenger flows on transit lines. A stochastic user equilibrium transit assignment model with congestion and elastic line frequency is proposed and the equivalent mathematical programming problem is also formulated. Since the passenger waiting time and the line capacity are dependent on the line frequency, a fixed point problem with respect to the line frequency is devised accordingly. The existence of the fixed point problem has been proved. A solution algorithm for the proposed model is presented. Finally, a numerical example is used to illustrate the application of the proposed model and solution algorithm.     

A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations

In this paper, we propose a link-node complementarity model for the basic deterministic dynamic user equilibrium (DUE) problem with single-user-class and fixed demands. The model complements link-path formulations that have been widely studied for dynamic user equilibria. Under various dynamic network constraints, especially the exact flow propagation constraints, we show that the continuous-time dynamic user equilibrium problem can be formulated as an infinite dimensional mixed complementarity model. The continuous-time model can be further discretized as a finite dimensional non-linear complementarity problem (NCP). The proposed discrete-time model captures the exact flow propagation constraints that were usually approximated in previous studies. By associating link inflow at the beginning of a time interval to travel times at the end of the interval, the resulting discrete-time model is predictive rather than reactive. The solution existence and compactness condition for the proposed model is established under mild assumptions. The model is solved by an iterative algorithm with a relaxed NCP solved at each iteration. Numerical examples are provided to illustrate the proposed model and solution approach. We particularly show why predictive DUE is preferable to reactive DUE from an algorithmic perspective.