Abstract
One of the crucial activities undertaken by companies to meet customer demands is distribution. Distribution involves several challenges, one of which is determining optimal vehicle routes. This research aims to determine effective and efficient product distribution routes. The Nearest Neighbour and Tabu Search methods are employed to address the distribution route problem. The research results indicate that using the Nearest Neighbour method saves 17.7 km, 388.75 minutes, and Rp 40,430.77 compared to the company's initial routes. Meanwhile, the Tabu Search method yields savings of 21.25 km, 412.1 minutes, and Rp 43,525.64 when compared to the initial company routes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Prosiding Seminar Sosial Politik, Bisnis, Akuntansi dan Teknik
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
