A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION

FOLLOWING A BRIEF DISCUSSION OF SHORTCOMINGS OF ALL-OR- NOTHING ASSIGNMENT AND OF PRIOR EFFORTS IN MULTIPATH ASSIGNMENT, TWO ALGORITHMS ARE PRESENTED, BOTH OF WHICH YIELD RESULTS WITH THE ABOVE PROPERTIES. THE ALGORITHMS DIFFER IN THEIR DEFINITION OF A REASONABLE PATH AND IN THE NUMBER OF TIMES EACH IS EXECUTED TO ASSIGN ALL TRIPS FROM A GIVEN ORIGIN NODE. THE FIRST USES MORE RESTRICTIVE DEFINITION THAN THE SECOND AND REQUIRES A SINGLE EXECUTION FOR EACH DISTINCT ORIGIN/DESTINATION NODE PAIR. THE SECOND, A MINOR VARIATION OF THE FIRST, USES A RELAXED DEFINITION OF A REASONABLE PATH, WHICH ALLOWS THE SIMULTANEOUS ASSIGNMENT OF ALL TRIPS ORIGINATING AT A GIVEN NODE IN A SINGLE EXECUTION. COMPARED WITH THE FIRST ALGORITHM, THE LATTER PARALLEL MULTIPATH ALGORITHM IS MUCH MORE EFFICIENT COMPUTATIONALLY, BUT IS LESS DISCRIMINATING IN ITS SELECTION OF PROBABLE PATHS. (A).

• Authors:
  • Dial, R B
• Publication Date: 1971-6

Language

• English

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 83-113
• Serial:
  • Transportation Research /UK/
  • Volume: 5 N2
  • Publisher: Pergamon Press, Incorporated

Subject/Index Terms

• TRT Terms: Algorithms; Dynamic loads; Information processing; Origin and destination; Probability theory; Traffic assignment; Walkways
• Subject Areas: Data and Information Technology; Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00228460
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: TRIS
• Created Date: Jul 31 1974 12:00AM