The variational formulation of a non-equilibrium traffic flow model: Theory and implications

The analysis and numerical solution of non-equilibrium traffic flow models in current literature are almost exclusively carried out in the hyperbolic conservation law framework, which requires a good understanding of the delicate and non-trivial Riemann problems for conservation laws. In this paper, we present a novel formulation of certain non-equilibrium traffic flow models based on their isomorphic relation with optimal control problems. This formulation extends the minimum principle observed by the LWR model. We demonstrate that with the new formulation, generic initial-boundary conditions can be conveniently handled and a simplified numerical solution scheme for non-equilibrium models can be devised. Besides deriving the variational formulation, we provide a comprehensive discussion on its mathematical properties and physical implications.     

Optimal control of headway variation on transit routes

Headway control strategies have been proposed as methods for correcting transit service irregularities and thereby reducing passenger wait times at stops. This paper addresses a particular strategy which can be implemented on high frequency routes (headways under 10–12 minutes), in which buses are held at a control stop to a threshold headway. An algorithm is developed which yields the optimal control stop location and optimal threshold headway with respect to a system wait function. The specification of the wait function is based on the development of several empirical models, including a headway variation model and an average delay time model at control stops. A conclusion is reached that the headway variation does not increase linearly along a route, a common assumption made in many previous studies. Furthermore, the location of the optimal control stop and threshold value are sensitive to the passenger boarding profile, as expected. The algorithm itself appears to have practical application to conventional transit operations.     

Anisotropic second-order models and associated fundamental diagrams

According to Banks [Investigation of some characteristics of congested flow. Transportation Research Record, 1999], traffic heterogeneity explains the data scattering on the flow–density plane and positive transferences within the congested phase (a transference is a line connecting adjacent points in the time series). This heterogeneity results from a traffic mixture, made up of various vehicles and drivers, or different traffic conditions such as meteorological conditions. This paper only deals with traffic mixture and more particularly with vehicle classes such as passenger car and truck, which are correlated to the vehicle length. When considering a macroscopic model, the mean vehicle length, which is measured by sensors, is associated with the truck percentage. Then the Generic Second Order Model (GSOM) by Lebacque [Lebacque, J.P., Mammar, S., Haj-Salem, H., 2007a. Generic second-order traffic flow modeling. In: Proceedings of the 17th International Symposium on Transportation and Traffic Theory, London, 23–25 July 2007, 749–770.] provides a rigorous mathematical framework for traffic heterogeneity modeling. The added value in this paper is that admissible invariants which characterize generic fundamental diagrams, possibly depending on the mean vehicle length, are interpreted and debated. Aw–Rascle–Zhang’s [Aw, A., Rascle, M., 2000. Resurrection of second-order models of traffic flow. SIAM Journal of Applied Mathematics, 60 (3), 916–938; Zhang, H.M., 2002. A non equilibrium traffic model devoid of gas-like behavior. Transportation Research Part B, 36, 275–290.] and Colombo’s [Colombo, R.M., 2002. A 2 × 2 hyperbolic traffic flow model. Mathematical and Computer Modeling, 35, 683–688.] anisotropic models are deeply analyzed from a traffic point of view. At last an extended GSOM equation system provides a full parameterization of fundamental diagrams which is needed to traffic heterogeneity modeling.     

Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies and emerging modalities. However, duration choice of activities and home-stay has not been incorporated in this formalism yet. This study models duration choice in the state-of-the-art multi-state supernetworks. An activity link with flexible duration is transformed into a time-expanded bipartite network; a home location is transformed into multiple time-expanded locations. Along with these extensions, multi-state supernetworks can also be coherently expanded in space–time. The derived properties are that any path through a space–time supernetwork still represents a consistent activity-travel pattern, duration choice are explicitly associated with activity timing, duration and chain, and home-based tours are generated endogenously. A forward recursive formulation is proposed to find the optimal patterns with the optimal worst-case run-time complexity. Consequently, the trade-off between travel and time allocation to activities and home-stay can be systematically captured.     

