Capacitated vehicle routing problems: Nearest neighbour vs. tabu search
Document Type
Journal Article
Publication Title
International Journal of Computer Theory and Engineering
Publisher
International Association of Computer Science and Information Technology
School
School of Business and Law
RAS ID
28277
Abstract
The purpose of the Vehicle Routing Problem is to obtain a vehicle route with a minimum mileage in meeting customer demand according to their respective locations. One variant of the Vehicle Routing Problem (VRP) is the Capacitated Vehicle Routing Problem (CVRP), namely VRP with vehicle capacity constraints. Problems with Capacitated Vehicle Routing Problems (CVRP), can be solved by using the nearest neighbour and Tabu Search Algorithm. The step to complete the Tabu Search Algorithm begins with the determination of the initial solution using Nearest Neighbour, determining alternative solutions with exchange, namely to move two points in the solution, evaluate alternative solutions with Tabu list, choose the best solution and set the optimum solution, update tabu list, then if the discharge criteria are met then the process stops and if not, then returns to the determination of alternative solutions. Based on the results of calculations using the Tabu Search Algorithm, the traveling distance is less about 10.01% than the nearest neighbor.
DOI
10.7763/IJCTE.2019.V11.1246
Access Rights
free_to_read
Comments
Masudin, I., Sa'diyah, R. F., Utama, D. M., Restuputri, D. P., & Jie, F. (2019). Capacitated Vehicle Routing Problems: Nearest neighbour vs. tabu search. International Journal of Computer Theory and Engineering, 11(4), 76-79. Available here