SAVINGS BY SPLIT DELIVERY ROUTING

A relaxed version of the generic vehicle routing problem is examined in this Technical Note. In this version, a delivery to a demand point can be split between any number of vehicles. In spite of this relaxation the problem remains computationally hard. It is empirically demonstrated that allowing split deliveries can result in savings that are significant both in the total distance traveled and the number of vehicles required. The vehicle routes constructed by this procedure tend to cover cohesive geographical zones and retain some properties of optimal solutions.

• Availability:
  • Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
• Authors:
  • Dror, M
  • TRUDEAU, P
• Publication Date: 1989-5

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 141-145
• Serial:
  • Transportation Science
  • Volume: 23
  • Issue Number: 2
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Costs; Delivery service; Mechanical relaxation; Routing; Savings
• Uncontrolled Terms: Relaxation methods (Mathematics); Split deliveries
• Subject Areas: Finance; Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00485542
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Jul 31 1989 12:00AM