A constructive heuristic algorithm with dynamic travel speed for solving waste collection VRPTW

This paper investigates the impact of heuristic algorithm with dynamic travel speed of waste collection vehicles in solving a real life waste collection vehicle routing problem with time windows (VRPTW) benchmark problem.The benchmark problem consists of ten sub problems, involving up to 2092 customers.Previous studies solved this problem using heuristic algorithms with assumption that the vehicles are travelled with static speed when collecting the waste.This paper uses the same constructive heuristic algorithm proposed in the previous study namely, Different Initial Customer (DIC).But here, we consider the vehicles are travelled with dynamic speed based on the vehicle’s load. Comparison results with the previous study show that DIC with dynamic travel speed gives effect to the waste collection problem in terms of the total distance travelled, total travel time as well as the number of vehicles used.