Tabu Search Heuristic for Vehicle Routing problem with split delivery

Abstract

In the classical definition of Vehicle Routing Problem (VRP), a truck visits only a single customer, if the customer requests the number of products exceeding the capacity of a vehicle shall allow the application classical VRP unreasonable. The Split Delivery Vehicle Routing Problem (SDVRP) is one of the methods are given to solve the problem mentioned above. SDVRP is a method which contrary to what has been assumed by classical VRP: a customer can be served more than one truck if their demands exceed the capacity of the truck. In this thesis, I present a mathematical model and a method to solve the mathematical model on this important problem.