Solution approach for the split delivery vehicle routing problem and an application

In this thesis, a solution approach is proposed for a real-life distribution problem. The problem that the customer demands are greater than the vehicle capacity, formulated as a multiproduct split delivery vehicle routing problem and its mathematical model established using models in literature. At a later stage, the problem model has become a heterogeneous fleet type. For the solution for multiproduct split delivery vehicle routing problem, a tabu search metaheuristic is developed. In the stage of the algorithm development, a randomized candidate list strategy is applied and the impact on the solution of the presence of the candidate list examined through literature problems. It is also determined the type of the move that can fit the structure of the problem through three different search moves. The problems in literature solved using developed tabu search metaheuristic and the obtained solutions compared with the optimal solution values of the problems.