Lane-based Method Research Articles

Autonomous Intersection Management for Connected and Automated Vehicles: A Lane-Based Method

Most existing studies on autonomous intersection management (AIM) often focus on algorithms to accommodate conflicts among vehicles by assuming that the entrance lane and the exit lane of vehicles are exogenous inputs. This paper shows that allowing entrance lanes and exit lanes to be optimized can significantly improve traffic efficiency. In particular, this paper proposes “all-direction” lanes, where left-turn, through, and right-turn traffic is all allowed at the same lane. We develop two methods for optimizing entering time (i.e., when to enter the intersection) and route choice decisions (i.e., entrance lane and exit lane), including the sliding-time-window-based global optimum (GO-STW) and the first-come-first-served method with optimal route choices (FCFS-R). The developed lane-based methods can be formulated as mixed integer linear programming (MILP) problems, which can be solved using the CPLEX solver. A heuristic is further adopted to solve the MILP model in a timely manner, which illustrates the potential real-time applicability of the proposed method. Numerical analysis is conducted to examine performance and effectiveness of the proposed methods and heuristic. We found that the optimization of lane/route choices is often more critical than entering time.

Exit lane allocation with the lane-based signal optimization method at isolated intersections

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.

Optimization of signalized network configurations using the Lane-based method.

Vehicle movements at signalized intersections should follow the guidance of lane marking arrows. Turns are permitted or banned depending on the existence of lane marking arrows establishing network link connectivity. Lane markings are the interface that joins consecutive upstream and downstream intersections. Traffic flows from origins to destinations across intersections should be governed by lane markings. In this study, conventionally fixed lane markings are relaxed as binary variables to be optimized by maximizing the green bandwidths. The proposed methodology is innovative in that it extends the lane-based design framework to incorporate green band maximization for enhancing traffic signal coordination. Path flows are controlled to satisfy flow conservations and to compile turning flows at intersections. With these turning flows as inputs, lane markings can be optimized together with the coordinated traffic signal settings. Path flows, path travel times, and path choices are evaluated through new linear constraints. For path travel times, cruise times along lanes and total delays at the ends of lanes are evaluated. The non-linear total delays are approximated by the proposed linearized delay function. The model coefficients are calibrated by network data as in a previous study. The problem is formulated as a binary-mixed-integer-linear-program and solved by standard branch-and-bound techniques using a CPLEX solver. To avoid non-linearity in the problem formulation, the bandwidth maximization approach is adopted instead of minimizing the total network delay in the design of the signalized network. A network with four intersections is provided to demonstrate how optimized lane markings can create efficient network link configurations. The numerical results are promising compared with those obtained in previous studies and show that the overall network performance can be improved.

Lane-based signal optimization with left turn prohibition in urban road networks

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.

An Improved Optimization Method for Isolated Signalized Intersection Based on the Temporal and Spatial Resources Integration

Recent studies indicate that the optimization design methods for the isolated signalized intersection, which integrate the temporal and spatial resources, can achieve more effective optimal design relatively. This paper presents extension work to further improve the lane-based method from two aspects of integrating temporal and spatial resources. One is adjusting existing constraints to reserve some conflict movements. The other is adding a constraint to reflect the adverse effects caused by the limitation of short lane. The lane markings and signal settings are taken as binary-type control variables to form BMILP formulas solved by Lingo. The East Beijing Rd and Danfeng St intersection in Nanjing, China is taken as an example. Optimization and simulation results indicate that the new method can obtain better operation performance than the lane-based method, and it is able to reflect the practical operational performance of the intersection which is influenced by short lane within limited length.

Lane-Based Breakdown Identification at Diverge Sections for Breakdown Probability Modeling

When the breakdown probability on expressways is being modeled, the identification of breakdowns is a decisive issue. To date, most identification methods have treated all lanes of the main line as one unit; these methods have been conducted mainly by checking the aggregated data of the cross section. However, this cross section–based method oversimplifies breakdown identification for expressway facilities, such as diverge sections, on which preferences for lane usage differ significantly. Therefore, a lane-based method is proposed to identify breakdowns in each lane; the timing of the breakdown is determined by a critical speed, which is optimized by obtaining the most significant speed reductions that accompany the breakdown. The proposed lane-based method is applied to four bottlenecks at diverge sections on intercity expressways in Japan. The superiorities of the lane-based method are as follows. First, the method can identify and exclude semicongested cases, in which some lanes are congested and others are not. At a diverge section of the Toyota junction in Japan, 15 semicongested cases were identified by the lane-based method from the 198 breakdowns identified by the cross section–based method. Second, the timing of a breakdown can be appropriately determined, as it was for 34 cases on this diverge section. These superiorities significantly improve the accuracy of extracted breakdown flow rates, which are underestimated by the existing cross section–based method. The breakdown probability is modeled with the lane-based method on the extracted breakdown flow rates, and the impacts of traffic condition characteristics are discussed. The diverge rate and the lane utilization rate are found to have significant impacts on the breakdown probability at diverge sections.