SOLUTION ALGORITHMS FOR RESOURCE AND ROUTE CONSTRAINED SHORTEST PATH PROBLEMS IN TIME-DEPENDENT TRANSPORTATION NETWORKS

Several problems within the class of deterministic linear network optimization problems have been formulated and solved. They can be described as constrained shortest path problems which occur in transportation networks. The constraints involve specified route, resource, and schedule restrictions. The network represents a single mode configuration of transportation routes, and consists of a given set of nodes and directed arcs. The mathematical formulations of four related problems are given. The first shortest path problem is constrained only by schedule restrictions. The second problem has an additional resource constraint. Each of these two problems is then complicated by the addition of route constraints to form two other problems. Two different cases for each of the last two problems are formulated. A survey of available programming techniques and their extentions for the above problems is presented. (Modified author abstract)

• Corporate Authors:

  Stanford University

  Department of Industrial Engineering
  Stanford, CA  United States  94305
• Authors:
  • Yucaoglu, E
• Publication Date: 1973-7

Media Info

• Pagination: 245 p.

Filing Info

• Accession Number: 00054488
• Record Type: Publication
• Source Agency: National Technical Information Service
• Report/Paper Numbers: RR-4, UMTA-CA-11-0008
• Files: NTIS
• Created Date: Jun 18 2003 12:00AM