Journal of Advanced Mechanical Design, Systems, and Manufacturing
Online ISSN : 1881-3054
ISSN-L : 1881-3054
A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem
Yoshitaka NAKAOHiroshi NAGAMOCHI
ジャーナル フリー

2007 年 1 巻 2 号 p. 217-226


We consider a discrete-type split delivery vehicle routing problem, in which delivery goods for a customer consist of a set of items, each item is required to be serviced by exactly one vehicle, and each customer is allowed to be visited more than once. In this paper, we propose a fast algorithm that constructs a set of routes one by one without any improvement procedures. The algorithm generates routes by dynamic programming based on an elaborate route evaluation function that estimates the total travel cost required to service all the remaining items by vehicles. Experimental results on real-world instances are reported.

© 2007 by The Japan Society of Mechanical Engineers
前の記事 次の記事