Conflicting transit signal priority (TSP) requests can significantly influence the efficiency of TSP. Determining the best serve sequence for TSP requests is important for both the transit and other vehicles. The majority of previous studies focused on resolving conflicting TSP requests at the intersection level. For urban arterials, few studies take coordination into consideration, so the benefits of TSP may be lost due to the lack of progression. In view of this, this paper proposes a bi-level optimization model to resolve the problem of conflicting TSP requests at arterial corridors. The upper level of the model is progression control and the lower level is intersection control. At the progression control level, by considering the characteristics of bus operation, this paper proposes a signal coordination method that generates a green band between the two adjacent bus stops (stop-to-stop). At the intersection control level, a linear programming model is developed to resolve conflicting TSP requests. Then, this paper uses a hybrid genetic algorithm to solve the proposed model. Finally, an arterial with seven intersections in Nanjing, China, is selected to evaluate the performance of the proposed model. Three other models (the baseline model without TSP, Model 1 with the regular TSP and the classical coordination, and Model 2 with the lower model and the classical coordination) are also utilized to conduct the comparison analysis. The results show the proposed model can significantly reduce the bus passenger delay and stops compared to the three other models and meanwhile the operation of other vehicles will not turn worse.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Bi-Level Model to Resolve Conflicting Transit Priority Requests at Urban Arterials


    Contributors:
    Xu, Mingtao (author) / An, Kun (author) / Ye, Zhirui (author) / Wang, Yuan (author) / Feng, Jiaxiao (author) / Zhao, Jiahui (author)


    Publication date :

    2019-04-01


    Size :

    3801121 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English