Efficient Assignment Algorithms for Multi Depot Vehicle Routing Problem Using Genetic Algorithm

Abstract

The challenge is to find an efficient way to schedule vehicle individually so that the vehicle drive in most efficient way and the package arrives at the customer in time. In this paper, we presented an Assignment Algorithm for Multi Depot Vehicle Routing Problem (MDVRP) that minimizes the travel distance and makes package arrives at the customer in time for MDVRP. Our algorithm assign closest customer to each depot and requires each depot to attract one customer every time until all customers are assigned. The algorithm uses shortest path Algorithm to identify closest customer to each depot and assign it to that depot and then for each depot closest customer to the last assign customer is identified and assign it to that depot. The proposed Assignment Algorithm was implemented in a classical MDVRP. The result obtained was effective when compared with an existing result from literature. This shows that the proposed Assignment Algorithm is effective in minimizing travel Distance and travel time of MDVRP.)