<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+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7RGVsaXZlcmllcyZxdW90OyIgb3JpZ2luYWxfdmFsdWU9IiZxdW90O0RlbGl2ZXJpZXMmcXVvdDsiIC8+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>The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints</title>
      <link>https://trid.trb.org/View/1640070</link>
      <description><![CDATA[In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: At each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, the authors investigate two different types of measures for limiting customer inconvenience (a maximum number of visits and the temporal synchronization of deliveries) and evaluate the impact of these measures on carrier efficiency by means of different objective functions (comprising variable routing costs, costs related to route durations, and fixed fleet costs). The authors consider the vehicle routing problem with time windows in which split deliveries are allowed (SDVRPTW) and define the corresponding generalization that takes into account customer inconvenience constraints (SDVRPTW-IC). The authors design an extended branch-and-cut algorithm to solve the SDVRPTW-IC and report on experimental results showing the impact of customer inconvenience constraints. The authors finally draw useful insights for logistics managers on the basis of the experimental analysis carried out.]]></description>
      <pubDate>Mon, 12 Aug 2019 10:53:50 GMT</pubDate>
      <guid>https://trid.trb.org/View/1640070</guid>
    </item>
    <item>
      <title>Evaluation of delivery cost approximation for attended home deliveries</title>
      <link>https://trid.trb.org/View/1581360</link>
      <description><![CDATA[In the competitive market of online retail, customers and retailers mutually agree on delivery time windows for order delivery. Since overall information on customers and their desired time windows becomes only available incrementally during the booking process, decisions on the acceptance of customers are challenging: customers arrive step-by-step on the retailer’s website and expect immediate feedback on the availability of desired time windows, which requires effective solutions in short run times. The retailer’s aim is to accept as many customers as possible to stay profitable, and fixed delivery capacities have to be considered when customers request for delivery. Customer acceptance mechanisms provide guidance for retailers to estimate the delivery costs and hence the number of customers that can be accepted without exceeding available capacities. Within this paper, the authors present a new customer acceptance mechanism, which is based on a cost approximation approach from the literature. The authors perform a computational study to evaluate the presented approximation method and compare it to customer acceptance mechanisms from the literature. The authors consider various demand scenarios, partially obtained from real order data from a German online supermarket.]]></description>
      <pubDate>Mon, 06 May 2019 15:20:57 GMT</pubDate>
      <guid>https://trid.trb.org/View/1581360</guid>
    </item>
    <item>
      <title>Sustainable crowdshipping using public transport: a case study evaluation in Rome</title>
      <link>https://trid.trb.org/View/1549987</link>
      <description><![CDATA[The paper analyses the willingness to act as a crowdshipper in the case of a last mile B2C e-commerce for pick up/delivery. Specifically, it focuses on crowdshipping services deployed using the public transport network and considering passengers as crowdshippers already moving for other reasons. In fact, this is the most environmental-friendly type of service one can develop given it avoids performing dedicated trips. The paper uses stated preference to identify the most important features associated with the choice of acting as a crowdshipper and discrete choice models to study the underlying behavior. The implementation case study refers to the city of Rome, Italy, and addresses its metro lines, thus understanding and quantifying the effects of this freight transport strategy for e-commerce in an urban context and providing local policy makers a good knowledge base for its future development.]]></description>
      <pubDate>Tue, 20 Nov 2018 10:24:09 GMT</pubDate>
      <guid>https://trid.trb.org/View/1549987</guid>
    </item>
    <item>
      <title>Stochastic last-mile delivery with crowdshipping</title>
      <link>https://trid.trb.org/View/1549977</link>
      <description><![CDATA[For the predicted growth of e-commerce, supply chains need to adapt to new conditions, so that delivery can be fast, cheap and reliable. The key to success is the last-mile product delivery (LMD) – the last stage of the supply chain, where the ordered product is delivered to the final consumer’s location. One innovative proposal puts foundations in a new delivery model where a professional delivery fleet (PF) is supplemented partially or fully with crowdshipping. The main idea of crowdshipping is to involve ordinary people – in our case in-store shoppers – in the delivery of packages to other customers. In return, occasional couriers (OC) are offered a small compensation. In hitherto formulated problems it was assumed that OCs always accept delivery tasks assigned to them. In this paper the authors consider OCs as independent agents, which are free to reject assignments. The main contribution of the paper is an original bi-level methodology for matching and routing problem in LMD with OCs and the PF. The goal is to use crowdshipping to reduce the total delivery cost in a same-day last-mile delivery system with respect to occasional couriers’ freedom to accept or reject the assigned delivery. The authors introduce probability to represent each OC’s willingness to perform the delivery to a given final customer. They study the OCs’ willingness to accept or reject delivery tasks assigned to them and the influence of their decision on the total delivery cost associated to both the OCs’ compensation fees and the delivery cost generated by the PF used for the delivery of remaining parcels.]]></description>
      <pubDate>Tue, 20 Nov 2018 10:24:09 GMT</pubDate>
      <guid>https://trid.trb.org/View/1549977</guid>
    </item>
    <item>
      <title>Public Opinion Toward Crowd Deliveries in New York State</title>
      <link>https://trid.trb.org/View/1495440</link>
      <description><![CDATA[Crowd deliveries is a business model in freight deliveries that is part of the new trend of shared economies. It matches excess vehicle capacity from the common person or crowd (who act as the courier) with the demand of others geographically dispersed individuals who require their merchandize to be delivered.  In the last few years, there are more than 40 start-up companies in the U.S and more than 50 worldwide that use this new concept. This innovative model has shown to make urban freight more efficient particularly in the last-mile delivery, showing potential reductions for both transportation costs and environmental impacts. This study is intended to understand the shopping behaviors of individuals and their acceptance, or not, of these alternate delivery services, such as crowd deliveries, and their feasibility in accordance to today’s market conditions. Initial empirical findings in New York State suggest that there is still some resistance in accepting Crowd Deliveries but some segments of the population are more inclined to accept this new trend of deliveries.]]></description>
      <pubDate>Thu, 22 Mar 2018 11:55:06 GMT</pubDate>
      <guid>https://trid.trb.org/View/1495440</guid>
    </item>
    <item>
      <title>Planning the distribution of goods in the context of city logistics considering split deliveries with access and time restrictions</title>
      <link>https://trid.trb.org/View/1489197</link>
      <description><![CDATA[Cities are getting bigger with more homes and companies which demand more goods to supply them. Furthermore, more vehicles are travelling in the cities which lead to an increase of greenhouse gas emissions, traffic jam and many other problems that damage the citizens' quality of life. To make it better, local governments are imposing restrictions on the type of vehicles and the time that they can deliver goods in the city. Thus, to plan the distribution of goods in this restricted context, this paper proposes a mathematical model that incorporates the characteristics of split deliveries, heterogeneous fleet, access restrictions and time windows for planning the distribution of goods. Based on real data from an agricultural supply company that delivers goods to supermarkets, seven instances were elaborated and the results showed that the model can bring cost savings for the company and environmental benefits for the citizens.]]></description>
      <pubDate>Wed, 29 Nov 2017 17:16:38 GMT</pubDate>
      <guid>https://trid.trb.org/View/1489197</guid>
    </item>
    <item>
      <title>Multicommodity vs. Single-Commodity Routing</title>
      <link>https://trid.trb.org/View/1408257</link>
      <description><![CDATA[In this paper the authors study a vehicle routing problem where customers request multiple commodities. The authors study the impact on transportation cost from using vehicles dedicated to a single commodity compared with using flexible vehicles capable of carrying any set of commodities. With vehicles that carry multiple commodities, the authors consider when the delivery to a customer can be made by more than one vehicle. If multiple vehicles can be used, the authors examine when deliveries of individual commodities may be split and when they may not be split. The latter problem has not previously been studied, and the authors present a mathematical programming model for it. The authors use worst case and computational analysis to compare these different models.]]></description>
      <pubDate>Tue, 31 May 2016 09:24:17 GMT</pubDate>
      <guid>https://trid.trb.org/View/1408257</guid>
    </item>
    <item>
      <title>Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows</title>
      <link>https://trid.trb.org/View/1242929</link>
      <description><![CDATA[The vehicle routing problem with simultaneous deliveries and pickups (VRPSDP) has attracted much research interest because of the potential to provide cost savings to transportation and logistics operators. Several extensions of VRPSDP exist. Of these extensions, the simultaneous deliveries and pickups with split loads problem (SDPSLP) has been proposed to eliminate vehicle capacity constraints, as well as allow the deliveries or pickups for a customer to be split into multiple visits. Although delivery and pickup activities are often constrained by time windows, few studies have considered such constraints when SDPSLP has been addressed. To fill the gap, this paper formulates the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem. A hybrid heuristic algorithm was developed to solve this problem. Solomon data sets with minor modifications were applied to test the effectiveness of the solution algorithm. The results of a computational experiment demonstrated that use of the proposed algorithms to solve VRPSDPSLTW had advantages for minimization of the total travel cost, number of vehicles, and loading rate. The proposed formulation and solution algorithm for VRPSDPSLTW may serve as a general analytical tool for the optimization of vehicle routing in practice.]]></description>
      <pubDate>Mon, 15 Apr 2013 13:15:47 GMT</pubDate>
      <guid>https://trid.trb.org/View/1242929</guid>
    </item>
    <item>
      <title>An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads</title>
      <link>https://trid.trb.org/View/1245706</link>
      <description><![CDATA[This study considers the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads (MPDPSL). This problem is a generalization of the one-to-one Pickup and Delivery Problem (PDP) where each load can be served by multiple vehicles as well as multiple stops by the same vehicle. In practice, split deliveries is a viable option in many settings where the load can be physically split, such as courier services of third party logistics operators. The authors propose an efficient heuristic that combines the strengths of Tabu Search and Simulated Annealing for the solution of the MPDPSL. Results from experiments on two problem sets in the literature indicate that the heuristic is capable of producing good quality solutions in reasonable time. The experiments also demonstrate that up to 33% savings can be obtained by allowing split loads; however, the magnitude of savings is dependent largely on the spatial distribution of the pickup and delivery locations.]]></description>
      <pubDate>Fri, 12 Apr 2013 12:15:56 GMT</pubDate>
      <guid>https://trid.trb.org/View/1245706</guid>
    </item>
    <item>
      <title>Freight Systems 2012: Modeling and Logistics</title>
      <link>https://trid.trb.org/View/1151386</link>
      <description><![CDATA[This issue contains 16 papers on the subject of modeling and logistics for freight systems.  Specific topics discussed include the following:  analysis of freight distribution using the gravity model and a genetic algorithm; network assignment problem of capacitated freight with disruptions; multihub location problem for less-than-truckload industry; parametric and nonparametric trade gravity models; shipping service network design for intermodal liners; road closures and freight diversion; choice of commercial vehicular mode in urban areas; estimating freight trip generation based on land use; scheduling deliveries with backhauls; failed home deliveries; economic order quantity model for choice of freight shipment size; RUBMRIO model for U.S. trade patterns; status quo of city logistics in scientific literature; parametric and nonparametric hazard models for stop durations on urban tours with commercial vehicles; urban freight road pricing in e-commerce environment; and simulating sustainable urban gateway development.]]></description>
      <pubDate>Wed, 22 Aug 2012 16:29:41 GMT</pubDate>
      <guid>https://trid.trb.org/View/1151386</guid>
    </item>
    <item>
      <title>Alternative Solution for Addressing Failed Home Deliveries</title>
      <link>https://trid.trb.org/View/1129338</link>
      <description><![CDATA[Freight planners are becoming increasingly more concerned about the impact of failed home deliveries on additional carrier journeys (repeat deliveries) and customer trips (to retrieve goods from carrier depots). A local collection-and-delivery point (CDP) concept, which allows customers to collect their failed deliveries, has emerged as a solution for home delivery failures. Data from a 2007 customer survey across two areas along with historical delivery data provided by a major carrier company in the United Kingdom were used in a study of the problem. Nine carrier companies were interviewed to gain an understanding of current operating characteristics of carriers and the key problems encountered during delivery operations. The study quantified the transport costs for the carrier and customer trips of the conventional home delivery method, in which the carrier makes repeat deliveries in the case of first-time failure and appraises the benefits of using CDP networks for handling those failures. The results suggest that a network of CDPs would function most effectively when (a) the proportion of first-time home delivery failures is significant, (b) a significant number of people walk to their local CDP, (c) the carrier’s depot is located far from the collection area and is not in a convenient location that allows the trip to be combined with another trip; and (d) there is a dense network of CDPs around the residential area.]]></description>
      <pubDate>Thu, 21 Jun 2012 16:37:31 GMT</pubDate>
      <guid>https://trid.trb.org/View/1129338</guid>
    </item>
    <item>
      <title>Precedence constrained pickup and delivery with split loads</title>
      <link>https://trid.trb.org/View/1136902</link>
      <description><![CDATA[A split load is a load having size no greater than the capacity of a single vehicle that is delivered using more than a single vehicle. The use of split loads can reduce the total transportation cost and the number of vehicles serving a set of loads. Several studies have shown the benefit of split loads as applied to the split delivery vehicle routing problem (SDVRP) and the pickup and delivery problem with split loads (PDPSL). While most research on the application of split loads to vehicle routing has revolved around heuristic methods, in this paper an exact solution method is used on a constrained version of the PDPSL. All origins to be visited must be served before any destination that is to be visited on each route, which the authors refer to as the precedence constrained-PDPSL (PC-PDPSL). Through this constraint, several structural characteristics that result from the SDVRP are shown to also hold for the PC-PDPSL. In particular, they develop a dynamic programming formulation of the PC-PDPSL and show that the state and action spaces of this problem are finite. They use the well-known A* 'best-first' search algorithm from artificial intelligence to find an exact solution to a wide range of data sets. Computational experiments support findings developed using heuristic methods for the PDPSL, showing that splitting loads can reduce costs and that there is a relationship between average load size and cost savings.]]></description>
      <pubDate>Wed, 16 May 2012 15:05:16 GMT</pubDate>
      <guid>https://trid.trb.org/View/1136902</guid>
    </item>
    <item>
      <title>Enhanced branch and price and cut for vehicle routing with split deliveries and time windows</title>
      <link>https://trid.trb.org/View/1115806</link>
      <description><![CDATA[The split delivery vehicle routing problem with time (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle, is studied in this paper. Enhancement procedures are proposed for the exact branch-and-price-and-cut algorithm that was recently developed for the SDVRPTW. Of a particular focus is a tabu search algorithm which is introduced to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. The effectiveness of the proposed enhancements is shown in the computational results.]]></description>
      <pubDate>Wed, 14 Sep 2011 11:13:15 GMT</pubDate>
      <guid>https://trid.trb.org/View/1115806</guid>
    </item>
    <item>
      <title>Energy and Global Climate Change 2010</title>
      <link>https://trid.trb.org/View/1091093</link>
      <description><![CDATA[This issue contains 22 papers on the subject of energy and global climate change.  Specific topics discussed include the following:  wide-based single tires effect on truck fuel efficiency; miles per gallon illusions and Corporate Average Fuel Economy distortions; freight transport, energy use, and emissions trends in Spain; diesel truck activity and fuel economy based on electronic control module data; cost of hydrogen fuel cell vehicles; electric vehicle charging impact on electricity costs; economic assessment of electric-drive vehicle operation; cost hurdles of the plug-in hybrid battery; compressed air vehicles; recharging of plug-in hybrid electric vehicles; bioeconomy-based fuel production; low-carbon vehicle and fuel technologies; integrating vehicle and fuel regulation; cash-for-clunker programs; integrated land use and transportation carbon estimator; climate change and urban transportation in Latin America; collection-delivery points for failed home deliveries; impact of intermodal facilities on design and management of biofuel supply chain; carbon dioxide emissions at high speeds; vehicle-specific power bins for light-duty vehicles in estimation of carbon dioxide emissions; greenhouse gas emissions from light-duty vehicles; and macroscopic model of greenhouse gas emissions.]]></description>
      <pubDate>Fri, 18 Feb 2011 11:30:13 GMT</pubDate>
      <guid>https://trid.trb.org/View/1091093</guid>
    </item>
    <item>
      <title>Carbon Dioxide Benefits of Using Collection–Delivery Points for Failed Home Deliveries in the United Kingdom</title>
      <link>https://trid.trb.org/View/910238</link>
      <description><![CDATA[Unlike much of the previous research on this topic, which assesses the economic consequences of failed deliveries to the home, this study examines the issue of failed delivery from a carbon-auditing perspective. It considers the potential environmental savings from the use of alternative forms of collection and delivery over traditional delivery methods for failed home deliveries. With a spreadsheet carbon audit model, carbon dioxide (CO2) emissions for a failed delivery are calculated on the basis of a typical van home delivery round of 120 drops and 50-mi (80-km) distance. Three first-time delivery failure rates (10%, 30%, and 50%) are assessed. The additional CO2 from a second delivery attempt increases the emissions per drop by 9% to 75% (depending on the delivery failure rate). The vast majority (85% to 95%) of emissions emanating from a traditional failed delivery arise not from the repeat van delivery but from the personal travel associated with the customer’s collecting a missed redelivery from the carrier’s local depot. A range of collection–delivery points (CDPs) (supermarkets, post offices, railway stations) were all found to reduce the environmental impact of this personal travel. Post offices (currently operating a CDP system through the U.K. Royal Mail’s Local Collect service) yielded the greatest savings, creating just 13% of the CO2 produced by a traditional collection by car from a local depot. Overall, the research suggests that the use of CDPs offers a convenient and more environmentally friendly alternative to redelivery and customer collection from a local parcel depot.]]></description>
      <pubDate>Wed, 21 Apr 2010 08:09:17 GMT</pubDate>
      <guid>https://trid.trb.org/View/910238</guid>
    </item>
  </channel>
</rss>