Optimal Adjustment Schemes on the Long Through-Type Bus Lines considering the Urban Rail Transit Network

2018 
It is of great importance to optimize the schemes of long through-type bus lines to adapt to the urban rail transit network. Focusing on the long through-type bus lines close to metro stations, a bilevel programming model on the adjustment schemes of bus lines is proposed, taking the impacts of urban rail transit network into account. The upper level model aims at adjusting the setting decisions of stop stations and vehicle headways of bus lines to minimize the passenger travel cost and maximize the benefits of bus operators. The lower level model is a passenger flow assignment model based on Logit-SUE considering the crowding perception of passengers in bus vehicles. Moreover, the constraint of average load factor of the bus line sections is considered. Then the genetic algorithm is applied to solve the proposed model, and a numerical example is conducted to verify the effectiveness. Results show that the value of the objective function of the model is improved by 27.2%, in comparison with the original scheme. Even though the average travel cost of passengers increases slightly, the bus line operation cost and the imbalance degree of load factors are reduced by 46.1% and 18.6%, respectively. The sensitivity analyses show that it is better to divide the long through-type bus line into several separate bus lines with independent operation, respectively, under the condition of unbalanced passenger flow distribution. Meanwhile, the multiple bus lines are more adapted to the unbalanced passenger flow distribution when the weight of the benefits of the bus operators in the total objective function is bigger. Besides, the lower time value that the passengers perceive, the more passengers willing to take bus than metro trains. As the increment of the passenger time value, the combination of feeder bus lines and a longer bus line is better for passengers’ trip demand than the long through-type bus line.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    16
    References
    1
    Citations
    NaN
    KQI
    []