<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=PHNlYXJjaD48cGFyYW1zPjxwYXJhbSBuYW1lPSJzdWJqZWN0bG9naWMiIHZhbHVlPSJvciIgLz48cGFyYW0gbmFtZT0idGVybXNsb2dpYyIgdmFsdWU9Im9yIiAvPjxwYXJhbSBuYW1lPSJsb2NhdGlvbiIgdmFsdWU9IjAiIC8+PC9wYXJhbXM+PGZpbHRlcnM+PGZpbHRlciBmaWVsZD0ic2VyaWFsIiB2YWx1ZT0iJnF1b3Q7SW50ZXJuYXRpb25hbCBDb25mZXJlbmNlIG9uIEhpZ2gtUGVyZWZvcm1hbmNlIENvbXB1dGluZyAgKCA0dGggOiAxOTk3IDogQmFuZ2Fsb3JlLCBJbmRpYSApIC4gUHJvY2VlZGluZ3MmcXVvdDsiIG9yaWdpbmFsX3ZhbHVlPSImcXVvdDtJbnRlcm5hdGlvbmFsIENvbmZlcmVuY2Ugb24gSGlnaC1QZXJlZm9ybWFuY2UgQ29tcHV0aW5nICg0dGggOiAxOTk3IDogQmFuZ2Fsb3JlLCBJbmRpYSkuIFByb2NlZWRpbmdzJnF1b3Q7IiAvPjwvZmlsdGVycz48cmFuZ2VzIC8+PHNvcnRzPjxzb3J0IGZpZWxkPSJwdWJsaXNoZWQiIG9yZGVyPSJkZXNjIiAvPjwvc29ydHM+PHBlcnNpc3RzPjxwZXJzaXN0IG5hbWU9InJhbmdldHlwZSIgdmFsdWU9InB1Ymxpc2hlZGRhdGUiIC8+PC9wZXJzaXN0cz48L3NlYXJjaD4=" 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>PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS</title>
      <link>https://trid.trb.org/View/495495</link>
      <description><![CDATA[This paper considers two different problems in single vehicle routing. The first looks at finding the least time cost routes between all pairs of nodes in a network for navigating vehicles. The second looks at a vehicle which services all locations in a network.  Parallel algorithms are employed in the processes.]]></description>
      <pubDate>Wed, 17 Nov 1999 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/495495</guid>
    </item>
  </channel>
</rss>