SCHOOL BUS ROUTING BY COMPUTER

A PROCEDURE IS DESCRIBED FOR THE DESIGNING OF SCHOOL BUS ROUTES BY COMPUTER. THE PROCEDURE IS MORE FLEXIBLE THAN PREVIOUSLY PUBLISHED ONES IN A NUMBER OF WAYS. THE OBJECTIVE FUNCTION INCLUDES THE REDUCTION OF STUDENT TRAVEL TIME, U-TURNS, AND BUS OVERLOADING, AS WELL AS THE REDUCTION OF BUS TRAVEL TIME. THE PROCEDURE CAN ALSO HANDLE ONE-WAY STREETS, A BUS GARAGE OTHER THAN AT THE SCHOOL SITE AND THE REQUIREMENT THAT AT CERTAIN STOPS THE BUS MUST PICK UP CHILDREN FROM ONE PARTICULAR SIDE OF THE ROAD. THE PROCEDURE IS AN EXTENSION OF THE CLARKE AND WRIGHT ALGORITHM FOR SCHEDULING DELIVERY VEHICLES. /TRRL/

• Authors:
  • Bennett, B T
  • Gazis, D C
• Publication Date: 1972-12

Language

• English

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 17-25
• Serial:
  • Transportation Research /UK/
  • Volume: 6
  • Issue Number: 4
  • Publisher: Pergamon Press, Incorporated

Subject/Index Terms

• TRT Terms: Algorithms; Garages; Information processing; Oversize loads; Route choice; School buses; Travel time; U turns
• Uncontrolled Terms: Overloads
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00226976
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: TRIS
• Created Date: Jan 11 1974 12:00AM