REVERSIBILITY OF THE TIME-DEPENDENT SHORTEST PATH PROBLEM

This paper addresses time-dependent shortest path problems. The author presents an algorithm which solves the forward quickest path problem on a network with first-in-first-out (FIFO) links. It is shown that this algorithm also solves the backward quickest path problem on the same network. In general terms, any algorithm that solves forward/backward problems of a particular type is shown also to solve backward/forward problems of a conjugate type.

• Record URL:
  http://www.uctc.net/papers/717.pdf
• 
• Supplemental Notes:
  • Publication Date: April 1998 Institute of Transportation Studies, University of California at Berkeley Berkeley CA
• Corporate Authors:

  University of California, Berkeley

  California PATH Program, Institute of Transportation Studies
  Richmond Field Station, 1357 South 46th Street
  Richmond, CA  United States  94804-4648
• Authors:
  • Daganzo, Carlos F
• Publication Date: 1998

Language

• English

Media Info

• Pagination: 4 p.
• Serial:
  • Research Report (University of California, Berkeley. Institute of Transportation Studies)

Subject/Index Terms

• TRT Terms: Critical path method; Dynamic traffic assignment; Mathematical models; Network analysis (Planning)
• Subject Areas: Design; Operations and Traffic Management;

Filing Info

• Accession Number: 00798207
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Report/Paper Numbers: UCB-ITS-RR-98-14
• Files: CALTRANS
• Created Date: Sep 29 2000 12:00AM