A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries.