|
|
The Use of Artificial Intelligence in Business
Matus, Gabriel ; Doskočil, Radek (referee) ; Dostál, Petr (advisor)
This work deals with traveling salesman problem (TSP) and examines it’s possibilities to use in business. It is about the optimization of the travel cost, saving time and unnecessary mileage. Part of the work is a program with a GUI written in program MATLAB. Program uses neural networks to calculate the most effective path between places, where the trader has to reach. It’s possible to use the algorithm for many purposes, e.g. distribution of goods, store management, planning of PCBs or rescue services. Program communicates with the Google Maps API server, which provides the actual information of the path.
|
|
| |
|
|
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
|
|
|
Computer service ‒ an aplication of traveling salesman problem
Ryglová, Michaela ; Skočdopolová, Veronika (advisor) ; Dvořák, Marek (referee)
The travelling salesman problem is one of the most popular kind of route trip transportation problem. This thesis deals with the solution of traveling salesman problem to minimize distance in kilometres and focus on customer requirements, I am using data from firm CTR s.r.o. In addition to the basic model are also used mathematical model with modification tasks, so it is a model with hard time windows and a model with soft time windows. A practical solution is used in an optimization modeling language in Lingo software. The optimum solution was found for the model the traveling salesman and its modifications. The longest route 40.2 kilometers provides modification with a soft time windows, but gives the most emphasis on customer requirements. The shortest route 24 km is found with using a model the traveling salesman problem, but not considered any customer requirements.
|
|
| |
|
|
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.
|
|
|
Metaheuristic optimalization for routing problems
Novák, Vít ; Fábry, Jan (advisor) ; Melechovský, Jan (referee)
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
|
|
|
Modern Methods and Tools to Support Managerial Decision
Krčil, Jakub ; Voráček, Jan (advisor) ; Novák, Michal (referee)
This master's thesis is focused on modern methods and tools to support managerial decision-making. The first part of this thesis introduces the basic characteristics related to the management and managerial decision-making that are subsequently extended to the area of modeling, simulation, optimization and multi-criteria decision making. It also outlines the relationship between the managerial decision-making tasks. The second part introduces practical examples which show the connection of these areas. Specifically, they are a colony of ants, traveling salesman problem, a tool AnyLogic, analytic hierarchy process and simulation HealthBound. The thesis is further supplemented by an appropriate software tools to support multi-criteria decision making.
|
|
|
System for solving distribution problems of LP – LINGO/Excel interface
Krčál, Adam ; Jablonský, Josef (advisor) ; Zouharová, Martina (referee)
Discrete problems of linear programming, i. e. problems with integer or binary variables, have a great amount of real-life applications. Among distribution problems, belong many different kinds of problems with discrete character -- transportation problem, container transportation problem, allocation problem, assignment problem, plant location problem, traveling salesman problem etc. In this work the theoretical aspects of chosen types of problems are explained and then an application in Microsoft Excel 2010 environment is created. For that purpose programming language VBA is the key instrument. The application cooperates with two different optimization systems -- the Solver add-in in Excel and professional optimization system Lingo. Functionality of the application is thereafter tested on some examples.
|
|
|
Heuristic methods for messenger problem
Kobzareva, Maria ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This work describes static and dynamic problems with one messenger or multiple number of messengers and suggests a possibility of solving such problems with modified heuristic methods. To solve messenger problem, modified nearest neighbor heuristic, modified insertion heuristic and modified exchange heuristic are used. The main contribution of this work are applications, developed in MS Excel, programmed with Visual Basic for Application, that can solve static and dynamic problems with one messenger or multiple number of messengers and that could be beneficial for companies that do business in messenger services.
|
guest ::
