Connectivity-based optimization of vehicle route and speed for improved fuel economy

Traditionally, vehicle route planning problem focuses on route optimization based on traffic data and surrounding environment. This paper proposes a novel extended vehicle route planning problem, called vehicle macroscopic motion planning (VMMP) problem, to optimize vehicle route and speed simultaneously using both traffic data and vehicle characteristics to improve fuel economy for a given expected trip time. The required traffic data and neighbouring vehicle dynamic parameters can be collected through the vehicle connectivity (e.g. vehicle-to-vehicle, vehicle-to-infrastructure, vehicle-to-cloud, etc.) developed rapidly in recent years. A genetic algorithm based co-optimization method, along with an adaptive real-time optimization strategy, is proposed to solve the proposed VMMP problem. It is able to provide the fuel economic route and reference speed for drivers or automated vehicles to improve the vehicle fuel economy. A co-simulation model, combining a traffic model based on SUMO (Simulation of Urban MObility) with a Simulink powertrain model, is developed to validate the proposed VMMP method. Four simulation studies, based on a real traffic network, are conducted for validating the proposed VMMP: (1) ideal traffic environment without traffic light and jam for studying the fuel economy improvement, (2) traffic environment with traffic light for validating the proposed traffic light penalty model, (3) traffic environment with traffic light and jam for validating the proposed adaptive real-time optimization strategy, and (4) investigating the effect of different powertrain platforms to fuel economy using two different vehicle platforms. Simulation results show that the proposed VMMP method is able to improve vehicle fuel economy significantly. For instance, comparing with the fastest route, the fuel economy using the proposed VMMP method is improved by up to 15%.     

Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network

This paper investigates the impact of cordon-based congestion pricing scheme on the mode-split of a bimodal transportation network with auto and rail travel modes. For any given toll-charge pattern, its impact on the mode-split can be estimated by solving a combined mode-split and traffic-assignment problem. Using a binary logit model for the mode-split, the combined problem is converted into a traffic-assignment problem with elastic demand. Probit-based stochastic user equilibrium (SUE) principle is adopted for this traffic-assignment problem, and a continuously distributed value of time (VOT) is assumed to convert the toll charges and transit fares into time-units. This combined mode-split and traffic-assignment problem is then formulated as a fixed-point model, which can be solved by a convergent Cost Averaging method. The combined mode-split and traffic-assignment problem is then used to analyze a multimodal toll design problem for cordon-based congestion pricing scheme, with the aim of increasing the mode-share of public transport system to a targeted level. Taking the fixed-point model as a constraint, the multimodal toll design problem is thus formulated as a mathematical programming with equilibrium constraints (MPEC) model. A genetic algorithm (GA) is employed to solve this MPEC model, which is then numerical validated by a network example.     

Advanced pricing and rationing policies for large scale multimodal networks

The applying of simplified schemes, such as cordon pricing, as second-best solution to the toll network design problem is investigated here in the context of multiclass traffic assignment on multimodal networks. To this end a suitable equilibrium model has been developed, together with an efficient algorithm capable of simulating large scale networks in quite reasonable computer time. This model implements the theoretical framework proposed in a previous work on the toll optimization problem, where the validity of marginal cost pricing for the context at hand is stated. Application of the model to the real case of Rome shows us, not only that on multimodal networks a relevant share (up to 20%) of the maximum improvements in terms of social welfare achievable with marginal cost pricing can in fact be obtained through cordon pricing, but also that in practical terms rationing is a valid alternative to pricing, thus getting around some of the relevant questions (theoretical, technical, social) the latter raises. As a result we propose a practical method to analyze advanced pricing and rationing policies differentiated for user categories, which enables us to compare alternative operative solutions with an upper bound on social welfare based on a solid theoretical background.     

Revisiting Jiang’s dynamic continuum model for urban cities

