Savings by Split Delivery Routing

Moshe Dror and Pierre Trudeau
Additional contact information
Moshe Dror: Ben Gurion University of the Negev, Beer Sheva 84105, Israel
Pierre Trudeau: Université de Montréal, Montréal, Québec, H3C 3J7, Canada

Transportation Science, 1989, vol. 23, issue 2, 141-145

Abstract: This paper examines a relaxed version of the generic vehicle routing problem. 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. The main contribution of this paper is in demonstrating the potential for cost savings through split deliveries. The solution scheme allowing for split deliveries is compared with a solution in which no split deliveries are allowed on a large set of 540 problems. Significant cost savings are realized both in terms of the total distance and the number of vehicles required. The vehicle routes constructed by our procedure, tend to cover cohesive geographical zones and retain some properties of optimal solutions.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (77)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.2.141 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:2:p:141-145

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().