Designing Vehicle Turning Restrictions Based on the Dual Graph Technique

Lihui Zhang,Hongsheng Qi,Dianhai Wang,Zhong Wang ,Jufeng Yang

doi:10.1155/2017/5839192

Abstract

This paper investigates the turning restriction design problem that optimizes the turning restriction locations so as to minimize the total system travel time under the assumption of asymmetric user equilibrium. We first transform a transportation network into a dual graph, where traffic turning movements are explicitly modeled as dual links. The dual transformation allows us to derive a link-based formulation for the turning restriction design problem. Asymmetric user equilibrium is incorporated in the model as a set of nonlinear constraints. A dual-based heuristic algorithm is employed to solve the problem, by sequentially solving a relaxed turning restriction design problem and a design updating problem.

Highlights

Heavy turning traffic can bring challenges to traffic control at road intersections and may even cause severe congestion at the network level if not treated properly
This paper investigates the turning restriction design problem (TRDP), to optimally select the locations to impose turning restrictions, so as to improve the overall network performance
Since the decision variables are discrete, the final formulation obtained is more similar to the discrete network design problem (DNDP)

Summary

Introduction

Heavy turning traffic can bring challenges to traffic control at road intersections and may even cause severe congestion at the network level if not treated properly. Since path information is needed in their modeling procedure to incorporate turning cost, they first applied a combination of the link elimination method [9] and Dial’s [10] STOCH method to generate a path set and employed the method of successive weighted averages [11] to solve the lower-level problem Their numerical test on Sioux Falls network shows that turning restriction can Mathematical Problems in Engineering b d e a c. Since the decision variables are discrete, the final formulation obtained is more similar to the discrete network design problem (DNDP) Another benefit of the dual transformation is that path information is not required to incorporate turning cost, which brings the possibility of applying link-based solution algorithms to solve the TRDP.

Network Representation

Formulation of the Turning Restriction Design Problem

Solving the Turning Restriction Design Problem

Numerical Test

Conflicts of Interest

Concluding Remarks