DYNAMIC TRAFFIC ASSIGNMENT BY INDIVIDUAL PATH MINIMIZATION AND QUEUING

METHODS OF ASSIGNING NON-WAVYING 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 NON-VARYING 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 METHODOLOGY IS TESTED BY APPLICATION TO AN EXISTING ROADWAY CORRIDOR IN THE SAN FRANCISCO BAY AREA. /AUTHOR/

  • Authors:
    • Uagar, S
  • Publication Date: 1971-8

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 179-96
  • Serial:

Subject/Index Terms

Filing Info

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