Turning restriction design in traffic networks with a budget constraint

摘要

The restriction (prohibition) of certain turns at intersections is a very common task employed by the managers of urban traffic networks. Surprisingly, this approach has received little attention in the research literature. The turning restriction design problem (TRDP) involves finding a set of turning restrictions at intersections to promote flow in a congested urban traffic network. This article uses a successive linear approximation (SLA) method for identifying approximate solutions to a nonlinear model of the TRDP. It aims to adjust the current turning restriction regime in a given network in order to minimize total user travel cost when route choice is driven by user equilibrium principles. Novel features of the method include the facts that it is based on link capacity-based arc travel costs and there is a budget constraint on the total cost of all turning restriction alterations. It has been tested using standard network examples from the literature. One of the tests utilized a multi-start approach which improved the solutions produced by the SLA method. The method was also employed to identify turning restrictions for an actual medium-sized urban traffic network in Brazil. Computational experience with the proposed method is promising.