Study of the General Variable Neighborhood Search (GVNS) algorithm and Variable Neighborhood Search (VNS) algorithm in CVRPTW

Abstract

The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is one of the variants of the Vehicle Routing Problem (VRP), which is the problem of determining the optimal route from the depot to the customer which is located spread out with different requests. In CVRPTW problem solving considers capacity and time constraints. Determining the optimal route can reduce costs and energy spent during the distribution process. The General Variable Neighborhood Search (GVNS) algorithm can be applied to the CVRPTW problem. GVNS is a VNS algorithm whose solution is improved using RVND. The GVNS algorithm begins with finding the initial solution, followed by randomization of the solution using perturbation, and then the repair procedure is carried out using RVND. Perturbation and improvements to the GVNS algorithm are performed repeatedly according to a predetermined maximum iteration. The GVNS algorithm has never been applied to CVRPTW. Therefore, in this research, the GVNS algorithm will be implemented on CVRPTW which then the results will be compared with the VNS algorithm. The GVNS algorithm for CVRPTW is implemented using the Borland Delphi 7.0 programming language. The program has been tested using 3 datasets, each consisting of 50 points. The experiment was carried out 10 times which then resulted in the optimal solution and compared with the solution from the VNS algorithm. Based on the solution obtained, the GVNS algorithm is better than the VNS algorithm on the three datasets that have been tested. The product in the form of this application can be used more practically to solve CVRPTW problems using the GVNS algorithm.