Remuneration models and revenue risk mitigation in road public–private partnership projects – a case study from Serbia

As a consequence of renewed interest in attracting private financing for infrastructure investments, public–private partnership (PPP) arrangements are mostly seen as a suitable mechanism for ensuring sound and quicker delivery of transport infrastructure projects. However, a general concern is that expectations of mobilizing private-sector funds have been overestimated in a number of cases. The purpose of this paper is to contribute to the risk analysis of transport PPP projects with substantial exogenous demand risk which could serve as a rationale for choosing the appropriate PPP model. The objective of this paper is to construct an analytical cash flow-based project model to facilitate the choice of the remuneration mechanism suitable for both private investors and public sector. The model provides an indication whether the project should be implemented as a ‘users pay’, a hybrid or an ‘annuity’ PPP model. The proposed methodology is illustrated using a case study from Serbia.     

A methodology to control urban traffic noise under the constraint of environmental capacity: A case study of a double-decision optimization model

This paper presents a novel methodology to control urban traffic noise under the constraint of environmental capacity. Considering the upper limits of noise control zones as the major bottleneck to control the maximum traffic flow is a new idea. The urban road network traffic is the mutual or joint behavior of public self-selection and management decisions, so is a typical double decision optimization problem.The proposed methodology incorporates theoretically model specifications. Traffic noise calculation model and traffic assignment model for O–D matrix are integrated based on bi-level programming method which follows an iterated process to obtain the optimal solution. The upper level resolves the question of how to sustain the maximum traffic flow with noise capacity threshold in a feasible road network. The user equilibrium method is adopted in the lower layer to resolve the O–D traffic assignment.The methodology has been applied to study area of QingDao, China. In this illustrative case, the noise pollution level values of optimal solution could satisfy the urban environmental noise capacity constraints. Moreover, the optimal solution was intelligently adjusted rather than simply reducing the value below a certain threshold. The results indicate that the proposed methodology is feasible and effective, and it can provide a reference for a sustainable development and noise control management of the urban traffic.     

A connected-vehicle-based dynamic control model for managing the bus bunching problem with capacity constraints

This paper describes a connected-vehicle-based system architecture which can provide more precise and comprehensive information on bus movements and passenger status. Then a dynamic control method is proposed using connected vehicle data. Traditionally, the bus bunching problem has been formulated into one of two types of optimization problem. The first uses total passenger time cost as the objective function and capacity, safe headway, and other factors as constraints. Due to the large number of scenarios considered, this type of framework is inefficient for real-time implementation. The other type uses headway adherence as the objective and applies a feedback control framework to minimize headway variations. Due to the simplicity in the formulation and solution algorithms, the headway-based models are more suitable for real-time transit operations. However, the headway-based feedback control framework proposed in the literature still assumes homogeneous conditions at all bus stations, and does not consider restricting passenger loads within the capacity constraints. In this paper, a dynamic control framework is proposed to improve not only headway adherence but also maintain the stability of passenger load within bus capacity in both homogenous and heterogeneous situations at bus stations. The study provides the stability conditions for optimal control with heterogeneous bus conditions and derives optimal control strategies to minimize passenger transit cost while maintaining vehicle loading within capacity constraints. The proposed model is validated with a numerical analysis and case study based on field data collected in Chengdu, China. The results show that the proposed model performs well on high-demand bus routes.     

A partial differential equation formulation of Vickrey’s bottleneck model,part I: Methodology and theoretical analysis

