|
|
Initialization for optimization of real world vehicle routing problem
Volf, Robin ; Klhůfek, Jan (referee) ; Sedlák, David (advisor)
The goal of this work is to optimize the initialization phase in solving the rich vehicle routing problem on a specific dataset which comes from a czech logistics company's data. This dataset has characteristics of VRPTW, VRPSPD and HFVRP. A modified cheapest insertion heuristic was chosen for the solution. Cost calculation consists of six partial costs which reflect individual constraints. Proposed heuristic is able to solve the instances in a matter of few seconds. Construction heuristic which generates valid solutions in short time enables more effective optimization in latter parts of solution.
|
|
| |
|
| |
|
|
Reducing Peer-to-Peer Network Traffic
Šípoš, Martin ; Tobola, Jiří (referee) ; Žádník, Martin (advisor)
Bachelor thesis deals with peer-to-peer detection watching and reducing bandwith. An application was created for this purpose that is able to detect watch and control such networks at application layer or to block specified ports using opensource utilities. The application was created in Java language and is dedicated to Linux operating system.
|
|
| |
|
|
Optimization of prestress tendon path
Středulová, Monika ; Lehký, David (referee) ; Eliáš, Jan (advisor)
The thesis explores possibilities of applying genetic algorithms on the problem of finding the optimal prestressed concrete tendon path. The objective of the thesis is to develop a genetic algorithm based on the Automatic Dynamic Penalization method and to test its robustness on selected analytical functions. Subsequently, the algorithm is connected to a Time Dependent Analysis module for the computation of prestressed concrete structure to solve selected examples of prestressed beams in the form of a constrained optimization problem. The algorithm is developed in the Python programming language with the help of the Distributed Evolutionary Algorithm library.
|
|
|
Mathematical models for transportation problems
Brzobohatý, Jan ; Hrabec, Dušan (referee) ; Popela, Pavel (advisor)
This bachelor's thesis deals with stochastic dominance. The goal is to lay the foundations for defining stochastic dominance, to describe its properties and to explain this term on simple examples. Another goal is to apply this term to network problems with random transport price. Examples in this thesis also contain solutions and code to find these solutions written in GAMS language.
|
|
|
Non-Returning Turing Machines
Surovič, Marek ; Vrábel, Lukáš (referee) ; Meduna, Alexandr (advisor)
This work introduces a restricted variant of the Turing machine which cannot move left, thus return on its tape. Other properties, such as the potentially infinite symbol tape or the ability to rewrite symbols on the tape, remain unchanged. By introducing this restriction we limit the expressive power of the Turing machine to the point, where a non-returning Turing machine is equivalent to a finite automaton and can be transformed into one. A transformation algorithm is presented and described in detail.
|
|
|
Recursive Web Search in KDE
Hefka, Lukáš ; Burgetová, Ivana (referee) ; Burget, Radek (advisor)
The bachelor thesis deals with problems related to web sites browsing from the KDE desktop environment. Part of this thesis is to introduce the application interface of this environment, suggestion description and application amplementation. The thesis supports range of restrictions both for searching area and searching itself. Application goes through the internet with the help of recursion and hypertext links. In conclusion there are descriobed application advatages in comparison with other alternative.
|
|
| |
guest ::
