TRANSIT VEHICLE-TYPE SCHEDULING PROBLEM

This work addressed the problem of how to allocate vehicles efficiently for carrying out all of the trips in a given transit timetable, in which each vehicle is assigned a chain of trips, some of which may be deadhead (empty) trips. The methodology presented takes into account the association between the characteristics of each trip (urban, peripheral, intercity, etc.) and its required vehicle type. The problem is based on given sets of trips and vehicle types, in which the categories are arranged in decreasing order of vehicle cost. Therefore, each trip can be carried out by its vehicle type, or by other types listed in priority order. This problem can be formularized as a cost-flow network problem with a nonpolynomial-hard complexity level. Thus, a heuristic algorithm was developed in this work on the basis of the deficit function theory. A real-life example is presented at the end of the paper to assess the methodology's effectiveness.

Language

  • English

Media Info

  • Features: Figures; References;
  • Pagination: p. 34-38
  • Monograph Title: Public transportation 1995: current research in operations
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00715524
  • Record Type: Publication
  • ISBN: 0309061652
  • Files: TRIS, TRB
  • Created Date: Dec 29 1996 12:00AM