|
|
Job Scheduling in Logistic Warehouses
Povoda, Lukáš ; Uher, Václav (referee) ; Karásek, Jan (advisor)
The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Managing and scheduling works is currently often problem. There is no simple solution due to complexity of this problem. This problem must be resolved because of a lack efficiency of work with a higher load such as during the christmas holidays. This paper describes the methods used to solve this problem focusing mainly on the use of search algorithms, evolutionary algorithms, specifically grammar guided genetic programming. This paper describes the problem of job shop scheduling on a simple theoretical example. The implemented algorithm for solving this problem was subjected to tests inspired on data from real warehouse, as well as synthetically created tests with more jobs and a greater number of workers. Synthetic tests were generated randomly. All tests were therefore run several times and the results were averaged. In conclusion of this work are presented the results of the algorithm and the optimum parameter settings for different sizes of problems and requirements for the solution. Genetic algorithm has been extended to calculate fitness of individuals with regard to number of collisions, extended to use priority rules during run of evolution, and some parts of algorithm was parallelized.
|
|
|
Possibilities of preventing the negative influence of cognitive biases on everyday decision making
Tesařová, Monica ; Stehlík, Luděk (advisor) ; Uhlář, Pavel (referee)
This bachelor thesis deals with possibilities of preventing the influence of cognitive biases on our everyday decision making, especially with the negative effect of the anchoring-and-adjustment heuristic on consumer behavior. The first chapter is concerned with human irrationality in decision making, primarily with cognitive biases. Some of the most significant types of cognitive biases that negatively affect our decision making are presented and various approaches trying to explain their origin and nature are introduced subsequently. It continues with a chapter on possibilities of the prevention of cognitive biases where the theory of debiasing is mentioned and an example of a successful debiasing strategy is presented. The last chapter of the theoretical part focuses in detail on one particular type of cognitive bias that arises from using the anchoring-and-adjustment heuristic. The aim of the empirical part of the thesis is then to propose a strategy that will, at least partially, help reducing the negative impact of this bias on our decision making in everyday situations - particularly from the consumer perspective. Another part of this is also an outline for an experimental study that would help verify the effectiveness of the proposed measures. Keywords: heuristics, cognitive biases,...
|
|
|
Heuristics for paths in maps
Kudláčková, Lada ; Mareš, Martin (advisor) ; Kratochvíl, Miroslav (referee)
The content of the thesis is a description of heuristic procedures, which are used to find the shortest paths in the graphs and verify their effec- tiveness on the actual data. It deals with heuristics for Dijkstra's algorithm, especially the A* algorithm, which uses a lower distance-to-target estimate. Heuristics are implemented and tested on the road network of the Czech Re- public. 1
|
|
|
The contribution of Daniel Kahneman to the psychology of thinking
Zelinová, Alena ; Heller, Daniel (advisor) ; Uhlář, Pavel (referee)
Bachelor thesis in the form of scoping study summarizes Daniel Kahneman contribution to the psychology of thinking. It surveys his work from the 70s of the 20th century the subjective probability, which deals with the application of heuristics and biases in the judgement of uncertain events. It continues with prospect theory which is a descriptive model of human decision making under risk, and which reveals the automatic and systematic violations of principles of rationality in decision making. After that it focuses on Kahneman's research from the 90s in the field of hedonic psychology from the perspective of a cognitive psychologist. The thesis completes with his current work popularizing the fast and slow thinking. Part of this work is a research proposal of the price of memories from holidays, aiming to verify Kahneman's concept of the difference between the experienced utility and decision utility.
|
|
|
A heuristic approach to resolving graphical point feature conflicts in large-scale maps
Pumr, Daniel ; Lysák, Jakub (advisor) ; Bayer, Tomáš (referee)
The paper deals with automation of cartographic generalization of point features by displacement and selection in large scale maps. In the first part of the thesis, the theoretical foundations of this process are introduced with emphasis on the works of authors who have dealt with its automation. The next part of the thesis describes and analyses the ZABAGED data from which the state map work is produced and on which the algorithm developed in the practical part of this thesis was tested. The main objective of the work was then to determine whether it is realistic to use a solution based on sequential intelligent testing of different offset positions of overlapping point features in practice. Within this framework, the strategies by which the state space given by the possible offset point positions can be generated and searched are identified and described. These strategies were then implemented over the ZABAGED dataset, tested and compared, and a conclusion was drawn on the applicability of this approach in automatic generalization. Key words digital cartography, cartographic generalization, generalization by selection, generalization by displacement, point features, heuristics
|
|
|
Playing the Board Game Stratego by Computer
Irovský, Dominik ; Šátek, Václav (referee) ; Zbořil, František (advisor)
The topic of this thesis is the board game of Stratego. This game features incomplete information. The goal of this thesis is research of existing game playing algorithms and, design and implementation of new solution. For the new solution modified version of Monte Carlo Tree Search as well as alfa-beta algorithm and expectimax were used. The solution was implemented as a console application with possibility of future expansion. Functionality of the solution was validated and tested using experiments. Effectivity of the final algorithm was satisfying
|
|
|
Playing the Board Game Stratego by Computer
Irovský, Dominik ; Šátek, Václav (referee) ; Zbořil, František (advisor)
The topic of this thesis is the board game of Stratego. This game features incomplete information. The goal of this thesis is research of existing game playing algorithms and, design and implementation of new solution. For the new solution modified version of Monte Carlo Tree Search was used. The solution was implemented as a console application with possibility of future expansion. Functionality of the solution was validated and tested using experiments. Effectivity of the final algorithm was satisfying
|
|
|
Operation optimization in wholesale warehouses
Kolárik, Jan ; Pangrác, Ondřej (advisor) ; Hladík, Milan (referee)
The goal of this work is to choose a strategy for given warehouse that will increase the efficiency of its operation. This is primarily about reducing customer downtime and minimizing the distance travelled by handling machines. The final program can generate warehouse structure according to given parameters and then evaluate monitored variables from simulated operations based on optimization techniques used. There is also a planar and spatial warehouse model available, which helps to visualize what is actually happening in the warehouse. The program could serve as an auxiliary tool in the organizing of wholesale warehouse operations and reduce costs required for its operation.
|
|
|
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Hric, Jan (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is NP-complete problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
|
|
|
Price Level Targeting with Imperfect Rationality: A Heuristic Approach
Molnár, Vojtěch ; Holub, Tomáš (advisor) ; Horváth, Roman (referee)
Price Level Targeting with Imperfect Rationality: A Heuristic Approach Vojtěch Molnár Abstract The thesis compares price level targeting and inflation targeting regimes in a New Keynesian model without rational expectations hypothesis. Economic agents instead form their expectations using heuristics-they choose between a few simple rules based on their past forecasting performance. Two main specifications of the price level targeting model are examined-the agents form expectations either about price level or about inflation, which is ex ante not equivalent because of sequential nature of the model. In addition, several formulations of the forecasting rules are considered. According to the results, price level targeting is preferred in the case with expectations created about price level under the baseline calibration; but it is sensitive to some model parameters. Furthermore, when expectations are created about inflation, price level targeting over time loses credibility and leads to divergence of the economy. On the other hand, inflation targeting model functions stably. Therefore, while potential benefits of price level targeting have been confirmed under certain assumptions, the results suggest that inflation targeting constitutes significantly more robust choice for monetary policy.
|
guest ::
