ROUTING ALGORITHMS FOR URBAN RAPID TRANSIT

A basic routing algorithm is presented for finding optimal routes for cars in a rapid transit system. The algorithm uses predicted path cost, depth-first search, and threshold acceptance to minimize computation cost. It is applicable to synchronous, cycle-synchronous, and trans-synchronous control strategies, and will minimize either departure time, transit time, or arrival time as may be needed. Extensions of the algorithm to allow finding empty cars to answer service requests, to dynamically reroute cars in the system, and to handle multistation routes are presented. (A) /TRRL/

• Corporate Authors:

  Pergamon Press, Incorporated

  Maxwell House, Fairview Park
  Elmsford, NY  United States  10523
• Authors:
  • RUBIN, F
• Publication Date: 1975-8

Language

• English

Media Info

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

Subject/Index Terms

• TRT Terms: Algorithms; Automatic control; Computer programming languages; Digital computers; Dual mode vehicles; Itinerary; Mathematical models; Network analysis; Optimization; Personal rapid transit; Rapid transit; Routing; Scheduling; Simulation; Time; Travel time; Urban areas
• Uncontrolled Terms: Optimum
• Old TRIS Terms: Operating strategies
• ITRD Terms: 1020: Container (freight); 8673: Digital computer; 1280: Dual mode vehicle; 6473: Mathematical model; 1181: Rapid transit system; 8618: Simulation language; 5414: Time; 313: Urban area
• Subject Areas: Highways; Operations and Traffic Management; Planning and Forecasting; Public Transportation; Railroads; I71: Traffic Theory; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00134067
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: ITRD, TRIS
• Created Date: Aug 23 1982 12:00AM