“…A dynamic programming algorithm using labeling techniques to handle the precedence, capacity and time constraints, can be used to solve this shortest path problem Dumas, Desrosiers, and Soumis 1991]. However, for instances with many transportation requests and time and capacity constraints that are not very tight, solving S k to optimality becomes computationally prohibitive.…”