01660388

Component

Servicing the school transportation demand safely with a minimum number of buses is one of the highest financial goals for school transportation directors. To achieve that objective, a good and efficient way to solve the routing and scheduling problem is required. Due to the growth of the computing power, the spotlight has been shed on solving the combined problem of the school bus routing and scheduling. Some recent attempts have tried to model the routing problem in a way that maximizes the trip compatibilities with the hope of requiring fewer buses. However, an over-counting problem associated with trip compatibility could diminish the performance of these models. An extended model is proposed in this paper to resolve this over-counting problem along with an iterative solution algorithm. The result shows better solutions for 8 test problems can be found with a fewer number of buses (up to 25%) and shorter travel time (up to 7% per trip).

This paper was sponsored by TRB committee ADB30 Standing Committee on Transportation Network Modeling.

18-02974

English

5p

2018

Transportation Research Board 97th Annual Meeting

Digital/other

Figures; References; Tables

Algorithms; Bus routes; Iterative methods; Routes and routing; School buses

Highways; Operations and Traffic Management; Planning and Forecasting

Transportation Research Board Annual Meeting 2018 Paper #18-02974

TRIS, TRB, ATRI

Jan 8 2018 10:42AM