This paper is concerned with the continuous-time Vickrey model, which was first introduced in Vickrey (1969). This model can be described by an ordinary differential equation (ODE) with a right-hand side which is discontinuous in the unknown variable. Such a formulation induces difficulties with both theoretical analysis and numerical computation. Moreover it is widely suspected that an explicit solution to this ODE does not exist. In this paper, we advance the knowledge and understanding of the continuous-time Vickrey model by reformulating it as a partial differential equation (PDE) and by applying a variational method to obtain an explicit solution representation. Such an explicit solution is then shown to be the strong solution to the ODE in full mathematical rigor. Our methodology also leads to the notion of generalized Vickrey model (GVM), which allows the flow to be a distribution, instead of an integrable function. As explained by Han et al. (in press), this feature of traffic modeling is desirable in the context of analytical dynamic traffic assignment (DTA). The proposed PDE formulation provides new insights into the physics of The Vickrey model, which leads to a number of modeling extensions as well as connection with first-order traffic models such as the Lighthill–Whitham–Richards (LWR) model. The explicit solution representation also leads to a new computational method, which will be discussed in an accompanying paper, Han et al. (in press).     

Integrating congestion pricing and transit investment planning

This paper develops a mathematical model and solution procedure to identify an optimal zonal pricing scheme for automobile traffic to incentivize the expanded use of transit as a mechanism to stem congestion and the social costs that arise from that congestion. The optimization model assumes that there is a homogenous collection of users whose behavior can be described as utility maximizers and for which their utility function is driven by monetary costs. These monetary costs are assumed to be the tolls in place, the per mile cost to drive, and the value of their time. We assume that there is a system owner who sets the toll prices, collects the proceeds from the tolls, and invests those funds in transit system improvements in the form of headway reductions. This yields a bi-level optimization model which we solve using an iterative procedure that is an integration of a genetic algorithm and the Frank–Wolfe method. The method and solution procedure is applied to an illustrative example.     

Transition choice probabilities and welfare analysis in random utility models with imperfect before–after correlation

Welfare in random utility models is used to be analysed on the basis of only the expectation of the compensating variation. De Palma and Kilani (De Palma, A., Kilani, K., 2011. Transition choice probabilities and welfare analysis in additive random utility models. Economic Theory 46(3), 427–454) have developed a framework for conditional welfare analysis which provides analytic expressions of transition choice probabilities and associated welfare measures. The contribution is of practical relevance in transportation because it allows to compute shares of shifters and non-shifters and attribute benefits to them in a rigorous way. In De Palma and Kilani (2011) the usual assumption of unchanged random terms before and after is made.The paper generalises the framework for conditional welfare analysis to cases of imperfect before–after association of the random terms. The joint before–after distribution of the random terms is introduced with postulated properties in terms of marginal distributions and covariance matrix. Analytic expressions, based on the probability density function and the cumulative distribution function of the joint before–after distribution, and simulation procedures for computation of the transition choice probabilities and the conditional expectations of the compensating variation are provided. Results are specialised for multinomial logit and probit. In the case without income effects, it is proved that the unconditional expectation of the compensating variation depends only on the marginal distributions.The theory is illustrated by a numerical example which refers to a multinomial logit applied to the choice of the transport mode with two specifications, one without and one with income effects. Results show that transition probabilities and conditional welfare measures are affected significantly by the assumption on the before–after correlation. The variability in the transition probabilities across transitions tends to decrease as the before–after correlation decreases. In the extreme case of independent random terms, the conditional expectations of the compensating variation tend to be close to the unconditional expectation.     

A generalized sensor location model for the estimation of network origin–destination matrices

This study examined the network sensor location problem by using heterogeneous sensor information to estimate link-based network origin–destination (O–D) demands. The proposed generalized sensor location model enables different sensors’ traffic monitoring capabilities to be used efficiently and the optimal number and deployment locations of both passive- and active-type sensors to be determined simultaneously without path enumeration. The proposed sensor location model was applied to solve the network O–D demand estimation problem. One unique aspect of the proposed model and solution algorithms is that they provide satisfactory network O–D demand estimates without requiring unreasonable assumptions of known prior information on O–D demands, turning proportions, or route choice probabilities. Therefore, the proposed model and solution algorithms can be practically used in numerous offline transportation planning and online traffic operation applications.     

Dynamic system-optimal traffic assignment using a state space model

