A turning restriction design problem in urban road networks

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.

[1]  Shlomo Bekhor,et al.  Evaluation of choice set generation algorithms for route choice models , 2006, Ann. Oper. Res..

[2]  Douglas W Harwood,et al.  Design policies for sight distance at stop-controlled intersections based on gap acceptance , 1997 .

[3]  Jiang Qian Ying,et al.  An algorithm for local continuous optimization of traffic signals , 2007, Eur. J. Oper. Res..

[4]  Ziyou Gao,et al.  A globally convergent algorithm for transportation continuous network design problem , 2007 .

[5]  Michael G.H. Bell,et al.  Genetic algorithm solution for the stochastic equilibrium transportation networks under congestion , 2005 .

[6]  Michael Patriksson,et al.  Sensitivity Analysis of Traffic Equilibria , 2004, Transp. Sci..

[7]  Sangjin Han,et al.  A Route-Based Solution Algorithm for Dynamic User Equilibrium Assignments , 2007 .

[8]  Anthony Chen,et al.  Computational study of state-of-the-art path-based traffic assignment algorithms , 2002, Math. Comput. Simul..

[9]  Hossain Poorzahedy,et al.  Hybrid meta-heuristic algorithms for solving network design problem , 2007, Eur. J. Oper. Res..

[10]  T Troutbeck,et al.  LIMITED PRIORITY MERGE AT UNSIGNALIZED INTERSECTIONS , 1997 .

[11]  M. Bell.  Alternatives to Dial's logit assignment algorithm , 1995 .

[12]  Henry X. Liu,et al.  Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem , 2009 .

[13]  A. Alfa,et al.  Algorithms for solving fisk's stochastic traffic assignment model , 1991 .

[14]  Ziyou Gao,et al.  Two-way road network design problem with variable lanes , 2007 .

[15]  Chao Yang,et al.  Sensitivity analysis of the combined travel demand model with applications , 2009, Eur. J. Oper. Res..

[16]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[17]  Hai-Jun Huang.  A Combined Algorithm for Solving and Calibrating the Stochastic Traffic Assignment Model , 1995 .

[19]  Hai Yang,et al.  Sensitivity Analysis of Stochastic User Equilibrium Flows in a Bi-Modal Network with Application to Optimal Pricing , 2005 .

[20]  Attahiru Sule Alfa,et al.  A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach , 1991, Transp. Sci..

[21]  Mike Maher,et al.  Algorithms for logit-based stochastic user equilibrium assignment , 1998 .

[22]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[23]  Hashim M. N. Al-Madani,et al.  Dynamic vehicular delay comparison between a police-controlled roundabout and a traffic signal , 2003 .

[24]  Mariano Gallo,et al.  A meta-heuristic approach for solving the Urban Network Design Problem , 2010, Eur. J. Oper. Res..

[25]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[26]  Warren B. Powell,et al.  An algorithm for the equilibrium assignment problem with random link times , 1982, Networks.

[27]  Zvi Drezner,et al.  NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION , 2003 .

[28]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[29]  Yafeng Yin,et al.  Production , Manufacturing and Logistics Robust improvement schemes for road networks under demand uncertainty , 2009 .

[30]  Song Yifan,et al.  A reserve capacity model of optimal signal control with user-equilibrium route choice , 2002 .

[31]  S. Bekhor,et al.  Investigating path-based solution algorithms to the stochastic user equilibrium problem , 2005 .

[32]  W. Y. Szeto,et al.  Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks , 2012 .

[33]  Joseph A. C. Delaney.  Sensitivity analysis , 2018, The African Continental Free Trade Area: Economic and Distributional Effects.

[34]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[35]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[36]  Alan J. Horowitz.  Intersection Delay in Regionwide Traffic Assignment: Implications of 1994 Update of the Highway Capacity Manual , 1997 .

[37]  Ernesto Cipriani,et al.  Combined signal setting design and traffic assignment problem , 2004, Eur. J. Oper. Res..

[38]  Jonathan F. Bard,et al.  An algorithm for the mixed-integer nonlinear bilevel programming problem , 1992, Ann. Oper. Res..