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.