Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance.     

Solving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.     

Modeling urban taxi services in road networks: Progress,problem and prospect

Traditionally, many economists have examined the models and economics of urban taxi services under various types of regulation such as entry restriction and price control in an aggregate way. Only recently have we modeled urban taxi services in a network context. A realistic method has been proposed to describe vacant and occupied taxi movements in a road network and taxi drivers' search behavior for customers. A few extensions have been made to deal with demand elasticity and congestion effects together with development of efficient solution algorithms. Calibration and validation of the network taxi service models have been conducted towards their practical applications. This paper presents an overview of the research that has been carried out by the authors to develop network equilibrium models and solution algorithms for urban taxi services, and offers perspectives for future researches.     

Selection of a trip table which reproduces observed link flows

In urban traffic management and planning, an important problem is estimating the number of drivers traveling between each origin-destination zone. We review a model due to Nguyen for estimating these numbers of drivers, based on counts of the traffic flows on each street, and develop an effective algorithm for solving it. The multiplicity of solutions of this model poses the additional question of which solution to use; we introduce a secondary optimization problem to overcome this difficulty. Efficient solution techniques are described for these problems and computational results are reported. It is noted that the most efficient solution methods involve user interaction to specify values of parameters which improve the convergence rates.     

我国大规模城市交通发展方略的研究

文章针对我国大规模城市交通发展中存在的主要问题,从国外大城市的交通发展经验及实际数据入手,分析存在问题的原因,提出了可行的解决方案,探讨了如何在我国大规模城市建立快速、高效和可持续发展的现代化城市交通系统的相关对策。     

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.     

Hierarchical network-based equilibrium model and algorithm for a mixed-traffic urban transport system

Abstract

Many equilibrium models and algorithms based on homogeneous motorized traffic have been devised to model urban transport systems in developed countries, but they are inadequate when it comes to represent mixed-traffic urban transport systems, including automobiles, transit, bicycles, and pedestrians, in developing countries such as China or India. In these cases, traffic flow on a road segment is an aggregated result of travellers' combined mode/route choices and corresponding interactions. Therefore, a special assignment model and algorithm are needed for modeling these distinct behaviors. In this article, the structure of a mixed-traffic urban transport system is analyzed and then expanded and represented using a hierarchical network model based on graph theory. Based on the analysis of travelers' combined mode/route choices, generalized travel cost functions and link impedance functions for different modes are formulated, where the interferences between different modes on the same road segments are taken into account. Due to the ‘asymmetric’ nature of these functions, a variational inequality model is proposed to represent the equilibrium assignment problem in a mixed-traffic urban transport system. The corresponding solution algorithm is also presented. Finally, a numerical example is provided to illustrate the practicality of the proposed model and algorithm.     

Solving train formation problem using simulated annealing algorithm in a simplex framework

The train formation plan (TFP) determines the train services and their frequencies and assigns the demands. The TFP models are often formulated as a capacitated service network design problem, and the optimal solution is normally difficult to find. In this paper, a hybrid algorithm of the Simplex method and simulated annealing is proposed for the TFP problem. The basic idea of the proposed algorithm is to use a simulated annealing algorithm to explore the solution space, where the revised Simplex method evaluates, selects, and implements the moves. In the proposed algorithm, the neighborhood structure is based on the pivoting rules of the Simplex method that provides an efficient method to reach the neighbors of the current solution. A state‐of‐the‐art method is applied for parameters tuning by using the design of experiments approach. To evaluate the proposed model and the solution method, 25 test problems have been simulated and solved. The results show the efficiency and the effectiveness of the proposed approach. The proposed approach is implemented to develop the TFP in the Iranian railway as a case study. It is possible to save significant time and cost through solving the TFP problem by using the proposed algorithm and developing the efficient TFP plan in the railway networks. Copyright © 2012 John Wiley & Sons, Ltd.     

Trade-offs between mobility and equity maximization under environmental capacity constraints: A case study of an integrated multi-objective model

This paper investigates the performance of a policy decision tool proposed for multi-objective decision under different policy interventions. This tool deals with the trade-off between mobility and equity maximization under environmental capacity constraints. Two system objectives, maximization of mobility and equity, are formulated in terms of the sum of total car ownership and number of trips, and the differences in accessibility between zones. Environmental capacities are based on production efficiency theory in which the frontier emission under maximum system efficiency is taken as environmental capacity. To examine the performance of the proposed model, three types of hypothetical policies (network improvement, population increase and urban sprawl) are formulated. Effects are simulated using data pertaining to Dalian City, China. Results show that the proposed model is capable of representing the trade-offs between mobility and equity based on different policy interventions. Compared with two extreme cases with the single objective of mobility maximization or equity maximization, the Pareto-optimal solutions provide more interesting practical options for decision makers. Taking the solution based on the maximum equity as an example, the policy of urban sprawl yields the most significant improvement in both emission and accessibility of the three scenarios.     

