A NEW ITINERARY PLANNING MODEL FOR MULTI-MODAL AND FIXED-ROUTE TRANSIT NETWORK

This paper introduces a multi-objective linear programming model for transit itinerary planning (TIP) with multi-modal and fixed-route transit networks and presents an efficient two-phase TIP algorithm to find the optimal path that has the least combination cost from any origin to a given destination. The algorithm recognizes the inherent nature of multi-objective and time schedule constraint of TIP and considers trade-off among multiple optimization criteria in the path selection process. In particular, the algorithm of K shortest path problem with multi-time windows associated with time schedules is proposed in order to generate a set of path alternatives for evaluation. A prototype of Transit Itinerary Planning Decision Support System (TIPDSS) for assist passengers with itinerary decision making was developed and implemented in a Geographic Information System

• Supplemental Notes:
  • Publication Date: 2000 Transportation Research Board, Washington DC Remarks: Presentation at the 79th annual meeting of the Transportation Research Board, Washington, D.C., January 2000
• Corporate Authors:

  Texas Transportation Institute

  Texas A&M University System, 3135 TAMU
  College Station, TX  United States  77843-3135
• Authors:
  • Li, Qiang
  • Kurt, Carl E
  • LiXin, Miao
  • Lee, Joe
• Conference:
  • Transportation Research Board 79th Annual Meeting
  • Location: Washington D.C.
  • Date: 2000-1-9 to 2000-1-13
• Date: 2000

Language

• English

Media Info

• Pagination: 10 p.

Subject/Index Terms

• TRT Terms: Computer algorithms; Decision support systems; Geographic information systems; Public transit; Routing; Scheduling
• Subject Areas: Data and Information Technology; Public Transportation;

Filing Info

• Accession Number: 00788730
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Files: PATH
• Created Date: Mar 23 2000 12:00AM