Performance of the ALNS-TS and TLS-RVND algorithm on VRP variant and its application to transportation tissues

There are many problems that can be solved with the VRP variant, one of which is the solution to the problem of transporting the distribution of goods from one place to another. The focus of the discussion in this article is the performance of the ALNS-TS algorithm and the TLS-RVND algorithm for solving VRP variants and their implementation. The main stages of the ALNS-TS algorithm on the VRP variant are the solution initialization stage, the perturbation stage and optimal conditions. The TLS-RVND algorithm stage is the formation of an initial solution using the Sequential Tnsertion algorithm, repairing the solution with Random Variable Neighborhood Descent (RVND) and perturbation procedures. Based on the total mileage aspect obtained, the application of the ALNS-TS algorithm to the VRP variant produces a smaller solution compared to the VND algorithm and the TLS-RVND algorithm but the same solution as the GVNS algorithm. An example of program implementation is given for the transportation problem. Program inputs include distance, demand, service time, number of vehicles, vehicle capacity, time window, vehicle speed, MaxTter, and MaxTterTLS. The output of the program is in the form of route results, distance traveled, travel time, number of vehicles used, and graphical visualization.