A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

A study was conducted to evaluate a parallel route building algorithm. The study considers an application of the algorithm to the vehicle routing and scheduling problem with time windows (VRSPTW). Results show that the parallel approach exhibits much better solutions compared to the sequential approach for pure random and mix random problems. However, the sequential approach outperforms the parallel approach in solving pure clustered problems.