<rss version="2.0" xmlns:atom="https://www.w3.org/2005/Atom">
  <channel>
    <title>Transport Research International Documentation (TRID)</title>
    <link>https://trid.trb.org/</link>
    <atom:link href="https://trid.trb.org/Record/RSS?s=PHNlYXJjaD48cGFyYW1zPjxwYXJhbSBuYW1lPSJkYXRlaW4iIHZhbHVlPSJhbGwiIC8+PHBhcmFtIG5hbWU9InN1YmplY3Rsb2dpYyIgdmFsdWU9Im9yIiAvPjxwYXJhbSBuYW1lPSJ0ZXJtc2xvZ2ljIiB2YWx1ZT0ib3IiIC8+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7UGF0aCBtaW5pbWl6YXRpb24mcXVvdDsiIG9yaWdpbmFsX3ZhbHVlPSImcXVvdDtQYXRoIG1pbmltaXphdGlvbiZxdW90OyIgLz48L2ZpbHRlcnM+PHJhbmdlcyAvPjxzb3J0cz48c29ydCBmaWVsZD0icHVibGlzaGVkIiBvcmRlcj0iZGVzYyIgLz48L3NvcnRzPjxwZXJzaXN0cz48cGVyc2lzdCBuYW1lPSJyYW5nZXR5cGUiIHZhbHVlPSJwdWJsaXNoZWRkYXRlIiAvPjwvcGVyc2lzdHM+PC9zZWFyY2g+" rel="self" type="application/rss+xml" />
    <description></description>
    <language>en-us</language>
    <copyright>Copyright © 2026. National Academy of Sciences. All rights reserved.</copyright>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <managingEditor>tris-trb@nas.edu (Bill McLeod)</managingEditor>
    <webMaster>tris-trb@nas.edu (Bill McLeod)</webMaster>
    <image>
      <title>Transport Research International Documentation (TRID)</title>
      <url>https://trid.trb.org/Images/PageHeader-wTitle.jpg</url>
      <link>https://trid.trb.org/</link>
    </image>
    <item>
      <title>DYANMIC TRAFFIC ASSIGNMENT BY INDIVIDUAL PATH MINIMIZATION AND QUEUEING</title>
      <link>https://trid.trb.org/View/118092</link>
      <description><![CDATA[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/]]></description>
      <pubDate>Thu, 30 Dec 1971 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/118092</guid>
    </item>
  </channel>
</rss>