Jiang et al. (Jiang, Y.Q., Wong, S.C., Ho, H.W., Zhang, P., Liu, R.X., Sumalee, A., 2011. A dynamic traffic assignment model for a continuum transportation system. Transportation Research Part B 45 (2), 343–363) proposed a predictive continuum dynamic user-optimaDUO-l to investigate the dynamic characteristics of traffic flow and the corresponding route-choice behavior of travelers. Their modeled region is a dense urban city that is arbitrary in shape and has a single central business district (CBD). However, we argue that the model is not well posed due to an inconsistency in the route-choice strategy under certain conditions. To overcome this inconsistency, we revisit the PDUO-C problem, and construct an improved path-choice strategy. The improved model consists of a conservation law to govern the density, in which the flow direction is determined by the improved path-choice strategy, and a Hamilton–Jacobi equation to compute the total travel cost. The simultaneous satisfaction of both equations can be treated as a fixed-point problem. A self-adaptive method of successive averages (MSA) is proposed to solve this fixed-point problem. This method can automatically determine the optimal MSA step size using the least squares approach. Numerical examples are used to demonstrate the effectiveness of the model and the solution algorithm.     

Urban highway congestion

This article examines urban highway congestion pricing in the instance in which it is not possible to levy a congestion toll on a major portion of the urban road system. This case is pertinent because of technical and/or political constraints. The article uses economic theory and numerical examples to show that the optimum second-best toll can vary appreciably from the optimal tolls in a regime in which efficient tolls can be imposed on all routes.     

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.     

Fleet size determination for a truckload distribution center

This work presents an analysis of the fleet size determination problem for a truckload distribution center in which each customer requests multi‐truckload services. A transformation is made to define this problem as a cutting stock problem which can be resolved by finding the proper set of patterns beneficial for an NP‐hard (non‐deterministic polynomial‐time hard) problem. The genetic algorithm (GA) is combined with cutting stock techniques to solve the problem. Experiments are carried out testing two types of problems, with and without time‐window constraints. To verify the solution quality obtained with the proposed approach, the problem is also solved using only GA. It is shown that the proposed approach can significantly improve the GA solution by 14.68%. Copyright © 2012 John Wiley & Sons, Ltd.     

Marginal cost congestion pricing based on the network fundamental diagram

Congestion pricing schemes have been traditionally derived based on analytical representations of travel demand and traffic flows, such as in bottleneck models. A major limitation of these models, especially when applied to urban networks, is the inconsistency with traffic dynamics and related phenomena such as hysteresis and the capacity drop. In this study we propose a new method to derive time-varying tolling schemes using the concept of the Network Fundamental Diagram (NFD). The adopted method is based on marginal cost pricing, while it also enables to account realistically for the dynamics of large and heterogeneous traffic networks. We derive two alternative cordon tolls using network-aggregated traffic flow conditions: a step toll that neglects the spatial distribution of traffic by simply associating the marginal costs of any decrease in production within the NFD to the surplus of traffic; and a step toll that explicitly accounts for how network performance is also influenced by the spatial variance in a 3D-NFD. This pricing framework is implemented in the agent-based simulation model MATSim and applied to a case study of the city of Zurich. The tolling schemes are compared with a uniform toll, and they highlight how the inhomogeneous distribution of traffic may compromise the effectiveness of cordon tolls.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

Road pricing for congestion control with unknown demand and cost functions

It is widely recognized that precise estimation of road tolls for various pricing schemes requires a few pieces of information such as origin–destination demand functions, link travel time functions and users’ valuations of travel time savings, which are, however, not all readily available in practice. To circumvent this difficulty, we develop a convergent trial-and-error implementation method for a particular pricing scheme for effective congestion control when both the link travel time functions and demand functions are unknown. The congestion control problem of interest is also known as the traffic restraint and road pricing problem, which aims at finding a set of effective link toll patterns to reduce link flows to below a desirable target level. For the generalized traffic equilibrium problem formulated as variational inequalities, we propose an iterative two-stage approach with a self-adaptive step size to update the link toll pattern based on the observed link flows and given flow restraint levels. Link travel time and demand functions and users’ value of time are not needed. The convergence of the iterative toll adjustment algorithm is established theoretically and demonstrated on a set of numerical examples.     

Evaluating the impacts of urban corridor traffic signal optimization on vehicle emissions and fuel consumption

