<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+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7Q2hpbmVzZSBwb3N0bWFuIHByb2JsZW0mcXVvdDsiIG9yaWdpbmFsX3ZhbHVlPSImcXVvdDtDaGluZXNlIHBvc3RtYW4gcHJvYmxlbSZxdW90OyIgLz48L2ZpbHRlcnM+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>Path-Planning Algorithm for Automated Pavement Crack Sealing Based on Postman Problems</title>
      <link>https://trid.trb.org/View/2433948</link>
      <description><![CDATA[Cracks exist in many civil infrastructures, such as road and bridge deck surfaces, parking lots, and building surfaces. To prevent crack growth and further deterioration, it is necessary to fill these cracks with appropriate materials in a timely manner. To improve maintenance efficiency, many machines that automatically complete sealing work have been developed in construction and maintenance areas. However, most current path-planning algorithms used in machines are based on transverse and longitudinal cracks with relatively simple shape. This article presents a new path-planning algorithm for complex cracks that is used for automatic pavement crack-sealing systems. Information about the crack binary map is extracted from the actual crack image using the authors' previous research work as a guide. Crack information is extracted and complex cracks are classified based on graph theory. The path-planning problem of connected cracks is then simplified to the Chinese Postman Problem, and the path-planning problem of unconnected cracks is simplified to the Rural Postman Problem. Finally, the feasibility of using the algorithm to deal with complex cracks is verified at the software level. The results indicate that the proposed algorithm has lower complexity and greater efficiency.]]></description>
      <pubDate>Tue, 22 Oct 2024 17:09:44 GMT</pubDate>
      <guid>https://trid.trb.org/View/2433948</guid>
    </item>
    <item>
      <title>The Winter Maintenance Optimization by Graph Theory</title>
      <link>https://trid.trb.org/View/1687919</link>
      <description><![CDATA[The article is concerned with optimization of the winter maintenance of the selected stretch of roads within the Strakonice district by applying the graph theory. The graph theory and the Chinese postman problem are applied in case of the winter maintenance of the specific selected section of roads. The article also includes the evaluation of performing the winter road maintenance so far. The results of optimization are compared with the present state and economically evaluated at the end.]]></description>
      <pubDate>Fri, 27 Mar 2020 09:04:36 GMT</pubDate>
      <guid>https://trid.trb.org/View/1687919</guid>
    </item>
    <item>
      <title>Generalized Maximum Benefit Multiple Chinese Postman Problem</title>
      <link>https://trid.trb.org/View/1355053</link>
      <description><![CDATA[This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. The authors call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). They present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.]]></description>
      <pubDate>Fri, 29 May 2015 12:25:25 GMT</pubDate>
      <guid>https://trid.trb.org/View/1355053</guid>
    </item>
    <item>
      <title>Real-time weighting optimization in Chinese Postman Problem</title>
      <link>https://trid.trb.org/View/1352600</link>
      <description><![CDATA[In this study, based on real-time constraint, an optimization method is proposed for solving the problem of the optimal tour. For that, the authors will construct a graph containing the real-time state of traffic. The collected data will be used to predict the future state traffic and to give an optimized cost of the tour. This optimization is tested in different sizes of the road networks. The results show that the proposed method is efficient and effective in solving the Chinese Postman Problem in real-time.]]></description>
      <pubDate>Tue, 19 May 2015 11:06:55 GMT</pubDate>
      <guid>https://trid.trb.org/View/1352600</guid>
    </item>
    <item>
      <title>Plot a better plowing plan</title>
      <link>https://trid.trb.org/View/1257506</link>
      <description><![CDATA[The City of Centennial, Colorado's public works department is using a routing formula to cut its snowplowing time by 40%, as well as applying it to buses, meter reading, street sweeping and refuse collection. They are using an algorithm based on the Chinese Postman Problem for optimization.]]></description>
      <pubDate>Thu, 01 Aug 2013 09:11:07 GMT</pubDate>
      <guid>https://trid.trb.org/View/1257506</guid>
    </item>
    <item>
      <title>Vehicle Routing for Urban Snow Plowing Operations</title>
      <link>https://trid.trb.org/View/851395</link>
      <description><![CDATA[In this paper, the authors discuss vehicle routing as used in winter road maintenance planning. Such route planning involves dispatching vehicles to spread deicing chemicals, plow roadways and sidewalks, and transport plowed snow to disposal sites. The research presents a model and two heuristic solution methods that are based on mathematical optimization for vehicle routing in snow plowing operations within urban areas. The authors assume an urban district comprised of a single depot serving as a base for numerous snow plows. The authors define the problem as determining a set of routes servicing all road segments where a single vehicle both starts and ends at the depot. In servicing each route, a set of operational constraints is satisfied, along with a minimal a time objective. Also discussed are several extensions that would be required for real-life applications, including turn restrictions, load balancing constraints, and tandem service requirements. The research considers both hierarchical and makespan objectives, developing a model comprised of a multicommodity network flow structure that imposes the route connectivity performed by each vehicle. The research involves two solution strategies that are tested with data from the City of Dieppe, New Brunswick, Canada.]]></description>
      <pubDate>Wed, 23 Apr 2008 09:25:10 GMT</pubDate>
      <guid>https://trid.trb.org/View/851395</guid>
    </item>
    <item>
      <title>Priority Constrained Chinese Postman Problem</title>
      <link>https://trid.trb.org/View/836027</link>
      <description><![CDATA[Motivated by a practical problem, this paper proposes and discusses an alternate formulation of the Chinese Postman Problem. The alternate formulation is termed the Priority Constrained Chinese Postman Problem in which a linear order on a set of important nodes is given and the task is to traverse all edges at least once in such a way that the higher priority nodes are visited as soon as possible.]]></description>
      <pubDate>Fri, 21 Sep 2007 13:53:23 GMT</pubDate>
      <guid>https://trid.trb.org/View/836027</guid>
    </item>
    <item>
      <title>ROUTING OF SOLID WASTE COLLECTION VEHICLES. APPENDIX B: A HEURISTIC SOLUTION TO THE M-POSTMEN'S PROBLEM</title>
      <link>https://trid.trb.org/View/23948</link>
      <description><![CDATA[This paper presents the theory and procedure of an algorithm which routes a known number of solid waste collection vehicles on a city street network. The network is assumed to be planar and connected and consists of only undirected edges (two-way streets). Each edge has a cost and load associated with it. The purpose of the procedure is to route the vehicles from a depot to a collection area (district), through the district and back to the depot. The algorithm determines districts and tours simultaneously. For each tour it lists a sequence of nodes and specifies whether the edge leading to each node is traveled or serviced. Computational experience shows that the algorithm is feasible for a network with as many as 90 nodes.]]></description>
      <pubDate>Thu, 26 Jun 1975 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/23948</guid>
    </item>
    <item>
      <title>ROUTING OF SOLID WASTE COLLECTION VEHICLES. APPENDIX A: MANUAL FOR USE OF THE COMPUTER CODES</title>
      <link>https://trid.trb.org/View/23949</link>
      <description><![CDATA[This report describes research on computer-based and manual techniques for the routing of solid waste collection vehicles. Algorithms are given for the routing of single vehicles under three conditions: (1) all streets are two way, (2) all streets are one way, and (3) some streets are two way and others are one way. In addition, a heuristic algorithm is provided for routing several vehicles in a larger area. Appendix A is a manual for use of the computer codes. Appendix B (separately bound) is a heuristic solution to the m-postmen's solution.]]></description>
      <pubDate>Thu, 26 Jun 1975 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/23949</guid>
    </item>
    <item>
      <title>ROUTING OF SOLID WASTE COLLECTION VEHICLES. APPENDIX B: OPTIMAL ROUTING OF SOLID WASTE COLLECTION VEHICLES</title>
      <link>https://trid.trb.org/View/23950</link>
      <description><![CDATA[This study is applying network theory to the problem of routing a solid waste collection vehicle through a street network. It is centered on the development of an algorithm to find the minimum tour of a vehicle which has to complete a round trip through a network consisting of both one-way and two-way streets. It is the total length of the tour which is sought rather than the detailed and chronologic schedule of the vehicle. This tour is found by minimizing the total length of street segments which have to be retraced. The problem can be described mathematically as a linear program whose optimal solution is guaranteed to be integer.]]></description>
      <pubDate>Thu, 26 Jun 1975 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/23950</guid>
    </item>
    <item>
      <title>ROUTING OF SOLID WASTE COLLECTION VEHICLES. APPENDIX A: A LINEAR PROGRAMMING APPROACH FOR THE TRAVELING SALESMAN PROBLEM</title>
      <link>https://trid.trb.org/View/23951</link>
      <description><![CDATA[The first report provides the background for routing solid waste collection vehicles. Problems encountered with existing methods and possible solutions are given. Appendixes A and B are solutions to two classic routing problems. Appendix A takes the integer programming formulation of Dantzig, Fulkerson, and Johnson which is relaxed to a linear program and a column generation scheme found for its dual. Appendix B (separately bound) is a study applying network theory to the problem of routing a solid waste collection vehicle through a street network. The problem can be described mathematically as a linear program whose optimal solution is guaranteed to be integer.]]></description>
      <pubDate>Thu, 26 Jun 1975 00:00:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/23951</guid>
    </item>
  </channel>
</rss>