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.
For railway transportation networks that serve traffic demands for many origin–destination pairs and consist of many railway lines that provide passengers with different choices, this paper proposes a mathematical programming model for optimizing the assignment of tickets among the sections of railway lines. The purpose of the model is to maximize the total passenger turnover or the total number of transported passengers within the capacity constraints of vehicles. A typical numerical example, solved using the linear interactive and general optimizer solver, has been designed to illustrate the proposed model. In addition, the ticket assignment schemes based on different goals are compared.
30 December 2018 in International Journal of Modern Physics B