VND in CVRP, MDVRP, and VRPTW cases

Abstract

Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to the customer, to get the minimum cost delivery route. To get optimal results, it is necessary to improve route from the initial solution. Variable Neighbourhood Descent (VND) is one of the metaheuristics that examine of a number of neighbourhood operators to get the optimal route. A VRP route is called optimal if there are no other routes that can be generated from all the neighbourhood operators used in VND. This article describes the application of VND to get the optimal route on CVRP, MDVRP, and VRPTW. The results of the experiment on some test data used indicate that VND can be used to get more optimal length and travel time route.