Time dependent vehicle routing

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.

20p toritori 11-05-2020 9 1   Download

This paper proposes a vehicle travel speed model to enhance two heuristic algoritihms from previous studies, namely current initial solution (CIS) and different initial customer (DIC). Both algorithms are used to solve a real-life waste collection vehicle routing benchmark problem with dynamic travel speeds. This problem is referred to as Time-Dependent Vehicle Routing Problem (TD-VRP) in previous literature.

25p meriday 20-04-2019 15 2   Download