Vehicle routing problem in practice

Nowadays, one of the most widely used optimization problem is a travelling salesman problem. That is only the basic model, which is modified by various restrictions and enlargements. In the first part of this bachelor thesis we will focus on theory of distribution problems and their solutions. On the other hand in the second part we will apply the knowledge from the first part to the real task, which requires modifications. We will use the data of the supply company that delivers their orders in Prague with the limited capacities of the vehicles. We will find out the differences between minimizing the total distance and minimizing the total time for delivery, as the distance and time are not linearly dependent. It will be needed to decide, where will be an optimal location for opening the second branch. To solve this tasks, we will not use only heuristic methods for manual calculation, but also optimization software