|
|
Optimization of Routes for Travel Agencies
Hal, Marek ; Kučera, Petr (advisor) ; Klára, Klára (referee)
This diploma thesis deals with an issue of tour-routes and an optimization of routes for travel agencies, namely the Rialto travel agency from the city Přerov. Two tours, offered by this travel agency, are optimized and three optimization methods are used - the nearest neighbour metho, the Vogel approximation Method and the savings method.
The first part of this thesis describes the theoretical issue of topic - the legislation concerning the travel agencies, transportation logistics, the usage of operations research in transport logistics and travelling salesman problem issue and methods used to solve the travelling salesman problem. In the second part the Rialto travel agency is briefly described, then the tours are described and these tours are optimized.
The last part contents the analysis of obtained results, the results are evaluated and suggestions considering the economic, temporal and legislative (rest and working hours of drivers) aspects are made.
|
|
|
Optimization of Transportation Routes between a Chosen Company and Its Clients
Mazánek, Tomáš ; Kučera, Petr (advisor) ; Petr, Petr (referee)
The subject of this diploma thesis titled "Optimization of Transportation Routes between a Chosen Company and Its Clients" is the logistic routes optimization of the selected company, which is in thesis case company MITRANS - HK s.r.o. From company routes portfolio all circle routes are selected, which are lately solved by different methods, which are used for traveling salesman problem. Then the provided results are evaluated and compared between themselves and between real used routes variants. The thesis also handle the economic efficiency of optimization, which is presented on solved routes.
|
|
|
Optimization of travel agency routes
Ötwösová, Karolina ; Kučera, Petr (advisor) ; Pavlíčková, Petra (referee)
Summary
This thesis deals with the optimization of chosen travel agency routes. The optimization is performed using several methods, e. g. nearest neighbor method, Vogel approximation method and spanning tree method. For each method a comparison is provided with the original route and map, which illustrates visited places and their distribution.
The theoretical part describes the origin of tourism, the Czech republic in international tourism, legislation and logistics. In this section the methods of the analytical part and their advantages and disadvantages are described.
In the final part of the work all the information obtained using the above methods are included in the final discussion and there the best method for chosen travel agency is featured.
|
|
|
Optimization of transportation routes between a Chosen Company and their suppliers and customers
Habancová, Andrea ; Kučera, Petr (advisor) ; Křečková, Jana (referee)
The goal of this bachelor thesis is to determinate the suitable distributions routes for the SIASTEP,Ltd. by using two methods - The Vogel´s approximation Method and The Nearest neighbour Method. This Bachelor thesis has two parts.
The first part includes the explanation of technical terms and problems about logistics, logistics systems, chains, distributions problems and methods of their solution. This part of bachelor thesis describes methods used in the second part - Vogel´s approximation Method and The nearest neighbour Method.
The second part is practical. Objective for practical part was to found suitable tour regularly used by SIASTEP, Ltd., company by using selected methods from the theoretical part. Author of the bachelor thesis received two routes with their distances from the company. One of them takes place between Krupka city and cities in Germany. The second one takes place only on the territory of the Czech Republic. Then author of the bachelor thesis applied The nearest neighbour Method and The Vogel´s approximation Method. At the conclusion of this bachelor thesis are evaluated the obtained results.
|
|
|
Instance based learning
Martikán, Miroslav ; Polách, Petr (referee) ; Honzík, Petr (advisor)
This thesis is specialized in instance based learning algorithms. Main goal is to create an application for educational purposes. There are instance based learning algorithms (IBL), nearest neighbor algorithms and kd-trees described theoretically in this thesis. Practical part is about making of tutorial application. Application can generate data, classified them with nearest neighbor algorithm and is able of IB1, IB2 and IB3 algorithm testing.
|
|
|
Planning cash delivery to exchange offices using Vehicle Routing Problem with Time Series
Mouchová, Denisa ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
The purpose of this bachelor thesis is to apply vehicle routing problem with time series to a real case study. At first vehicle routing problem is classified into Operations Research and Travelling Salesman Problem. Then a simple vehicle routing problem and a multiple vehicle routing problem are described as well as their modifications with time series. Some heuristic algorithms and steps of nearest neighbour algorithm are described. The next part is focused on the application. It starts with introducing the company that is specialized in an exchange business and description of the situation that presents its assignments. There are three assignments in total. The first and second assignments are related to the optimization of cash delivery to company's branches. The second one also allows the company send a parcel with cash instead of its own delivery. The third assignment is to calculate whether a conversion cars into propellant gas is budget-wise or not. These assignments are solved and the results are commented.
|
|
| |
|
|
The Optimization of Maintenance of Bus Stops
Svobodová, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The aim of my thesis is to find the shortest total route to export trash at the bus stops for several variants and also determine the suitability of approximate algorithms. The tasks are solved by insertion heuristic, closest neighbor heuristic and optimization. The optimal solution is gained by using the system LINGO and by using optimization solver CPLEX. In my thesis I first describe the problem of maintenance of bus stops. Following chapter is devoted to the role of routing problems, its classifications, problems to solve, possibilities of solution. The used methods are Traveling Salesman Problem with one or multiple vehicles available in a unique depot and Vehicle Routing Problem with one or multiple vehicles available in a unique depot or multiple depots. The last chapter describes and compare the results of the solution of insertion heuristic, closest neighbor heuristic and optimization for problem of replacement of bus schedules and of maintenance of bus stops.
|
|
|
Optimization of distribution of bakery goods
Gebauerová, Monika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with the optimization of distribution of bakery products. Firstly there are the fundamental types of vehicle routing problems and their optimization models introduced. Next part is dedicated to heuristic algorithms. The heuristic methods are introduced in general, then there are the chosen methods described. Later there are two chosen algorithms formulated. First one based on the nearest neighbour method and another one based on the savings algorithm. Both of algorithms were programmed in the Visual Basic of Applications MS Excel 2010. These algorithms were applied for the solution of the real problem dealing with the distribution of goods. The bakery company has provided the data about its customers for this purpose. The last part of this thesis is dedicated to the summary and comparison of the solution of the assigned problem that was gained by the proposed algorithms with the solution that the bakery company has put into practice.
|
|
|
Heineken Beer Distribution Optimalisation
Vršecká, Renáta ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
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.
|
guest ::
