Search

In signal optimization problems, incompatible movements are usually in either of two states: predecessor or successor. However, if the exit lane is well allocated, the incompatible movements merging at the same destination arm can exist in parallel. The corresponding longer green duration is expected to increase the capacity of intersections. This paper aims to solve the exit lane allocation problem with the lane-based method by applying the three states among incompatible movements at conventional signalized intersections. After introducing auxiliary variables, the problem is formulated as a mixed integer programming and can be solved using a standard branch-and-cut algorithm. In addition to the exit lane allocation results, this proposed method can also determine the cycle length, green duration, start of green, and signal sequence. The results show that the proposed method can obtain a higher capacity than that without the exit lane allocation. The pavement markings are further suggested for safety. [ABSTRACT FROM AUTHOR]

Left turns may generate efficiency problems, which can be solved by appropriately prohibiting left turns. The goal of this paper is to propose a method for purpose of minimizing total travel times in urban road networks by prohibiting left turns. With left turn prohibition, the signal timing plan is optimized with the lane-based method because the method can adequately handle both signal timing optimization and lane assignment. The total travel time is calculated with link flows and link travel time being estimated with signal settings. As illustrated by numerical examples, prohibiting left turns reduces the total travel time of car traffic in road networks. As the left turn prohibition results can handle the randomness in the network, these results provide potential implications for congestion management. [ABSTRACT FROM AUTHOR]

Urban road networks may benefit from left turn prohibition at signalized intersections regarding capacity, for particular traffic demand patterns. The objective of this paper is to propose a method for minimizing the total travel time by prohibiting left turns at intersections. With the flows obtained from the stochastic user equilibrium model, we were able to derive the stage generation, stage sequence, cycle length, and the green durations using a stage-based method which can handle the case that stages are sharing movements. The final output is a list of the prohibited left turns in the network and a new signal timing plan for every intersection. The optimal list of prohibited left turns was found using a genetic algorithm, and a combination of several algorithms was employed for the signal timing plan. The results show that left turn prohibition may lead to travel time reduction. Therefore, when designing a signal timing plan, left turn prohibition should be considered on a par with other left turn treatment options. [ABSTRACT FROM AUTHOR]

This paper analyzes the impact of road pricing for the bottleneck model with endogenous random delay. We extend the widely used scheduling model by integrating trip scheduling, endogenous traffic congestion, travel time variability (TTV), and road pricing into one modeling framework to analyze the role of road pricing in addressing TTV. This paper investigates the departure profiles and examines the social surplus under TTV and derives analytical results to illustrate properties of the model. It demonstrates the impact of road pricing and TTV on the departure profile of travelers and the system performance. For travelers, the presence of TTV leads to a smooth departure profile, hence a reduction in queuing cost. As for the system, TTV reduces the social surplus. This study shows that road pricing can be used to compensate or mitigate the social surplus loss due to TTV. [ABSTRACT FROM AUTHOR]