This study investigates the impacts of traffic signal timing optimization on vehicular fuel consumption and emissions at an urban corridor. The traffic signal optimization approach proposed integrates a TRANSIMS microscopic traffic simulator, the VT-Micro model (a microscopic emission and fuel consumption estimation model), and a genetic algorithm (GA)-based optimizer. An urban corridor consisting of four signalized intersections in Charlottesville, VA, USA, is used for a case study. The result of the case study is then compared with the best traffic signal timing plan generated by Synchro using the TRANSIMS microscopic traffic simulator. The proposed approach achieves much better performance than that of the best Synchro solution in terms of air quality, energy and mobility measures: 20% less network-wide fuel consumption, 8–20% less vehicle emissions, and nearly 27% less vehicle-hours-traveled (VHT).     

A bi-level programming for bus lane network design

This paper proposes a bi-level programming model to solve the design problem for bus lane distribution in multi-modal transport networks. The upper level model aims at minimizing the average travel time of travelers, as well as minimizing the difference of passengers’ comfort among all the bus lines by optimizing bus frequencies. The lower level model is a multi-modal transport network equilibrium model for the joint modal split/traffic assignment problem. The column generation algorithm, the branch-and-bound algorithm and the method of successive averages are comprehensively applied in this paper for the solution of the bi-level model. A simple numerical test and an empirical test based on Dalian economic zone are employed to validate the proposed model. The results show that the bi-level model performs well with regard to the objective of reducing travel time costs for all travelers and balancing transit service level among all bus lines.     

Optimal distance- and time-dependent area-based pricing with the Network Fundamental Diagram

Given the efficiency and equity concerns of a cordon toll, this paper proposes a few alternative distance-dependent area-based pricing models for a large-scale dynamic traffic network. We use the Network Fundamental Diagram (NFD) to monitor the network traffic state over time and consider different trip lengths in the toll calculation. The first model is a distance toll that is linearly related to the distance traveled within the cordon. The second model is an improved joint distance and time toll (JDTT) whereby users are charged jointly in proportion to the distance traveled and time spent within the cordon. The third model is a further improved joint distance and delay toll (JDDT) which replaces the time toll in the JDTT with a delay toll component. To solve the optimal toll level problem, we develop a simulation-based optimization (SBO) framework. Specifically, we propose a simultaneous approach and a sequential approach, respectively, based on the proportional-integral (PI) feedback controller to iteratively adjust the JDTT and JDDT, and use a calibrated large-scale simulation-based dynamic traffic assignment (DTA) model of Melbourne, Australia to evaluate the network performance under different pricing scenarios. While the framework is developed for static pricing, we show that it can be easily extended to solve time-dependent pricing by using multiple PI controllers. Results show that although the distance toll keeps the network from entering the congested regime of the NFD, it naturally drives users into the shortest paths within the cordon resulting in an uneven distribution of congestion. This is reflected by a large clockwise hysteresis loop in the NFD. In contrast, both the JDTT and JDDT reduce the size of the hysteresis loop while achieving the same control objective. We further conduct multiple simulation runs with different random seed numbers to demonstrate the effectiveness of different pricing models against simulation stochasticity. However, we postulate that the feedback control is not applicable with guaranteed convergence if the periphery of the cordon area becomes highly congested or gridlocked.     

A predictive dynamic traffic assignment model in congested capacity-constrained road networks

In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.     

An augmented Lagrangian origin‐based algorithm for link‐capacitated traffic assignment problem

The origin‐based algorithm is embedded into the augmented Lagrangian method for the link‐capacitated traffic assignment problem. In order to solve the “nonexistence” problem due to the second partial derivatives of the augmented Lagrangian function at some specific points, the approximate expressions of the second partial derivatives are amended in the origin‐based algorithm. The graph of last common nodes is developed on the basis of the restricted single‐origin network. A method is proposed for finding n–1 last common nodes of the restricted single‐origin network, resulting in computational complexity of O(n²) in finding last common nodes. Numerical analysis on the Sioux Falls network and Chicago Sketch network demonstrated the effectiveness and characteristics of the proposed algorithm. Copyright © 2014 John Wiley & Sons, Ltd.     

基于分布式计算机的智能相机在城市交通中的研究与应用

