IMPROVED TABU SEARCH ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

Abstract

This paper presents the Metaheuristics algorithms, we called Improved Tabu Search algorithm (ITS). This algorithm addresses on Vehicle Routing Problem with Time Windows (VRPTW), one of NP-Hard problems. ITS algorithm is used to reduce number of vehicles and total travel distance in transportation. Authors introduce the improvement of well-known Tabu Search algorithm by 2-phases construction method and new move operator by combination relocation with reconstruction. The experiment based on the benchmark Solomon [1] with 56 cases yields some promising results.