MINIMUM COST SCHEDULES FOR A PUBLIC TRANSPORTATION ROUTE

A FLEET OF VEHICLES CARRIES PASSENGERS IN ONE DIRECTION ON A PUBLIC TRANSPORTATION ROUTE, THEN RETURNS TO THE DISPATCH POINT AFTER A TRAVEL TIME T. THE ARRIVAL RATE OF PASSENGERS IS A KNOWN DETERMINISTIC FUNCTION OF TIME AND THE OBJECTIVE IS TO DEVISE A SCHEDULE THAT MINIMIZES THE TOTAL COST FOR PASSENGER WAITING TIME AND VEHICLE OPERATIONS. TO MAKE A MATHEMATICAL ANALYSIS, THE ENTIRE PROBLEM IS RESTATED IN TERMS OF A CONTINUUM, OR FLUID FLOW, MODEL AND A THEORETICAL SOLUTION TO THE OPTIMAL SCHEDULE IS ATTEMPTED. PRINCIPLES DERIVED ARE APPLIED TO A NUMBER OF HYPOTHETICAL EXAMPLES AND A PROCEDURE IS GIVEN FOR CONSTRUCTING SUBOPTIMAL SCHEDULES IN CASES WHERE IT IS DIFFICULT TO CONSTRUCT THE OPTIMAL SCHEDULE. /AUTHOR/

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Authors:
  • Hurdle, V F
• Publication Date: 1973-5

Media Info

• Pagination: p. 109-57
• Serial:
  • Transportation Science
  • Volume: 7
  • Issue Number: 2
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Costs; Dispatching; Mathematical analysis; Passengers; Public transit; Scheduling
• Subject Areas: Economics; Finance; Highways; Passenger Transportation; Public Transportation; Society;

Filing Info

• Accession Number: 00202370
• Record Type: Publication
• Files: TRIS
• Created Date: Oct 16 1982 12:00AM