Research of Intersection Groups Optimization Control Method Based on Critical Path Identification

An optimal intersection groups control method based on critical path identification is proposed. The control algorithm uses a binary search to gradually determine the scope of the intersection groups, uses the duality method to express the intersection groups, uses breadth-first search algorithm to solve the critical path, and finally uses the branch-and-bound method to solve the lane canalization, realizes the optimized output of phase-sequence and timing of intersection control signals. The control algorithm is realized using C++ language, including the following functional modules: intersection range dynamic definition, critical path identification, space-time resource optimization, and online timing adjustment of signal timing parameters and so on. Finally, the control algorithm is verified by the actual road network of Changzhou City of China, the result shows that, the efficiency of traffic operation is significantly improved.