Iterative local search heuristic for truck and trailer routing problem
Vehicle Routing Problem is a well-known problem in logistics and transportation. There is a big variety of VRP problems in the literature, as they arise in many real-life situations. It is a NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible in real-life formulations. There is an important subclass of VRP, which is called Truck and Trailer Routing Problem. For this class of problems, every vehicle contains truck and, possibly, trailer parts. In this work, Site-Dependent Truck and Trailer Routing Problem with Hard and Soft Time Windows and Split Deliveries are considered. We develop an Iterative Local Search heuristic for solving this problem. The heuristic is based on the local search approach and also allows infeasible solutions. A greedy heuristic is applied to construct an initial solution.