National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Stochastic location-routing problems
Tlapák, Martin ; Branda, Martin (advisor) ; Kopa, Miloš (referee)
This thesis deals with stochastic location routing problem. Multiple stochas- tic and deterministic models are formulated and it is discussed that it is difficult to solve these problems via exact integer programming methods. It is necessary to develop heuristic methods to find a solution of these problems. Multiple ver- sions of these problems are formulated and their properties and possibilities how to solve them are discussed. Therefore, the brand new Blockchain metaheuristic is developed and later used for solving stochastic location routing problem ap- plied on a waste collection problem. As a part of Blockchain metaheuristic we develop the new application of Greedy algorihtm that is used for finding initial solution. The quality of the heuristic algorithm developed by us is presented in a numerical study. 1
Assignment problem with application to heath service
Tlapák, Martin ; Kopa, Miloš (advisor) ; Lachout, Petr (referee)
This bachelor's thesis deals with the theory of the nurse scheduling problem using the theory of integer programming. That is why we define basic concepts and present basic theorem of integer programming. We present the algorithm made for solving integer programming. Next we define a basic concept of as- sigment problem. We show how to solve assigment problem by the Hungarian method. Finally we solve the real nurse scheduling problem. The nurse's pref- erences are included in our model. We are finding solution which is suitable for the labour code of the Czech Republic and the special requests of the stressful workplace. 1

See also: similar author names
1 Tlapák, Matouš
2 Tlapák, Michal
Interested in being notified about new results for this query?
Subscribe to the RSS feed.