A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles

In this paper, we describe a computerized procedure for scheduling mass transit crews and vehicles. The procedure differs from previous methods in that rather than first scheduling vehicles and then crews, it schedules vehicles and crews simultaneously. Several of the subproblems are solved as matching problems on graphs. A computational test of this procedure using a database from the Baltimore Metropolitan Transit Authority has produced solutions of lower cost than those used by the transit authority.

[1]  Lawrence Bodin,et al.  UCOST: A MICRO APPROACH TO A TRANSPORTATION PLANNING PROBLEM , 1978 .

[2]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[3]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[5]  Lawrence Bodin,et al.  EXPERIMENTATION WITH A COMPUTERIZED SYSTEM FOR SCHEDULING MASS TRANSIT VEHICLES AND CREWS. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[6]  P M Hildyard,et al.  ADVANCES IN COMPUTER-ASSISTED RUNCUTTING IN NORTH AMERICA. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[7]  Lawrence Bodin,et al.  THE STATE OF THE ART IN THE ROUTING AND SCHEDULING OF VEHICLES AND CREWS: EXECUTIVE SUMMARY , 1981 .

[8]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[9]  Ulrich Derigs,et al.  A shortest augmenting path method for solving minimal perfect matching problems , 1981, Networks.

[10]  Michael O. Ball,et al.  The design and analysis of heuristics , 1981, Networks.

[11]  Clifford S. Orloff,et al.  Route Constrained Fleet Scheduling , 1976 .

[12]  J W Schmidt,et al.  THE STATUS OF COMPUTER-AIDED SCHEDULING IN NORTH AMERICA , 1980 .

[13]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[14]  George L. Nemhauser,et al.  Optimal set partitioning, matchings and lagrangian duality , 1979 .

[15]  P A Durant,et al.  A PROBLEM DECOMPOSITION APPROACH TO SCHEDULING THE DRIVERS AND CREWS OF MASS TRANSIT SYSTEMS. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .