<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+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7VXNlciBlcXVpbGlicml1bSBjb25zdHJhaW50cyZxdW90OyIgb3JpZ2luYWxfdmFsdWU9IiZxdW90O1VzZXIgZXF1aWxpYnJpdW0gY29uc3RyYWludHMmcXVvdDsiIC8+PC9maWx0ZXJzPjxyYW5nZXMgLz48c29ydHM+PHNvcnQgZmllbGQ9InB1Ymxpc2hlZCIgb3JkZXI9ImRlc2MiIC8+PC9zb3J0cz48cGVyc2lzdHM+PHBlcnNpc3QgbmFtZT0icmFuZ2V0eXBlIiB2YWx1ZT0icHVibGlzaGVkZGF0ZSIgLz48L3BlcnNpc3RzPjwvc2VhcmNoPg==" 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>A Robust Approach to Continuous Network Designs with Demand Uncertainty</title>
      <link>https://trid.trb.org/View/815404</link>
      <description><![CDATA[This paper considers a robust optimization to solve a continuous network design problem with demand uncertainty.  The authors assume that the travel demands belong to a convex and compact uncertainty set instead of having them follow some probability distributions and traffic flows on the underlying network are in user equilibrium.  For a given demand realization, the problem reduces to a mathematical program with equilibrium constraints.  The algorithm proposed in this paper for the problem converges under certain conditions.  However, numerical results using two networks from the literature empirically demonstrate that the algorithm is effective and has the potential to solve realistic problems.]]></description>
      <pubDate>Fri, 21 Sep 2007 13:55:23 GMT</pubDate>
      <guid>https://trid.trb.org/View/815404</guid>
    </item>
    <item>
      <title>TRANSPORTATION NETWORK OPTIMIZATION PROBLEMS WITH STOCHASTIC USER EQUILIBRIUM CONSTRAINTS</title>
      <link>https://trid.trb.org/View/746515</link>
      <description><![CDATA[A comprehensive study of static transportation network optimization problems with stochastic user equilibrium constraints is presented.  It is explicitly demonstrated that the formulation of the fixed-point problem--in terms of link flows for the general stochastic user equilibrium problem in which the Jacobian matrix of link travel cost functions may not be symmetric--possesses a unique solution with mild conditions.  By developing a sensitivity analysis method for the stochastic user equilibrium problem, the study proves that the perturbed equilibrium link flows are continuously differentiable implicit functions with respect to perturbation parameters.  Accordingly, it can be concluded that the proposed unified bilevel programming model, which can characterize transportation network optimization problems subject to stochastic user equilibrium constraints, is a smooth optimization problem.  In addition, the study presents a single-level continuously differentiable optimization formulation that is equivalent to the unified bilevel programming model.  Furthermore, as a unified solution method, a successive quadratic programming algorithm based on the sensitivity analysis method is used to solve the transportation network optimization problems with stochastic user equilibrium constraints.  Finally, two examples are used to demonstrate the proposed models and algorithm.]]></description>
      <pubDate>Tue, 14 Dec 2004 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/746515</guid>
    </item>
  </channel>
</rss>