Graph theory is a large mathematical discipline. Chinese postman problem falls under category of arc vehicle routing problems. Chinese postman problems are very extensive and difficult to calculate in practice. They belong to NP-hard problems. For this reason, heuristics are proposed to provide acceptably good solution in polynomial time. The focus of this thesis is to propose a randomized heuristic which does not follow deterministic rules but is ruled by random. Monte Carlo simulation is launched to find the best solution. Heuristic is formulated for undirected capacitated rural postman problem. It is programmed in VBA and validated on testing problems. At the end of the thesis is a case study about municipal garbage collection.

This Master's thesis focuses on the area of pallet loading problem. It compares qualities of solutions generated by genetic algorithm to 5-block heuristics. Based on obtained information it focuses mainly on the stability of the distribution of boxes on a pallet. As a part of the thesis a testing environment was implemented with algorithms aforementioned.

This thesis is aimed on time frame distribution task. In the theoretical part is described the mathematical model of this task and introduced in detail two concrete heuristics: greedy look-ahead and AKRed. In the practical part of the thesis has been a real situation solved with using of sophisticated optimalization software and through own implemented heuristic. These two solution are then compared each other and applicability of each heuristics for the given real problem is evaluated.

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.

This work is based on an assumption that human decision-making process is following several approximate rules (heuristics) that causes predictable and systematic errors in judgement (cognitive biases). Although this stand point is typical for fields like behavioural economics or behavioural law and economics, there is no reason to not apply this logic also on other discipline like a mass media communication studies. This work offers an analysis of the information market where supply side is represented by producers of information (e.g. media organizations) and demand side is represented by consumers of those information (audience). The analysis is focused on factors that cause perceived description of a particular event can vastly differ from this event. One of those cognitive biases which cause different perception of the same media content is called hostile media effect. In respect to this effect, sympathizers with a socially controversial topic tend to perceive information in the mass media as hostile to their own opinion. Previous research concluded that hostile perception is mainly caused by a reach of information which is explained by the selective categorization - although individuals with different worldview can see the same content, they perceive it with a different valence. The valence of the...

The orienteering problem is one of the newer problems in the field of discrete programming. The formulation of this problem originates from a sport discipline, called orienteering. In the beginning of this thesis a formulation and mathematical model for this problem are introduced. The extension of the problem is the team orienteering problem, described in the next chapters of theoretical part. Many heuristics were published for this problem. While the heuristic of Chao et al. and a path relinking approach are described in detail in this thesis. Practical part deals with the team orienteering problem applied to a real task, specifically a visiting of 23 attractions in the New York in different number of days. The solution is found by optimization program Lingo 90 and by heuristic of Chao el al. Heuristic algorithm was implemented in programming language Visual Basic for Application. A comparison of the results is described at the end of the practical part.

This thesis deals with real logistic problem of the Heineken CZ Company. The company sets down an itinerary for each vehicle to distribute its goods to particular customers on daily basis. These itineraries are created manually, only with the skill of experienced driver. The goal of this thesis is to find a solution with an algorithm, which will be able to set optimal itineraries of all vehicles, so the total distance and therefore operating costs are minimized, with only the knowledge of distances between each two nodes.

This thesis demonstrates practical using of vehicle routing problem with time windows (VRPTW) and its solution by heuristic method. There are described teoretical principles of integer models, mathematical definitions of VRP with one or more vehicles, VRPTW and some heuristics for VRP. The practical part is solution of VRP by heuristic nearest neighbor. Product distribution is planed according to the firm settings in Prague. I compare existing situation and computed solution that show benefits of using described methods in conclusion.

The thesis deals with application of models of routing problems on a real problem, beer distribution in Jesenicko region provided by Viden plus, a.s. The goal of the thesis is to optimize daily distributional routes for two vehicles with different capacities. Total distance has to be minimized respecting time and capacity limits. In case the optimal solution is not found, sub-optimal solution will be accepted. Solutions are calculated with use of the optimization software LINGO and some heuristic methods. Models of travelling salesman problem and vehicle routing problem are used to find the solutions. Results are compared to the current state of distributional routes in conclusion of the thesis.

This thesis is devoted to the construction of new waste-to-energy plants in a territory where is already another fossil-fuel power station in operation. The aim is to create a mathematical model and prove that those two devices are able to cooperate effectively using same technology. Exactly assembled model under real operating have characteristics of a mixed integer nonlinear programming. The optimization software GAMS is used for its calculation. The complexity of the model, however, is at a level that solutions in bad initial conditions ends in local optima, or not found at all. This thesis is devoted to the elimination of non-linearity using binary variables and heuristic so the task was solved with acceptable time limits to guarantee an optimal solution.