We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations during a given time horizon. The objective is to assign the vehicles to links over time so as to minimize the total travel time experienced by all the vehicles using the network. We model the traffic network over the time horizon as a discrete-time dynamical system. The system state at each time instant is defined in a way that, without loss of optimality, avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no explicit path enumeration. The state transition function can model link travel times by either impedance functions, link outflow functions, or by a combination of both. Two versions (with different boundary conditions) of the problem of optimal traffic assignment are studied in the context of this model. These optimization problems are optimal control problems for nonlinear discrete-time dynamical systems, and thus they are amenable to algorithmic solutions based on dynamic programming. The computational challenges associated with the exact solution of these problems are discussed and some heuristics are proposed.     

Optimal vehicle speed trajectory on a signalized arterial with consideration of queue

Vehicle speed trajectory significantly impacts fuel consumption and greenhouse gas emissions, especially for trips on signalized arterials. Although a large amount of research has been conducted aiming at providing optimal speed advisory to drivers, impacts from queues at intersections are not considered. Ignoring the constraints induced by queues could result in suboptimal or infeasible solutions. In this study, a multi-stage optimal control formulation is proposed to obtain the optimal vehicle trajectory on signalized arterials, where both vehicle queue and traffic light status are considered. To facilitate the real-time update of the optimal speed trajectory, a constrained optimization model is proposed as an approximation approach, which can be solved much quicker. Numerical examples demonstrate the effectiveness of the proposed optimal control model and the solution efficiency of the proposed approach.     

Global optimization methods for the discrete network design problem

This paper addresses the discrete network design problem (DNDP) with multiple capacity levels, or multi-capacity DNDP for short, which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose two global optimization methods by taking advantage of the relationship between UE and system optimal (SO) traffic assignment principles. The first method, termed as SO-relaxation, exploits the property that an optimal network design solution under SO principle can be a good approximate solution under UE principle, and successively sorts the solutions in the order of increasing total travel time under SO principle. Optimality is guaranteed when the lower bound of the total travel time of the unexplored solutions under UE principle is not less than the total travel time of a known solution under UE principle. The second method, termed as UE-reduction, adds the objective function of the Beckmann-McGuire-Winsten transformation of UE traffic assignment to the constraints of the SO-relaxation formulation of the multi-capacity DNDP. This constraint is convex and strengthens the SO-relaxation formulation. We also develop a dynamic outer-approximation scheme to make use of the state-of-the-art mixed-integer linear programming solvers to solve the SO-relaxation formulation. Numerical experiments based on a two-link network and the Sioux-Falls network are conducted.     

The nonlinear equation system approach to solving dynamic user optimal simultaneous route and departure time choice problems

Dynamic user optimal simultaneous route and departure time choice (DUO-SRDTC) problems are usually formulated as variational inequality (VI) problems whose solution algorithms generally require continuous and monotone route travel cost functions to guarantee convergence. However, the monotonicity of the route travel cost functions cannot be ensured even if the route travel time functions are monotone. In contrast to traditional formulations, this paper formulates a DUO-SRDTC problem (that can have fixed or elastic demand) as a system of nonlinear equations. The system of nonlinear equations is a function of generalized origin-destination (OD) travel costs rather than route flows and includes a dynamic user optimal (DUO) route choice subproblem with perfectly elastic demand and a quadratic programming (QP) subproblem under certain assumptions. This study also proposes a solution method based on the backtracking inexact Broyden–Fletcher–Goldfarb–Shanno (BFGS) method, the extragradient algorithm, and the Frank-Wolfe algorithm. The BFGS method, the extragradient algorithm, and the Frank-Wolfe algorithm are used to solve the system of nonlinear equations, the DUO route choice subproblem, and the QP subproblem, respectively. The proposed formulation and solution method can avoid the requirement of monotonicity of the route travel cost functions to obtain a convergent solution and provide a new approach with which to solve DUO-SRDTC problems. Finally, numeric examples are used to demonstrate the performance of the proposed solution method.     

Trial-and-error method for congestion pricing scheme under side-constrained probit-based stochastic user equilibrium conditions

A toll pattern that can restrict link flows on the tolled links to some predetermined thresholds is named as effective toll solution, which can be theoretically obtained by solving a side-constraint traffic assignment problem. Considering the practical implementation, this paper investigates availability of an engineering-oriented trial-and-error method for the effective toll pattern of cordon-based congestion pricing scheme, under side-constrained probit-based stochastic user equilibrium (SUE) conditions. The trial-and-error method merely requires the observed traffic counts on each entry of the cordon. A minimization model for the side-constrained probit-based SUE problem with elastic demand is first proposed and it is shown that the effective toll solution equals to the product of value of time and optimal Lagrangian multipliers with respect to the side constraints. Then, employing the Lagrangian dual formulation of the minimization method, this paper has built a convergent trial-and-error method. The trial-and-error method is finally tested by a numerical example developed from the cordon-based congestion pricing scheme in Singapore.     

Origin–destination missing data estimation for freight transportation planning: a gravity model-based regression approach

This paper develops a log-linear regression approach to estimate missing data in a sparse origin–destination (O–D) matrix assuming the sampled or observed O–D trips follow a good gravity pattern. The approach is tested with randomly selected samples from the known portions of 1997, 2002, and 2007 US Commodity Flow Survey (CFS) O–D value and tonnage matrices and validated with 2007 US O–D tonnage matrix at the state level. The missing data are also estimated for the 2007 CFS tonnage matrix with the best intercept and coefficients obtained using all known entries of the matrix. The concept of the approach can be extended beyond the gravity model to any strong mathematical pattern embedded in the known set of a sparse O–D matrix to estimate its missing cells.     

The key principles of optimal train control—Part 1: Formulation of the model,strategies of optimal type,evolutionary lines,location of optimal switching points

We discuss the problem of finding an energy-efficient driving strategy for a train journey on an undulating track with steep grades subject to a maximum prescribed journey time. We review the state-of-the-art and establish the key principles of optimal train control for a general model with continuous control. The model with discrete control is not considered. We assume only that the tractive and braking control forces are bounded by non-increasing speed-dependent magnitude constraints and that the rate of energy dissipation from frictional resistance is given by a non-negative strictly convex function of speed. Partial cost recovery from regenerative braking is allowed. The cost of the strategy is the mechanical energy required to drive the train. Minimising the mechanical energy is an effective way of reducing the fuel or electrical energy used by the traction system. The paper is presented in two parts. In Part 1 we discuss formulation of the model, determine the characteristic optimal control modes, study allowable control transitions, establish the existence of optimal switching points and consider optimal strategies with speed limits. We find algebraic formulae for the adjoint variables in terms of speed on track with piecewise-constant gradient and draw phase plots of the associated optimal evolutionary lines for the state and adjoint variables. In Part 2 we will establish important integral forms of the necessary conditions for optimal switching, find general bounds on the positions of the optimal switching points, justify the local energy minimization principle and show how these ideas are used to calculate optimal switching points. We will prove that an optimal strategy always exists and use a perturbation analysis to show the strategy is unique. Finally we will discuss computational techniques in realistic examples with steep gradients and describe typical optimal strategies for a complete journey.     

Rolling horizon stochastic optimal control strategy for ACC and CACC under uncertainty

This paper presents a rolling horizon stochastic optimal control strategy for both Adaptive Cruise Control and Cooperative Adaptive Cruise Control under uncertainty based on the constant time gap policy. Specifically, uncertainties that can arise in vehicle control systems and vehicle sensor measurements are represented as normally-distributed disturbances to state and measurement equations in a state-space formulation. Then, acceleration sequence of a controlled vehicle is determined by optimizing an objective function that captures control efficiency and driving comfort over a predictive horizon, constrained by bounded acceleration/deceleration and collision protection. The optimization problem is formulated as a linearly constrained linear quadratic Gaussian problem and solved using a separation principle, Lagrangian relaxation, and Kalman filter. A sensitivity analysis and a scenario-based analysis via simulations demonstrate that the proposed control strategy can generate smoother vehicle control and perform better than a deterministic feedback controller, particularly under small system disturbances and large measurement disturbances.