我国逐步开始将城市建设与互联网技术进行高度融合以打造智能城市。智能城市建设过程中,智能交通是重要一环,当前我国交通视频监控系统普遍是通过道路两旁的摄像头拍摄获得路况图像信息,这种方式虽然是解决了一些问题,但是不能满足智能城市的建设需求。本文总结和研究了分布式智能相机的一些关键技术,得出嵌入式设备高效率、低耗能的优点使其在交通监控领域得到了越来越广泛的应用,基于分布式计算机设计了智能相机的分布式智能城市交通系统,提出了一系列有益于提升系统运行的具有应用前景的算法,用来解决使用重叠视野进行跟踪和稀疏相机网络中的有效跟踪。     

Optimization method of alternate traffic restriction scheme based on elastic demand and mode choice behavior

As a countermeasure to urban traffic congestion, alternate traffic restriction (ATR) involves a certain proportion of automobiles being prohibited from entering pre-determined ATR districts during specific time periods. The present study introduces an optimization method for ATR schemes in terms of both their restriction districts and the proportion of restricted automobiles. As a Stackelberg game between traffic policy makers and road users, the ATR scheme optimization problem is established using a bi-level programming model, with the upper-level examining an ATR scheme aimed at consumers’ surplus maximization under the condition of overload flow minimization, and the lower-level synthetically optimizing elastic demand, mode choice (private car, public transit and park-and-ride) and multi-class user equilibrium assignment. A genetic algorithm based on the graph theory is also proposed to solve the bi-level programming model with a gradient project algorithm for solving the lower-level model. To our knowledge, this study represents the first attempt to theoretically optimize an ATR scheme using a systematic approach with mathematical model specification.     

Pricing local emission exposure of road traffic: An agent-based approach

This paper proposes a new approach to iteratively calculate local air pollution exposure tolls in large-scale urban settings by taking the exposure times and locations of individuals into consideration. It explicitly avoids detailed air pollution concentration calculations and is therefore characterized by little data requirements, reasonable computation times for iterative calculations, and open-source compatibility. In a first step, the paper shows how to derive time-dependent vehicle-specific exposure tolls in an agent-based model. It closes the circle from the polluting entity, to the receiving entity, to damage costs, to tolls, and back to the behavioral change of the polluting entity. In a second step, the approach is applied to a large-scale real-world scenario of the Munich metropolitan area in Germany. Changes in emission levels, exposure costs, and user benefits are calculated. These figures are compared to a flat emission toll, and to a regulatory measure (a speed reduction in the inner city), respectively. The results indicate that the flat emission toll reduces overall emissions more significantly than the exposure toll, but its exposure cost reductions are rather small. For the exposure toll, overall emissions increase for freight traffic which implies a potential conflict between pricing schemes to optimize local emission exposure and others to abate climate change. Regarding the mitigation of exposure costs caused by urban travelers, the regulatory measure is found to be an effective strategy, but it implies losses in user benefits.     

Multi-objective optimization of train routing problem combined with train scheduling on a high-speed railway network

Based on train scheduling, this paper puts forward a multi-objective optimization model for train routing on high-speed railway network, which can offer an important reference for train plan to provide a better service. The model does not only consider the average travel time of trains, but also take the energy consumption and the user satisfaction into account. Based on this model, an improved GA is designed to solve the train routing problem. The simulation results demonstrate that the accurate algorithm is suitable for a small-scale network, while the improved genetic algorithm based on train control (GATC) applies to a large-scale network. Finally, a sensitivity analysis of the parameters is performed to obtain the ideal parameters; a perturbation analysis shows that the proposed method can quickly handle the train disturbance.     

Optimal timetable development for community shuttle network with metro stations

This paper investigates an issue for optimizing synchronized timetable for community shuttles linked with metro service. Considering a passenger arrival distribution, the problem is formulated to optimize timetables for multiple community shuttle routes, with the objective of minimizing passenger’s schedule delay cost and transfer cost. Two constraints, i.e., vehicle capacity and fleet size, are modeled in this paper. The first constraint is treated as soft, and the latter one is handled by a proposed timetable generating method. Two algorithms are employed to solve the problem, i.e., a genetic algorithm (GA) and a Frank–Wolfe algorithm combined with a heuristic algorithm of shifting departure times (FW-SDT). FW-SDT is an algorithm specially designed for this problem. The simulated and real-life examples confirm the feasibility of the two algorithms, and demonstrate that FW-SDT outperforms GA in both accuracy and effectiveness.