Analysis of Strategies to Improve Traffic Conditions in the Ancient Urban Area of Suzhou

In this paper, the authors first analyse the problems existing in the situation of land use, structure of travel mode and road network by applying the basic principle of traffic engineering and system engineering methods. Then, the authors make it clear the strategies to be adopted for solving the existing traffic problems in the ancient urban area of Suzhou(AUAS), namely insisting on the goal based strategy; the strategy to develop the public transit system in priority and decreasing the demand on cars from the view point of land use strategy. On the basis of such analysis the authors put forth proposals about major measures to be taken to improve traffic conditions of the AUAS, such as construction of express artery ring around the ancient city, appropriate transformation of the roads in the AUAS and rational distribution of car parking areas at the outskirt, which are of positive significance in guiding the protection of the AUAS and transportation construction. In this paper, specialized software is used to establish criteria for the construction scale and extent analysis and evaluation of the ancient city construction project, which is of some reference significance to the transformation of old urban areas in other cities.

Behaviours in a dynamical model of traffic assignment with elastic demand

This paper investigates the dynamical behaviour of network traffic flow. Assume that trip rates may be influenced by the level of service on the network and travellers are willing to take a faster route. A discrete dynamical model for the day-to-day adjustment process of route choice is presented. The model is then applied to a simple network for analysing the day-to-day behaviours of network flow. It finds that equilibrium is arrived if network flow consists of travellers not very sensitive to the differences of travel cost. Oscillations and chaos of network traffic flow are also found when travellers are sensitive to the travel cost and travel demand in a simple network.

EXISTENCE OF STRONGLY VALID TOLLS FOR MULTICLASS NETWORK EQUILIBRIUM PROBLEMS

In this article, we consider the multiclass network equilibrium problems. A so called strongly valid toll can support any multiclass user equilibrium flow pattern as a system minimum when the system objective function is measured by total emission. Using Hoffman lemma and exact penalization method, we provide the existence of strongly valid tolls for multiclass network equilibrium problems.

Risk-taking path choice behaviors under ATIS in transportation networks with demand uncertainty

A new travel time reliability-based traffic assignment model is proposed to investigate the effects of an advanced transportation information system (ATIS) on drivers' risk-taking path choice behaviours in transportation networks with demand uncertainty. In the model, drivers are divided into two classes. The first class is not equipped with ATIS, while the second class is equipped with ATIS. Different risk-taking path choice behaviours of the two classes are studied, respectively. A corresponding mixed equilibrium traffic assignment model is formulated as a variational inequality problem in terms of path flows, which is solved by a heuristic solution algorithm. Numerical results indicate that the ATIS can influence the drivers' risk-taking path choice behaviours and the total system travel time in transportation networks with demand uncertainty. It is also found that under higher demand levels, the benefits of ATIS for network performance enhancement may be more obvious.

An ADMM-based parallel algorithm for solving traffic assignment problem with elastic demand

Efficiently solving the user equilibrium traffic assignment problem with elastic demand(UE-TAPED)for transportation networks is a critical problem for transportation studies.Most existing UE-TAPED algorithms are designed using a sequential computing scheme,which cannot take advantage of advanced parallel computing power.Therefore,this study focuses on model decomposition and parallelization,proposing an origin-based formulation for UE-TAPED and proving an equivalent reformulation of the original problem.Furthermore,the alternative direction method of multipliers(ADMM)is employed to decompose the original problem into independent link-based subproblems,which can solve large-scale problems with small storage space.In addition,to enhance the efficiency of our algorithm,the parallel computing technology with optimal parallel computing schedule is implemented to solve the link-based subproblems.Numerical experiments are performed to validate the computation efficiency of the proposed parallel algorithm.

A complementary formulation for traffic equilibrium problem with a new nonadditive route cost

Improviag transportation system is essential for all people in each city since transport plays a very important role. Using mathematical programming approach transport problem is an effective way to improve transportation system. In this paper, the traffic equilibrium problem （TEP） with a general nonadditive route cost function is studied. We formulate the route cost function for each route as a disutility function, which can evaluate route cost function flexibly and analyze the route toll conveniently. Furthermore, we present the TEP with a nonlinear complementary problem （NCP） formulation. The monotonicity and the existence with the NCP formulation are also given under relative assumptions.

An LQP-Based Two-Step Method for Structured Variational Inequalities

t The logarithmic quadratic proximal(LQP)regularization is a popular and powerful proximal regularization technique for solving monotone variational inequalities with nonnegative constraints.In this paper,we propose an implementable two-step method for solving structured variational inequality problems by combining LQP regularization and projection method.The proposed algorithm consists of two parts.The first step generates a pair of predictors via inexactly solving a system of nonlinear equations.Then,the second step updates the iterate via a simple correction step.We establish the global convergence of the new method under mild assumptions.To improve the numerical performance of our new method,we further present a self-adaptive version and implement it to solve a traffic equilibrium problem.The numerical results further demonstrate the efficiency of the proposed method.