For more than 150 years, timber indicators have been used for forest harvest scheduling in the region of current Czech Republic. With social changes and increased importance of forest yields and functions, there has been significant changes in forest management during this time. The changes in ownership structure after 1989 are most problematic from a sustainability standpoint. Also, the timber indicators cannot consider forest age structure, which is not ideal because even small changes related to abiotic and biotic disturbances may inhibit forest planning efforts. These changes to forest ownership and structure combined with current timber indicators make it difficult to ensure sustainable harvest levels over long time horizons. Methods of operations research, such as mathematical programming and heuristic methods, provide alternatives to historical harvest scheduling methods because they can account for forest age structure and spatial relationships over long scheduling horizons.

Minimal length of a travelling salesman's problem had been studied in this diploma these. Travelling salesman must come trough each place just once and then go back to the starting place. This problem can be illustrated as a problem of graph theory, such that places are the vertices, roads are the edges, distances of roads are the lengths of edges. The optimal travelling salesman's problem tour is the shortest Hamiltionian cycle in the graph. It is a classical NP-complete problem. There is no algorithm that solves this problem in polynomial time. This problem can be solved by using various approximation algorithms, they offer less time consumption and lowest quality than optimization. This diploma these had been dedicated to approximation algorithms, for example: nearest neighbor method, minimal spanning tree method, Christofide's method, 2-opt., genetic algorithm, etc.

This thesis is focused on optimizing the routes which are implemented in our country at night. Goods are transporting between designated central cities. It deals with creating cyclic routs, along which the goods should be effectively transported, with the respect of the cost. The instruction how to create these paths represents a heuristic method for generating cyclic paths. The algorithm uses the results provided by model that is based on a search for multiple product chart. The chart contains the minimum number of vehicles that provide transport and individual amount of transported goods. The principle of this heuristic method is to create cyclic paths in such a way to be able to serve all transportation requirements with the lowest number of reloads. This approach leads to the fact that the direct paths are preferred.

In this thesis, a portfolio optimization with integer variables which influence optimal assets allocation in domestic as well as in international environment, is studied. At the beginning with basic terms, assets and portfolio background, incentives of portfolio creation, fields of portfolio application and portfolio management is dealt. Following the characteristics of assets and portfolios (expected return, risk, liquidity), which are used by investors to value their properties, are introduced. Next the mean-risk models are derived for the measures of risk - variance, Value at Risk, Conditional Value at Risk and prepared for a practical application. Heuristics implemented in Matlab and standard algorithms of software GAMS are used for solving problems of the portfolio optimization. At the end optimization methods are applied on real financial data and an outputs are compared.

Increasing waste production is the reason why it is important to focus in more detail on profitable and cost side of waste economy. This diploma thesis deals with the area of garbage collection as a fundamental part during garbage their cumulation in a particular location and follow-up liquidation or preservation. At first the theoretical background of Chinese Postman Problem is described as a cornerstone for garbage collection models. Extensions of this problem have to be considered to be closer to reality. Then waste management in the city of Poděbrady is thoroughly described. In the final part of diploma thesis aforementioned theoretical models are applied on real data obtained from the city of Poděbrady waste department. Heuristic algorithms are an essential part of thesis as a replacement of optimizations models that cannot be used in some cases due to high requirements on computational time.

This diploma thesis deals with genetic algorithms and their properties. Particular emphasis is placed on finding the influence of mutation and population size. Genetic algorithms are applied on inverse heat conduction problems (IHCP) in the second part of the thesis. Several different approaches and coding methods were tested. Properties of genetic algorithms were improved by definition of two new genetic operators – manipulation and sorting. Reported theoretical findings were tested on the real data of inverse heat conduction problem. The library for easy implementation of GA for solving general optimization problems in C ++ was created and is described in the last chapter.

Title: Pupil's personality and solving problems of school Mathematics by heuristic strategies Author: Mgr. Markéta Škutová Supervisor: prof. RNDr. Jarmila Novotná, CSc This thesis deals with the relationship between the type of pupil's personality in the dimension of information reception and their ways of solving problems of school Mathematics with the use of heuristic strategies at the lower secondary education of basic school and in the corresponding years of grammar schools. The theoretical part summarizes the knowledge of heuristic strategies in the teaching of mathematics at the lower secondary education of basic school and their application on examples. Furthermore, the theoretical basis of type theory and its use in education is explained. In the practical part the results of the typological questionnaire are presented and an extensive qualitative analysis of the student's problem solving is offered. The resulting findings are supported by concrete examples of students' solutions. In this diploma thesis, there is evidence that the intuitive pupils use the heuristic strategies of problem solving more often than the sensory pupils and are more successful in solving non-traditional tasks. Keywords: heuristic strategies, MBTI, type theory, problem solving

In this thesis we report several of delivery problems. Here it is mostly describe Vehicle Routing Problem and Split Delivery Problem as suitable methods for the case study of the company Baťa a.s.In this thesis we used one of the most sofisticated software Roadnet Transportation Suite as effective program for distribution and planning routes.Finally we construct analysis as a support to find the optimal solution for the final strategical decision of the company Baťa a.s.

This thesis focuses on a description of the split delivery vehicle routing problem (SDVRP), in which the restriction that each customer has to be visited exactly once is not assumed, contrary to the classical vehicle routing problem, and split deliveries are allowed. Considering the fact that the split delivery vehicle routing problem in NP-hard, a number of heuristic algorithms proposed in the literature are presented. Computational experiments are reported and the results show that the largest benefits of split deliveries are obtained in case of instances with fairly specific characteristics and also several drawbacks of implemented Tabu Search algorithm (SPLITABU) are point out.

This thesis deals with the optimization of distribution of products to consumers based on a real case study of a particular company from Opava. For this purpose, a mathematical optimization model is used to illustrate the vehicle routing problem. The study will also offer an explanation on the relevancy of heuristic methods, mainly with respect to their application in solving real life situations analogous to the one surveyed. On the basis of chosen heuristic methods (i.e. the nearest neighbour algorithm and the savings algorithm) and having taken into account the restricting conditions of the company, four algorithms were designed. These four algorithms are programmed in Visual Basic for Applications MS Excel 2007. They are aimed at solving the real problems with the distribution of ordered products that the particular company must deal with. The thesis compares the results provided by an employee of this company, and the results presented by the designed algorithms.