Abstract
In this paper, we focus on a more generic version of the Pickup and Delivery Problem with Time Windows (PDPTW). PDPTW requires servicing of pairs of pickup and delivery customers. We take a step further by considering not just pickup and delivery pairs, but also pure pickup and pure delivery customers. Comparison with related vehicle routing problems shows that our problem is in fact much more general. By extending metaheuristic techniques used to solve the Vehicle Routing Problem with Time Windows (VRPTW) and the PDPTW, we found solutions for 56 test instances constructed from Solomon's benchmark VRPTW data sets.
Recommended Citation
Li, Haibing; Lim, Andrew; and Lim, Hongping, "Solving the pickup and delivery problem" (2002). PACIS 2002 Proceedings. 91.
https://aisel.aisnet.org/pacis2002/91