Implementation of the ACS-RVND algorithm on the VRP variant and its application to distribution optimization (original) (raw)

Journal of Physics: Conference Series, 2022

Abstract

Distribution optimization has an important role to distribute products to consumers. The selection of the right route will have an impact on the distribution process resulting in minimal costs. The application of graph theory that can be used to determine the optimum route in the distribution process is the study of the Vehicle Routing Problem (VRP) variant. The VRP variants discussed in this article are MDVRP and VRPTW. The method used to solve the VRP variant of this article is the ACS-RVND algorithm. The ACS-RVND algorithm consists of several main stages, namely the initial solution formation stage using the ACS algorithm, the solution improvement stage using the RVND procedure and the acceptance criteria stage. The data needed for the application of the ACS-RVND algorithm in solving the distribution optimization problem of MDVRP cases are the number of depots, the number of customers, the capacity of the vehicle, the number of ants, the number of iterations, the number of custom...

Darmawan Satyananda hasn't uploaded this paper.

Let Darmawan know you want this paper to be uploaded.

Ask for this paper to be uploaded.