Hybrid simulated annealing and genetic algorithm for optimizing arterial signal timings under oversaturated traffic conditions

The implementation of system‐wide signal optimization models requires efficient solution algorithms that can quickly generate optimal or near‐optimal signal timings. This paper presents a hybrid algorithm based on simulated annealing (SA) and a genetic algorithm (GA) for arterial signal timing optimization. A decoding scheme is proposed that exploits our prior expectations about efficient solutions, namely, that the optimal green time distribution should reflect the proportion of the critical lane volumes of each phase. An SA algorithm, a GA algorithm and a hybrid SA‐GA algorithm are developed here using the proposed decoding scheme. These algorithms can be adapted to a wide range of signal optimization models and are especially suitable for those optimizing phase sequences with oversaturated intersections. To comparatively evaluate the performance of the proposed algorithms, we apply them to a signal optimization model for oversaturated arterial intersections based on an enhanced cell transmission model. The numerical results indicate that the SA‐GA algorithm outperforms both SA and GA in terms of solution quality and convergence rate. Copyright © 2014 John Wiley & Sons, Ltd.     

Studying the benefits of carpooling in an urban area using automatic vehicle identification data

Carpooling has been considered a solution for alleviating traffic congestion and reducing air pollution in cities. However, the quantification of the benefits of large-scale carpooling in urban areas remains a challenge due to insufficient travel trajectory data. In this study, a trajectory reconstruction method is proposed to capture vehicle trajectories based on citywide license plate recognition (LPR) data. Then, the prospects of large-scale carpooling in an urban area under two scenarios, namely, all vehicle travel demands under real-time carpooling condition and commuter vehicle travel demands under long-term carpooling condition, are evaluated by solving an integer programming model based on an updated longest common subsequence (LCS) algorithm. A maximum weight non-bipartite matching algorithm is introduced to find the optimal solution for the proposed model. Finally, road network trip volume reduction and travel speed improvement are estimated to measure the traffic benefits attributed to carpooling. This study is applied to a dataset that contains millions of LPR data recorded in Langfang, China for 1 week. Results demonstrate that under the real-time carpooling condition, the total trip volumes for different carpooling comfort levels decrease by 32–49%, and the peak-hour travel speeds on most road segments increase by 5–40%. The long-term carpooling relationship among commuter vehicles can reduce commuter trips by an average of 30% and 24% in the morning and evening peak hours, respectively, during workdays. This study shows the application potential and promotes the development of this vehicle travel mode.     

Equity-oriented skip-stopping schedule optimization in an oversaturated urban rail transit network

In this study, we focus on improving system-wide equity performance in an oversaturated urban rail transit network based on multi-commodity flow formulation. From the system perspective, an urban rail transit network is a distributed system, where a set of resources (i.e., train capacity) is shared by a number of users (i.e., passengers), and equitable individuals and groups should receive equal shares of resources. However, when oversaturation occurs in an urban rail transit network during peak hours, passengers waiting at different stations may receive varying shares of train capacity leading to the inequity problem under train all-stopping pattern. Train skip-stopping pattern is an effective operational approach, which holds back some passengers at stations and re-routes their journeys in the time dimension based on the available capacity of each train. In this study, the inequity problem in an oversaturated urban rail transit network is analyzed using a multi-commodity flow modeling framework. In detail, first, discretized states, corresponding to the number of missed trains for passengers, are constructed in a space-time-state three-dimensional network, so that the system-wide equity performance can be viewed as a distribution of all passengers in different states. Different from existing flow-based optimization models, we formulate individual passenger and train stopping pattern as commodity and network structure in the multi-commodity flow-modeling framework, respectively. Then, we aim to find an optimal commodity flow and well-designed network structure through the proposed multi-commodity flow model and simultaneously achieve the equitable distribution of all passengers and the optimal train skip-stopping pattern. To quickly solve the proposed model and find an optimal train skip-stopping pattern with preferable system-wide equity performance, the proposed linear programming model can be effectively decomposed to a least-cost sub-problem with positive arc costs for each individual passenger and a least-cost sub-problem with negative arc costs for each individual train under a Lagrangian relaxation framework. For application and implementation, the proposed train skip-stopping optimization model is applied to a simple case and a real-world case based on Batong Line in the Beijing Subway Network. The simple case demonstrates that our proposed Lagrangian relaxation framework can obtain the approximate optimal solution with a small-gap lower bound and a lot of computing time saved compared with CPLEX solver. The real-world case based on Batong Line in the Beijing Subway Network compares the equity and efficiency indices under the operational approach of train skip-stopping pattern with those under the train all-stopping pattern to state the advantage of the train skip-stopping operational approach.     

Capacity factor or cycle time optimization for signalized junctions: A graph theory approach

In this paper a method for setting traffic signals of individual signalized junctions is presented. Capacity factor maximization and cycle time minimization are considered as objective functions. The correspondence between cycle time and capacity factor is discussed. The influence of minimum green and maximum red constraints is analyzed. Once this correspondence is known, an efficient problem-oriented algorithm, based on a PERT-like technique, is proposed for the solution of the problem.     

