Home > Search Results: keywords:"randomized heuristic"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
TTT method for the comparison of randomized heuristics
 Novotná, Petra ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
There are many heuristics proposed for practical uses of the postman problem, which reach only approximate solutions, however in real time. Regarding the number of solutions of the postman problem, the efficiency of the heuristic is important to the solver, and that is the reason why the goal of this thesis is to compare the efficiency of different algorithms. In the first part of the thesis, the theory for understanding the comparison is described, which is further used for comparing the efficiency of five modifications of randomized heuristics solving delivery problems using the postman problem with capacities. Variants of solutions are launched on several differently complicated problems with optional edges and with multiple vehicles departing from a single depot. The results are shown in plots. A probability of the ability of one modification to reach the given target value in shorter time than the second modification is computed for more precise evaluation. The assumption is different efficiency when solving a problem of small and large scale.
Detailed record
Capacitated Arc Routing Problem
 Franc, Zdeněk ; Pelikán, Jan (advisor) ; Fesenko, Anastasiya (referee)
The Capacitated Arc Routing Problem has many applications in real life. The aim of this problem is to minimize the total cost at fulfilment of the requirements of arcs. The Capacitated Arc Routing Problem is an extension of the Chinese Postman Problem, which is a special type of the Vehicle Routing Problems. In this thesis is explained the issue of the Chinese Postman Problem and its extensions at first. Subsequently the applications of mathematical models are illustrated on a model example. However these mathematical models, which are searching the optimal solution, do not use so much in reality. Therefore the randomized heuristic algorithm for solving these problems is suggested and programmed in this thesis. Subsequently this heuristic was applied to case study of garbage collection in Podebrady city.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English