doi: 10.7763/IJCTE.2019.V11.1246
Capacitated Vehicle Routing Problems: Nearest Neighbour vs. Tabu Search
Ilyas Masudin1
,
Risma F. Sa’diyah1 ,
Dana M. Utama1 ,
Dian Palupi Restuputri1 ,
Ferry Jie2
- 1Universitas Muhammadiyah Malang, Jln. Raya Tlogomas 246 Malang, Indonesia
- 2School of Business & Law, Edith Cowan University, Australia 270 Joondalup Dr, Joondalup WA 6027, Australia.
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.
Keywords
- Algorithm Tabu search
- capacitated vehicle routing problem (CVRP)
- vehicle routing problem (VRP)
How to Cite
Ilyas Masudin, Risma F. Sa’diyah, Dana M. Utama, Dian Palupi Restuputri, and Ferry Jie, "Capacitated Vehicle Routing Problems: Nearest Neighbour vs. Tabu Search," International Journal of Computer Theory and Engineering, vol. 11, no. 4, pp. 76-79, 2019. https://doi.org/10.7763/IJCTE.2019.V11.1246
Copyright & License
Copyright © 2019 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).