Nonadditive Shortest Paths

Details

• Creators:
  Gabriel, Steven A. ; Bernstein, David
• Corporate Creators:
  New Jersey Institute of Technology
• Corporate Contributors:
  New Jersey TIDE Center
• Subject/TRT Terms:
  Algorithms Automobile Navigation Systems Costs Heuristic Methods Linear Programming Path Shortest Path Algorithms Trip Generation
• Resource Type:
  Research Paper
• Geographical Coverage:
  United States
• TRIS Online Accession Number:
  00813762
• Corporate Publisher:
  New Jersey TIDE Center
• Abstract:
  To find the shortest path in a network is often a problem in transportation applications. This paper considers a shortest path problem in which the costs are a particular nonlinear, nonseparable function. An algorithm of feasible-directions variety in which subproblems are simple minimum cost flow linear programs is presented. To ensure that a path which produces a lower function value is found, the algorithm contains a heuristic component.
• Format:
  PDF
• Collection(s):
  US Transportation Collection
• Main Document Checksum:
  urn:sha256:6c423bd6e61414fd5be63ebe83ac099e7e76db81840caf91420dd6d34c3e8c21
• Download URL:
  https://rosap.ntl.bts.gov/view/dot/38584/dot_38584_DS1.pdf
• File Type:
  [PDF - 176.04 KB ]