A turning restriction design problem in urban road networks |
| |
Authors: | Jiancheng Long Ziyou Gao Haozhi Zhang W.Y. Szeto |
| |
Affiliation: | 1. School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing 100191, China;2. Institute of Systems Science, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China;3. China Urban Sustainable Transport Research Centre, China Academy of Transport Sciences, Beijing 100029, China;4. Department of Civil Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong |
| |
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. |
| |
Keywords: | Turning restriction design problem Bi-level programming Stochastic user equilibrium Sensitivity analysis Branch and bound method |
本文献已被 ScienceDirect 等数据库收录! |
|