The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics
An algorithm that can tackle time dependent vehicle routing problems with hard or soft time windows without any alteration in its structure is presented. Analytical and experimental results indicate that average computational time increases proportionally to the number of customers …