When optimizing the signal timings of a network, a noticeable issue is to determine the intersections’ optimization orders. It is the list of order that all intersections will be optimized in sequence. Along with this, the determination of critical intersection of the network is an important problem as well. But the order and critical intersection is determined by users by experience, or by simple greedy-like method such as saturation degree sorting method, etc. The optimal signal timing plan generated by them may not be the true optimal plan. This paper addresses this issue by a new method to find the optimal optimization order and critical intersection which has been named Sorting Model of Optimization Order (SMOO). The intersection at first position of the optimization order list is defined as the critical intersection. Two cases are used to test this model. By experiments, SMOO computes more optimal order compared to other greedy sorting methods. The measures of effectiveness of signal plans from SMOO outperform the other methods’.
↧