<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+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7RGVzaXJlZCBkZWxpdmVyeSB0aW1lcyZxdW90OyIgb3JpZ2luYWxfdmFsdWU9IiZxdW90O0Rlc2lyZWQgZGVsaXZlcnkgdGltZXMmcXVvdDsiIC8+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>OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATIONS WITH DESIRED DELIVERY TIMES: I. SCHEDULING</title>
      <link>https://trid.trb.org/View/271326</link>
      <description><![CDATA[A set of n customers is given.  Each customer has a desired point of pickup, a desired point of delivery and a desired time of delivery.  The problem is to determine the order of pickup and delivery and the times of pickup and delivery of these n customers by a single vehicle in order to minimize total customer inconvenience.  Here, a mathematical programming formulation of this problem is subjected to Benders' decomposition procedure.  The result is a heuristic routing and scheduling algorithm which is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithersburg, Maryland, and Baltimore, Maryland.  (Edited author abstract)]]></description>
      <pubDate>Sat, 31 May 1986 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/271326</guid>
    </item>
    <item>
      <title>OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATIONS WITH DESIRED DELIVERY TIMES: II. ROUTING</title>
      <link>https://trid.trb.org/View/271327</link>
      <description><![CDATA[This is the second part of a two-part study treating the single vehicle many-to-many pickup and delivery problem with desired delivery times.  This part focuses on the routing subproblem, presenting a heuristic algorithm for finding an initial route and a second heuristic algorithm for improving the route sequence.  It then integrates the routing and scheduling algorithms, and describes the results of a number of computational experiments on actual data.  An example of the complete routing and scheduling algorithm appears as an appendix.  (Edited author abstract)]]></description>
      <pubDate>Sat, 31 May 1986 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/271327</guid>
    </item>
  </channel>
</rss>