This diploma thesis deals with Ant Colony algorithms and their usage for solving Travelling Salesman Problems and Vehicle Routing Problems. These algorithms are metaheuristics offering new approach to solving NP-hard problems. Work begins with a description of the forementioned tasks including ways to tackle them. Next chapter analyses Ant Colony metaheuristic and its possible usage and variations. The most important part of the thesis is practical and is represented by application Ant Colony Optimization Framework. It is easily extensible application written in Java that is able to solve introduced problems. In conclusion this work presents analysis of solutions on test data.

Thesis is based on original self-made application programmed at VBA in MS Excel 2007. The reason to build this application was integration of simulation Monte Carlo and chosen optimization methods. The application allows do simulation of the knapsack problem and of the assignment problem with uncertainty. The parameters of these models are possible to set up as changing values in dependence of chosen probability distribution. Output of the simulation is a probability recommendation which objects should be used. Choose of objects depend on optimized models. Results of both models are represented by statistical indexes, tables of parameters and graph.

There are many distribution tasks, that vary in a number of vehicles, time windows, dividend or undivided delivery or if it is static problems or dynamic problems. In this essay I focus just on few of them. At first I put my mind to simple statistic distribution task with one vehicle. Later I extend it with time windows, when the point can be served by one car and by many cars. In the essay it will be solved the real task of distribution and delivery transportation of infusion in the hospitals. Because of the difficulty of solution I have to use the heuristic methods - Method of nearest neighbour, Savings method and Insert method. All these methods are modified by capacity requirements, time windows and also observence of the rules, which the drivers have to keep during a distribution. The aim is to minimize the distance travelled by the vehicles. And at least the company could be recommended the best solution.

This thesis consists of two parts: text and programming part. It is divided into seven chapters. Its main goal is to compare heuristics for dynamic traveling salesman problem in a few perspectives. The text part of this thesis theoretically describes heuristic methods and in the programming part are wake up to life via VBA in MS Excel. The results of computational experiments on these heuristic methods are presented in the last chapter. In the first part, the traveling salesman problem and its solution are being described. Characteristic of the modification in a form of dynamic traveling salesman problem follow. Next chapter presents the programming solution chosen heuristics. The final chapter presents experimental results obtain with programmed heuristics.

The diploma thesis deals with the use of heuristic methods for solving messenger problems. The first part focuses on the proposed vehicle routing problems, especially on travelling salesman problems and the messenger problems. For individual problems are theoretically discussed mathematical models for variants with one or more vehicles and the expansion of the use of time windows and capacity constraints. The second part introduces heuristic algorithms for the method of nearest neighbour, savings method, insertion method and the exchange method on the travelling salesman problems. Then all of the mentioned algorithms are modified for use in three variants of messenger problem. First, the disposition of one vehicle, the second allows more messengers in the same starting point and the last option is more messengers at different starting points. The last part describes computational experiments and comparison of results provided by different methods. The diploma thesis includes application for solving messenger problems using savings methods programmed in Visual Basic for Application in MS Excel.

In this thesis I consider possibility to spend my vacation in one of the three countries: Spain, France, Italy. In each country I chose ten cities, which I would like to visit. I will use Travel Salesman Problem to decide the best route inside each country according to three criteria: Cost, Minutes and Transport. There is also a possibility to choose the type of transport: train or combination of train and airplane. Also I will use Weighted goal programming and Chebyshev goal programming to optimize all criteria simultaneously. In the end I will use multiple -- criteria decision analysis to compare results. According to three methods (ORESTE, ELECTRE III, TOPSIS) I will choose one of the states for my vacation. I will make all calculation in program MPL and in Excel using solver SANNA.

Routing problems are ones of the most famous members of the group of the classical optimalization combinatorial problems. Travelling salesman problem and problems derived from it have been attracting mathematics and analysts, since they were firstly formulated, and accelerating a development of new methods and approaches that can be used for a wide range of another real-life problems. This thesis aims to demonstrate an usefulness and a flexibility of shown metaheristic methods. Results are compared with outputs of alternative algorithms or known optimal solutions where it is possible. To fulfill this goal the VBA application has been developed. The results of experiments are presented and the application is decribed in a second part of this thesis. A reader should be sufficiently instructed which way he could choose to solve similar types of problems

