Improvement of solution using local search method by perturbation on VRPTW variants

Abstract

One application of graph theory is to optimize the distribution problem. This problem can be solved using Vehicle Routing Problem with Time Window (VRPTW) model and its variants such as VRPTW, CVRPTW dan OVRPTW. This article comprehends the improvement of the solution with the local search method using perturbation on those variants. There are three parts in the method: generating an initial solution, improvement using local search, and perturbation. The initial solution was generated using the sequential insertion algorithm, the local search process used inter-route and intra-route operators, and the perturbation using ejection chain and double swap. Result of experiments showed that perturbation using double swap gave a better solution than ejection chain. This caused by two-times movement in the double swap that could examine all optimal solution possibilities. An example of implementation the VRPTW variant on distribution optimization is given in this article.