A Public Transit Driver Scheduling Problem with Practical Meal Time Windows

The public transit operators have to arrange the necessary meal time for drivers operating the vehicles (buses). In practice, the drivers have meal during a specific time window instead of any time slot assumed in the literature. Thus, this paper proposes a public transit driver scheduling problem with practical meal time windows (PTDSP-PMTW) by simultaneously taking the duty working rules into account. It proceeds to develop an integer linear programming model for the PTDSP-PMTW. A sequential heuristic method is also designed by decomposing a large-scale problem into two sub-problems. These two sub-problems are solved separately and combined afterwards. Finally, the case studies with various problem sizes, based on a real bus route, are carried out to demonstrate the effectiveness of proposed model and solution method. It can be seen that the proposed integer linear programming model can provide the optimal solutions for the small-size problems, while the heuristic method is able to find a better solution with the increase of problem size.

  • Supplemental Notes:
    • This paper was sponsored by TRB committee AP050 Standing Committee on Bus Transit Systems. Alternate title: Public Transit Driver Scheduling Problem with Practical Meal Time Windows
  • Corporate Authors:

    Transportation Research Board

    500 Fifth Street, NW
    Washington, DC  United States  20001
  • Authors:
    • Chen, Shukai
    • Xu, Min
    • Meng, Qiang
  • Conference:
  • Date: 2017

Language

  • English

Media Info

  • Media Type: Digital/other
  • Features: Figures; References; Tables;
  • Pagination: 15p
  • Monograph Title: TRB 96th Annual Meeting Compendium of Papers

Subject/Index Terms

Filing Info

  • Accession Number: 01626147
  • Record Type: Publication
  • Report/Paper Numbers: 17-02244
  • Files: TRIS, TRB, ATRI
  • Created Date: Feb 15 2017 5:03PM