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-integerlinear- 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.