Exact methods for solving VRP.

Vehicle Routing Problem (VRP) is an optimization task that consists in finding optimal routes for vehicles operating a set of customers in order to minimize costs, time or distance. For example, they find use in logistics when planning the delivery of goods fleet by the car.Exact algorithms for VRP guarantee finding an optimal solution.Their computing demands are increasing exponentially with the size of the problem, therefore, find use especially in the solution of smaller instances of VRP or as the basis for hybrid methods combining exact and heuristic approaches. The aim of the thesis is to describe various exact methods for solving VRP and selected methods in the selected programming language.