|
|
Statistical analysis of data from routing problems
Mazlová, Lenka ; Popela, Pavel (referee) ; Šomplák, Radovan (advisor)
This bachelor thesis focuses on statistical analysis of data retrieved from real waste collection. The main goal is to become familiar with statistical hypothesis testing and model creating typical for mathematical statistics and to determine key parameters that affect routing problems. One of the outputs of this thesis is a Microsoft Excel file that contains statistical tests described in following text.
|
|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
|
Statistical analysis of data from routing problems
Mazlová, Lenka ; Popela, Pavel (referee) ; Šomplák, Radovan (advisor)
This bachelor thesis focuses on statistical analysis of data retrieved from real waste collection. The main goal is to become familiar with statistical hypothesis testing and model creating typical for mathematical statistics and to determine key parameters that affect routing problems. One of the outputs of this thesis is a Microsoft Excel file that contains statistical tests described in following text.
|
|
|
The Optimization of Maintenance of Bus Stops
Svobodová, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The aim of my thesis is to find the shortest total route to export trash at the bus stops for several variants and also determine the suitability of approximate algorithms. The tasks are solved by insertion heuristic, closest neighbor heuristic and optimization. The optimal solution is gained by using the system LINGO and by using optimization solver CPLEX. In my thesis I first describe the problem of maintenance of bus stops. Following chapter is devoted to the role of routing problems, its classifications, problems to solve, possibilities of solution. The used methods are Traveling Salesman Problem with one or multiple vehicles available in a unique depot and Vehicle Routing Problem with one or multiple vehicles available in a unique depot or multiple depots. The last chapter describes and compare the results of the solution of insertion heuristic, closest neighbor heuristic and optimization for problem of replacement of bus schedules and of maintenance of bus stops.
|
|
|
Optimalization of the beer distribution in Jesenicko
Krčmář, Pavel ; Fábry, Jan (advisor) ; Suchánková, Tereza (referee)
The thesis deals with application of models of routing problems on a real problem, beer distribution in Jesenicko region provided by Viden plus, a.s. The goal of the thesis is to optimize daily distributional routes for two vehicles with different capacities. Total distance has to be minimized respecting time and capacity limits. In case the optimal solution is not found, sub-optimal solution will be accepted. Solutions are calculated with use of the optimization software LINGO and some heuristic methods. Models of travelling salesman problem and vehicle routing problem are used to find the solutions. Results are compared to the current state of distributional routes in conclusion of the thesis.
|
guest ::
