Savings by Split Delivery Routing
暂无分享,去创建一个
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.
[1] M. Dror,et al. Split delivery routing , 1990 .
[2] Lawrence Bodin,et al. THE STATE OF THE ART IN THE ROUTING AND SCHEDULING OF VEHICLES AND CREWS: EXECUTIVE SUMMARY , 1981 .
[3] Moshe Dror,et al. A computational comparison of algorithms for the inventory routing problem , 1985 .
[4] Moshe Dror,et al. A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..