Optimization of vehicle routing problem with time windows using nearest neighbor algorithm and dynamic programming (case study: Pekalongan city Environmental Agency)

Vehicle Routing Problem (VRP) is defined as a route construction problem with several vehicles starting from the main depot to the location of several consumers with a certain amount of demand. VRP has several variations of the problem, one of which is the Vehicle Routing Problem with Time Windows (VRPTW). Nearest neighbor algorithms and dynamic programming are methods that can be used to solve VRPTW. The purpose of this study is to find the optimal solution of VRPTW on the garbage transportation route of the Pekalongan City Environmental Agency using the nearest neighbor algorithm and dynamic programming with the help of R Studio software. The results showed that the optimal route for driver 1 is Pekalongan City Environmental Agency - Jl. Progo - Jl. Diponegoro - Jl. Imam Bonjol - Jl. Slamet - Jl. Kurinci - Jl. KH Mansyur - Jl. Gajah Mada - Jl. Kemakmuran - Jl. Manggis – Slamaran Final Disposal Site - Pekalongan City Environmental Agency with a total travel time of 225 minutes. While the optimal route for drivers 2 is the Pekalongan City Environmental Agency - Jl. Pemuda - Jl. Wilis - Jl. Majapahit - Jl. Mataram - Jl. Sriwijaya - Jl. Merdeka - Jl. Hayam Wuruk - Jl. Urip Sumoharjo – Slamaran Final Disposal Site - Pekalongan City Environmental Agency with a total travel time of 228 minutes.