A new approach to solve MDVRP in lower computation time

Abstract

Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically.