Home > Search Results: Künzelová, Barbora
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. 
Vehicle routing problem with heterogeneous fleet
 Künzelová, Barbora ; Pelikán, Jan (advisor) ; Borovička, Adam (referee)
The master's thesis deals with the new modification of vehicle routing problem -- 3PL vehicle routing problem with heterogeneous fleet and split delivery. In addition to classical vehicle routing problem, we consider a heterogeneous suppliers fleet and also external carrier, which charges a fixed value per unit of transported goods. The reader is first introduces to vehicle routing problem, its history and possible solutions. Furthermore, the reader is acquainted with logistics and logistics providers. In the main part of this thesis is described 3PL vehicle routing problem and its mathematical model. At first we try to get optimal solution via CPLEX solver. But since this is an NP-hard task, heuristic method is proposed (in two variants) for solving this problem. The heuristic is then tested on the selected test tasks. Results obtained using the proposed heuristics are compared with the optimal solution. Even larger problems are then solved using this heuristics. In the end other modifications and possible improvements of this heuristic method are proposed.
Detailed record
Recreational mathematics problem solving as an integer programing problems
 Künzelová, Barbora ; Jablonský, Josef (advisor) ; Rada, Miroslav (referee)
The bachelor thesis deals with the solution of three selected recreational mathematics problems using discrete optimization. These problems are called Gridspeed Puzzle, Shifty Witnesses and Alien Tiles. The reader first learns the rules of these games of which are then formulated mathematical models that are integer in all cases. The first two games have one model and are being solved one way, but in game Alien Tiles are solved several optimization problems. All models are rewritten MPL modeling language in which they are solved by solver CPLEX. For all selected problems are found optimal integer solution, which is then described and explained to the reader. The solution results of the task Alien Tiles are finally compared and we are able to tell that one form of the desired outcome of the game is more difficult to calculate.
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