Social and spatial effects of transforming the private vehicle fleet in Brisbane,Australia

Transformation of the motor vehicle fleet has been an important feature of the world’s peak car phenomenon. Very few urban transport studies have explored such important changes in large urban cities. Using an innovative green vehicle datasets constructed for 2009 and 2014, this paper investigates the ongoing change in urban private vehicle fleet efficiency (VFE) in Brisbane. The spatial patterns of VFE change were examined with social-spatial characteristics of the urban area. The results showed that the social and spatial effect of VFE changes remain uneven over urban space. The inner urban areas have experienced higher level of VFE change, whilst people in the outer and oil vulnerable areas showed a low tendency in shifting to more efficient vehicles. The implication of VFE change for future household vehicle adoption was also evaluated based on a cost-benefit analysis of new vehicle technology costs and expected fuel savings for households that choose a fuel efficient vehicle. The results show that imposing a stronger national fuel economy target in the long term would accelerate evolution of vehicle fleets and oil vulnerability reduction in Brisbane.     

A quantum evolutionary algorithm for the second-best congestion pricing problem in urban traffic networks

This paper investigates the congestion pricing problem in urban traffic networks. A first-best strategy, a second-best strategy for toll leveling in closed cordons and a second-best strategy for determining both toll levels and toll points are considered. The problem is known to be a mixed integer programming model and formulated as a bi-level optimization problem, with an objective of maximizing the social welfare. A method is presented to solve the problem, based on a novel metaheuristic algorithm, namely quantum evolutionary algorithm (QEA). To verify the proposed method, the widely used genetic algorithm (GA) is also applied to solve the problem. The problem is solved for a medium-size urban traffic network and the results of the QEA are compared against the conventional GA. Computational results show that the QEA outperforms the GA in solution quality.     

基于贝叶斯网络模型的交通状态预测

城市的交通状态是可以预测的。有效的交通状态预测能优化交通状态,减少交通阻塞。贝叶斯网络(Bayesian Networks,BN)是目前不确定知识和推理领域最有效的理论模型之一。文章在综合考虑交通阻塞成因的基础上构建网络模型,在已有的交通状态数据的基础上提出基于贝叶斯法则的学习算法,并通过计算变量间的条件概率来计算交通阻塞发生的可能性,达到预测的目的。     

Optimal bus service patterns and frequencies considering transfer demand elasticity with genetic algorithm

This paper attempts to optimize bus service patterns (i.e., all-stop, short-turn, and express) and frequencies which minimize total cost, considering transfer demand elasticity. A mathematical model is developed based on the objective total cost for a generalized bus route, which is optimized subject to a set of constraints ensuring sufficient capacity, an operable bus fleet, and service frequency conservation. To optimize the integrated service of a bus route with many stops, which is a combinatorial optimization problem, a genetic algorithm is developed and applied to search for the solution. A case study, based on a real-world bus route in New Jersey, is conducted to demonstrate the applicability and effectiveness of the developed model and the solution algorithm. Results show that the proposed methodology is fairly efficient, and the optimized bus service significantly reduces total cost.     

A bi‐level programming approach — Optimal transit fare under line capacity constraints

The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.     

Optimal deployment of emergency rescue stations in an urban transportation corridor

This paper addresses the deployment issue of emergency rescue stations in an urban transportation corridor, with an aim to effectively reduce the casualties in traffic accidents. On the basis of urban population density, an accident rate distribution function for a corridor is first presented and calibrated, and a damage cost function is proposed to capture the correlation between rescue time and deteriorating health condition of injured passengers. A continuum model is then developed for determining the optimal number and locations of the rescue stations along the corridor and the medical service resource distribution at rescue stations subject to a capital budget constraint. The solution properties of the proposed model are explored analytically. Numerical examples are provided to show the effects of population density, urban form and different deployment schemes (even and uneven) on the rescue station locations. A case study of Wuhan China is employed to illustrate the effectiveness of the proposed methodology in improving the performance of the emergency rescue system.

     

System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network

Thanks to its high dimensionality and a usually non-convex constraint set, system optimal dynamic traffic assignment remains one of the most challenging problems in transportation research. This paper identifies two fundamental properties of the problem and uses them to design an efficient solution procedure. We first show that the non-convexity of the problem can be circumvented by first solving a relaxed problem and then applying a traffic holding elimination procedure to obtain the solution(s) of the original problem. To efficiently solve the relaxed problem, we explore the relationship between the relaxed problems based on different traffic flow models (PQ, SQ, CTM) and a minimal cost flow (MCF) problem for a special space-expansion network. It is shown that all the four problem formulations produce the same minimal system cost and share one common solution which does not involve inside queues in the network. Efficient solution algorithms such as the network simplex method can be applied to solve the MCF problem and identify such an optimal traffic pattern. Numerical examples are also presented to demonstrate the efficiency of the proposed solution procedure.