Heuristic with elements of tabu search for Truck and Trailer Routing Problem
This work addresses a specific logistics routing problem, but it appears incremental as it applies a known heuristic method to a variant without demonstrated broad impact.
The authors tackled the Site-Dependent Truck and Trailer Routing Problem with hard and soft time windows and split deliveries (SDTTRPTWSD), an NP-hard combinatorial optimization problem, by developing a heuristic with elements of Tabu Search that uses neighborhoods and visits infeasible solutions, but no concrete results or numbers are provided.
Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, Site-Dependent Truck and Trailer Routing Problem with hard and soft Time Windows and Split Deliveries is considered (SDTTRPTWSD). In this article, we develop a heuristic with the elements of Tabu Search for solving SDTTRPTWSD. The heuristic uses the concept of neighborhoods and visits infeasible solutions during the search. A greedy heuristic is applied to construct an initial solution.