|
|
Bedbugs in the Czech Republic
Ptáčková, Michaela ; Rödlová, Sylva (advisor) ; Rödl, Pavel (referee)
The thesis deals with the occurrence of bedbugs in the Czech Republic. The theoretical part summarizes the most important information about bedbugs from the perspective of a public health student. In addition to the description and life cycle of the bedbug, the author also deals with the transmission and reason for the spread and health risks. Furthermore, the thesis tries to outline the role of public health authorities and the course of disinsection. In addition to analyzing the current state of knowledge, the work summarizes possibilities of the prevention in the analyzed facalities. The practical part contains the results of the questionnaire survey. The questionnaire was sent to regional sanitation stations, extermination companies and hospitals. The main research question was whether the number of bedbugs in the Czech Republic increased. Other questions are specific for the concrete type of organization. The maily questions were process of disinfestation, the role of public health and prevention.
|
|
|
Route optimization for the parcels distribution
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Čížek, Ondřej (referee)
This thesis deals with optimization problems of the parcels distribution. This issue can be solved on the ground of traveling salesman problem whose mathematical and economic model, including their modifications, are presented in the theoretical part of the thesis. We can solve these problems by using exact methods, heuristic and metaheuristic algorithms. In the theoretical part are described traveling salesman problem, traveling salesman problem with time windows, traveling salesman problem with multiple time windows and dynamic traveling salesman problem including possible ways of solution. In the practical part we can find application of problems on the real example, when we are finding the shortest possible route for the PPL's employee under different assumptions. The solution is obtained by using solver Gurobi within the modelling system MPL for Windows. In conclusion of the thesis the results are summarized and models are compared with each other.
|
|
|
The International Scope of East Turkestan Islamic Movement Terrorist Activities
Ptáčková, Michaela ; Eichler, Jan (advisor) ; Dubský, Zbyněk (referee)
As a consequence of an increasing number of terrorist attacks worldwide, terrorism has become one of the most discussed security threats. Given the globalisation of today´s world, terrorism remains an ever-present threat for all nations, including the emerging power represented by the People´s Republic of China. The evolution of the East Turkestan Islamic Movement established in the Chinese north-western province of Xinjiang Uyghur Autonomous Region therefore represents the main topic of this Bachelor thesis. The primary aim of the thesis is to analyse the development and behaviour of the movement in terms of its goals, operating territory and ties to global terrorist organisations. The secondary aim is to contribute to a broader discussion and awareness on this topic in the Czech Republic.
|
|
|
Optimization of packages transport
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This bachelor thesis deals mainly with traveling salesman problem which belongs to the distribution problems and looking for its the best solution. The principle of the solutions of this problem is finding the shortest possible route that includes all of the prescribed addresses and returns to the initial location. Every location must be visited exactly once. There are numbers of modifications such as traveling salesman problem with time windows, courier service problem, dynamic traveling salesman problem and many others. We can solve these problems by using the systems to support modelling or using heuristic or metaheuristic methods. The thesis is divided into two parts, theoretical and practical. In the theoretical part the distribution problems are described, the traveling salesman problem in detail and selected algorithms of heuristic methods. The practical part is focused on the application of these methods which helps us to find the shortest possible route, which the PPL's employee would be able to manage during one day when he distributes packages. The solution is obtained by using an optimization system MPL for Windows, by application the nearest neighbour algorithm, the savings algorithm and the insert algorithm. In conclusion of the thesis all results are summarized and a mutual comparison of the calculation methods is performed.
|
|
| |
guest ::
RSS feed.