Aplikace vícenásobné úlohy obchodního cestujícího na plánování trasy merchandisera

The aim of this empirical bachelor thesis is to create a mathematical model, whose solution will enable to compile a monthly route plan for the merchandiser. The theoretical part consists of merchandiser job description and a description of circuit creation without using mathematical methods. The other half of this part includes an overview of mathematical models, which are used in the practical part. The model is based mainly on the multiple traveling salesman problem, including the conditions flowing from the traveling salesman problem with time windows. The problem is performed by Gurobi solver in program MPL for Windows. The data used in the calculation are real and obtained from an unnamed company. Due to the complexity of the problem solving, the feasible solution of overall monthly model was not found, and the division of the model into several parts had to be made. Repeated simplification enabled the software to find the optimal solution and build a monthly route plan for the merchandiser. Based on the results obtained, a comparison between the original solution of the company and my solution is given. Then, urban public transport circuits are compared with those using a passenger car. While the first comparison does not report big differences, car use shows significant time savings. This information could encourage the company to start providing corporate cars to merchandisers.