Affordable Access

A turning restriction design problem in urban road networks

Authors
Disciplines
  • Computer Science
  • Design
  • Mathematics

Abstract

Turning restriction is one of the commonest traffic management techniques and an effective low cost traffic improvement strategy in urban road networks. However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of intersections where turning restrictions should be implemented. In this paper, a bi-level programming model is proposed to formulate the TRDP. The upper level problem is to minimize the total travel cost from the viewpoint of traffic managers, and the lower level problem is to depict travelers' route choice behavior based on stochastic user equilibrium (SUE) theory. We propose a branch and bound method (BBM), based on the sensitivity analysis algorithm (SAA), to find the optimal turning restriction strategy. A branch strategy and a bound strategy are applied to accelerate the solution process of the TRDP. The computational experiments give promising results, showing that the optimal turning restriction strategy can obviously reduce system congestion and are robust to the variations of both the dispersion parameter of the SUE problem and the level of demand.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

A turning restriction design problem in urban road...

on European Journal of Operationa... Jan 01, 2010

A bi-objective turning restriction design problem...

on European Journal of Operationa...

Optimizing reserve capacity of urban road networks...

on Advances in Engineering Softwa... Jan 01, 2011

An efficient dual approach to the urban road netwo...

on Computers & Mathematics with A... Jan 01, 1979
More articles like this..