FEASIBILITY OF A COMPLIMENTARY SOLUTION TO THE BUS OPERATOR SCHEDULING PROBLEM

The report is concerned primarily with computerized run-cutting. Run-cutting in the bus industry deals with the problem of assigning operators or drivers to work the vehicle schedules. The objective of run-cutting is to create cost effective bus driver assignments, known as runs or duties, to work or cover a predefined schedule of bus service. This report deals specifically with run-cutting in the bus industry, and it builds on and synthesizes experiences already gained in this field. Driver duties vary in type. One characteristic which defines a duty-type is the time of day it begins and completes it assigned work. Basic methodology is outlined in the report, and the results from experiments are collated and reported when the methodology was applied to three real-life data sets acquired from three different bus properties. The goal of this study is to provide added insight into the methods of using computer based algorithms to solve the original problem, which is the creation and selection of duties to cover the full day schedule of bus service.

• Corporate Authors:

  West Virginia University, Morgantown

  Department of Industrial and Management Systems Engineering
  Morgantown, WV  United States  26506

  Urban Mass Transportation Administration

  400 7th Street, SW
  Washington, DC  United States  20590
• Authors:
  • Ward, R E
  • Durant, P A
• Publication Date: 1979-12

Media Info

• Pagination: 107 p.

Subject/Index Terms

• TRT Terms: Algorithms; Bus drivers; Buses; Computer programming; Computer programs; Cost effectiveness; Drivers; Feasibility analysis; Scheduling; Transportation planning
• Subject Areas: Highways; Planning and Forecasting; Public Transportation;

Filing Info

• Accession Number: 00313124
• Record Type: Publication
• Source Agency: National Technical Information Service
• Report/Paper Numbers: 795620R001REW Final Rpt., UMTA-WV-11-0001-80-1
• Files: NTIS, TRIS, USDOT
• Created Date: May 7 1980 12:00AM