Diploma thesis Design of software asset management tasks is focused on area of software asset management in business sector. In a time of still accelerating development of information and communication technologies is Software asset management (SAM) important component of ICT business management. Financial risks of failure to comply licensing terms or rules of licensing often exceed the value of owned software. However, the essence of SAM is not only in eliminating the financial risks, but also in enhancing ICT security or gaining competitive advantage while respecting the SAM principles. Main goal of this thesis is to analyze software asset management and design tasks to reference model of ICT management MBI. This theses is divided into two parts. First part characterizes SAM, licensing and related topics. First part is based on specialized sources and information from literary research. The output is a comprehensive summary of this issue, which serves as theoretical base for next part of this thesis. Second part is devoted to designing the task of Software asset management, the task of Software audit and defining its links to other objects in the MBI model. Furthermore, this thesis creates new objects like roles, methods or documents. Second part is based on theoretical base which was created in the first part and from consultations with IT field experts. The outputs are tasks which are implemented in the MBI model. Goal is fulfilled after creating these outputs. The benefits of this thesis are mostly the tasks extending MBI model and offering best practice for software asset management and software audit. Outcomes of this thesis should help users of reference model and IT community in general.

There are many methodologies in the field of software engineering that focus on the entire software development process. The software development process aims to provide a quality product that meets user requirements, and to deliver it on time as well as within budget. Testing is a tool for verifying the quality of software and serves as feedback in software development. Most software development methodologies are available only in English, they emphasize the actual software development and address testing only marginally. An accurately designed testing process however, may contribute to higher software quality and avoid potential problems resulting from the entire information system's failure. Current Czech methodology that focuses exclusively on testing has been developed either inside individual companies and thus is not accessible to the public, or is contained in graduate theses, where it was typically created by adapting and expanding the existing software development methodologies for testing within a particular company or team. The main objective of this thesis is to establish a methodology for testing in Czech, which is based on international practices and standards, which is not tailored to a specific organization and which can be used as guidance in defining test processes in various organizations, regardless of their specific focus. The proposed methodology is also implemented in the tool EPF Composer that enables administration of methodology and its publication in the form of the website. The thesis also pursues additional objectives. In order to verify the objective of developing a standardized testing methodology is met, the thesis strives to produce a subsequent evaluation methodology using a standardized process framework in order to improve the testing process as well as a summary detailing which areas may be the subject of further expansion methodology. The theoretical part of the thesis aims to evaluate software development methodologies in terms of testing, to provide an overview of standards related to testing and to describe selected standards, to clarify the purpose of certification in testing and to analyze the possibilities of utilizing materials to prepare for the ISTQB certification. The objectives were achieved by analyzing the available materials for ISTQB certification, analyzing software development methodologies, standards, the TMMi procedural framework and other resources that deal with testing as well as its methodologies and standards. The main contribution of this work is a testing methodology, which is based on the testing process as defined by the international organization ISTQB. It provides a methodological framework by interconnecting and expanding individual methodological elements. Elements of the methodology include working products, as specified by the methodology with respect to the IEEE 829 standard. The methodology does not depend on the needs of a particular company and may be easily adopted, managed and customized. It may be used as a starting point in creating a testing strategy in Czech companies focused on software development which are interested in approaching testing in compliance with international practices.

This dissertation focuses on guarantees with a special emphasis on the option method of guarantee valuation. The existing domestic and international literature does not present a comprehensive debate on guarantee valuation with a sufficient discussion of the role of the guarantor. In addition, a minimal number of sources are devoted to the option valuation of guarantees applied to non-traded companies (and their structures) typical for the Czech Republic, which might inter alia have led to the marginal practical experience of the Czech valuation experts with the method. Following the identified blind spots of the current knowledge, the thesis primarily (i) presents coherent theoretical underpinnings of guarantee valuation, (ii) provides a proposed option valuation approach to guarantee valuation and (iii) demonstrates through a case study of the HAME holding an application of the proposed approach, including an evaluation of its strengths and weaknesses. Based on an analysis and synthesis of the domestic and international literature, a poll among the Czech valuation institutes and a numerical application on the historic HAME holding case, the author observes the following main findings: (i) on a theoretical bases, the option guarantee valuation method presents a plausible way of analysis, (ii) the proposed option valuation approach is applicable in the Czech praxis. Despite these positive prima facie findings, the option valuation approach shall be subject to further testing, comparisons with competing methods and improvements resulting from an increased number of its practical applications.