Solving vehicle routing problem with tabu search algorithm

https://doi.org/10.65136/jati.v6i1.155
Tabu search algorithm vehicle routing problem tabu list tabu tenure

Authors

  • Thian Shan You School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Beh Chi Hao School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Lau Shan Hui School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Zailan Arabee bin Abdul Salam
    zailan@apu.edu.my
    School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia https://orcid.org/0009-0003-4288-0843
  • Lau Wai Cong School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
Vol. 6 No. 1 (2022)
Original Research
January 16, 2026

Downloads

Tabu Search (TS) algorithm is one of the popular metaheuristics applied in the Vehicle Routing Problem (VRP). In this paper, we look at an implementation of VRP using the TS algorithm and modify its parameters to observe the results of the changes. Similar works to this project are reviewed, the implementation of TS and VRP used was discussed, and modifications to the source code were made. Three tests conducted looked at the max iteration, Tabu tenure, and expanding the problem parameters, and the results showed that optimal parameters could be obtained for smaller problem sizes, and as the problem size increases, the effectiveness of the TS algorithm decreases.