Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The periodic vehicle routing problem is a well-studied problem in which routes for capacitated vehicles are planned over a planning horizon of several periods and customers have a set of allowed visit schedules. The periodic vehicle routing problem with driver consistency (PVRP-DC) is a new version of this problem in which each customer should always be visited by the same driver. In this thesis we illustrate the use and need of solutions to this problem in the industry through interviews with three different companies. We then go on to implement three simple meta-heuristics to solve the PVRP-DC: a Tabu-search, a Simulated Annealing search and a Genetic Algorithm. We report computational results on a wide range of instances and compare these to the integer linear programming solutions from [1].