A LAGRANGIAN RELAXATION BASED HEURISTIC FOR THE URBAN TRANSIT CREW SCHEDULING PROBLEM. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING

Several researchers have approached the transit crew scheduling problem by decomposing it into a shortest path problem and a matching problem. We present an approach based on this decomposition which iterates between the solution of a shortest path problem and the solution of a matching problem. The objective function for the shortest path problem is derived by considering Lagrangian penalties associated with the perfectly matchable subgraph inequalities. This approach is validated on sample problems from the Washington Metropolitan Area Transit Authority (WMATA).

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/038719441X
• Supplemental Notes:
  • Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, July 28-31, 1987.
• Corporate Authors:

  Springer Verlag

  175 5th Avenue
  New York, NY  United States  10010
• Authors:
  • Ball, M O
  • Benoit-Thompson, H
• Publication Date: 1988

Media Info

• Features: Tables;
• Pagination: p. 54-67
• Monograph Title: Computer-Aided Transit Scheduling. Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, July 28-31, 1987

Subject/Index Terms

• TRT Terms: Buses; Computers; Lagrangian functions; Mathematical models; Scheduling
• Identifier Terms: Washington Metropolitan Area Transit Authority
• Uncontrolled Terms: Computer aided scheduling
• Subject Areas: Operations and Traffic Management; Public Transportation;

Filing Info

• Accession Number: 00484139
• Record Type: Publication
• ISBN: 038719441X
• Files: TRIS
• Created Date: May 31 1989 12:00AM