|
|
Metaheuristic optimalization for routing problems
Novák, Vít ; Fábry, Jan (advisor) ; Melechovský, Jan (referee)
Routing problems are ones of the most famous members of the group of the classical optimalization combinatorial problems. Travelling salesman problem and problems derived from it have been attracting mathematics and analysts, since they were firstly formulated, and accelerating a development of new methods and approaches that can be used for a wide range of another real-life problems. This thesis aims to demonstrate an usefulness and a flexibility of shown metaheristic methods. Results are compared with outputs of alternative algorithms or known optimal solutions where it is possible. To fulfill this goal the VBA application has been developed. The results of experiments are presented and the application is decribed in a second part of this thesis. A reader should be sufficiently instructed which way he could choose to solve similar types of problems
|
|
|
Use of savings algorithm in messenger problem
Gőtz, Ondřej ; Fábry, Jan (advisor) ; Kobzareva, Maria (referee)
The diploma thesis deals with the use of heuristic methods for solving messenger problems. The first part focuses on the proposed vehicle routing problems, especially on travelling salesman problems and the messenger problems. For individual problems are theoretically discussed mathematical models for variants with one or more vehicles and the expansion of the use of time windows and capacity constraints. The second part introduces heuristic algorithms for the method of nearest neighbour, savings method, insertion method and the exchange method on the travelling salesman problems. Then all of the mentioned algorithms are modified for use in three variants of messenger problem. First, the disposition of one vehicle, the second allows more messengers in the same starting point and the last option is more messengers at different starting points. The last part describes computational experiments and comparison of results provided by different methods. The diploma thesis includes application for solving messenger problems using savings methods programmed in Visual Basic for Application in MS Excel.
|
|
|
Heuristic methods for messenger problem
Kobzareva, Maria ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This work describes static and dynamic problems with one messenger or multiple number of messengers and suggests a possibility of solving such problems with modified heuristic methods. To solve messenger problem, modified nearest neighbor heuristic, modified insertion heuristic and modified exchange heuristic are used. The main contribution of this work are applications, developed in MS Excel, programmed with Visual Basic for Application, that can solve static and dynamic problems with one messenger or multiple number of messengers and that could be beneficial for companies that do business in messenger services.
|
|
|
An optimization of messenger services
Karbusická, Martina ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
Logistics industry has experienced a great development in recent years and messenger companies are becoming increasingly huge competitor to mail order companies specializing in express shipping. This work defines such terms as traveling salesman or messenger, compares the leading messenger companies in Prague and it is mainly dedicated to Messenger a.s. The main goal of this work is the answer the question whether it is possible to optimize the route of messenger via software and what methods to use for the solving. The VBA application in MS Excel was developed for these purposes. It uses the optimization software Lingo for solving.
|
guest ::
