A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approach based on Electromagnetism and simulated annealing algorithms is proposed. The purpose of such a combination is to have the benefits of both algorithms. Simulated Annealing (SA) algorithm is powerful in escaping from local optimums. On the other hand, Electromagnetism (EM) algorithm generates wide varieties of solution populations. The computational results of some instances are reported and then these results are compared with the lower bound of problem. The results demonstrate the effectiveness of the metaheuristic algorithm in solving this model.