DYANMIC TRAFFIC ASSIGNMENT BY INDIVIDUAL PATH MINIMIZATION AND QUEUEING

METHODS OF ASSIGNING NON-VARYING DEMANDS TO A NETWORK ACCORDING TO THE FIRST PRINCIPLE OF WARDROP ARE EXTENDED TO ALLOW FOR TIME-VARYING DEMANDS. THIS IS ACCOMPLISHED BY BREAKING UP THE TIME PERIOD OVER WHICH THE DEMAND VARIES INTO TIME SLICES WHICH ARE SUFFICIENTLY SHORT THAT THEY CAN BE CONSIDERED TO HAVE NONVARYING DEMANDS. FOR EACH TIME SLICE THE ASSIGNMENTS ARE MADE BY HOMBURGER'S METHOD. QUEUING IS ALLOWED, WITH QUEUED-UP DEMANDS AT THE END OF A TIME SLICE BEING CARRIED FORWARD TO THE NEXT SLICE. THE PROPOSED MTHODOLOGY IS TESTED BY APPLICATION TO AN EXISTING ROADWAY CORRIDOR IN THE SAN FRANCISCO BAY AREA. /AUTHOR/

• Supplemental Notes:
  • Vol 5, No 3, PP 179-196
• Authors:
  • Yagar, S
• Publication Date: 1971

Media Info

• Serial:
  • Transportation Research /UK/
  • Volume: 5
  • Issue Number: 3
  • Publisher: Pergamon Press, Incorporated

Subject/Index Terms

• TRT Terms: Demand; Queuing; Traffic assignment
• Old TRIS Terms: Path minimization
• Subject Areas: Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00228127
• Record Type: Publication
• Files: TRIS
• Created Date: Dec 30 1971 12:00AM