You are here

Single Vehicle Routing with a Predefined Customer Sequence and Multiple Depot Returns

Tsirimpas, P., Tatarakis, A., Minis, I. And Kyriakidis, E.G.

European Journal of Operations Research, vol. 187, n.2, 2007, 483 - 495.

The optimal routing of a single vehicle with limited capacity that delivers one product to n clients according to a predefined client sequence can be determined using dynamic programming. In the present paper we propose and investigate three practical variations of this problem: (i) the case of multiple-product deliveries when each product is stored in its own compartment in the vehicle, (ii) the case of multiple-product deliveries when all products are stored together in the vehicle