|
|
Optimalization of Freight Railway Transport
Baše, Tomáš ; Fábry, Jan (advisor) ; Tichý, Filip (referee)
1 Introduction 2 Optimization models used in the rail transport 2.1 Distributional models 2.1.1 Transportation Problem 2.1.2 General Transportation Problem 2.1.3 Travelling Salesman Problem 2.2 Introduction to the Blocking Problem 2.2.1 Describtion of the Blocking Problem 2.2.2 Network Design Model 2.2.3 Objective Function 2.2.4 Column Generation 2.2.5 Branch and Price Algorithm 2.2.6 Evaluation of Model 3 Conclusion 4 List of the Literature
|
|
|
Overview of the express courier services in Czech republic
Hájek, Jan ; Fábry, Jan (advisor) ; Lejnarová, Šárka (referee)
In this work I would like to deal with express courier service, its limits and application in the economic system and also make a small overview of the companies that supply this service in the Czech republic. In the second chapter is an overview of the history of the logistics in the Czech republic and how they help other companies. The third chapter will give you a little overview of some czech companies - two big ones and two very known express couriers. The fourth and last chapter gives an introduction into optimisation of the "travel salesman problem".
|
|
|
Ant Colony Optimization
Zahálka, Jaroslav ; Fábry, Jan (advisor) ; Zouhar, Jan (referee)
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.
|
|
|
Two-dimensional Cutting Problems
Rada, Miroslav ; Fábry, Jan (advisor) ; Jablonský, Josef (referee)
The thesis first addresses the typology of cutting problems and their relationship to the packing problems. These are categorized (Wascher et al (2005)) according to 5 basic kriteria into the so-called "refined problem types", which is the sufficiently detailed and practical segmentation of cutting problems. The thesis deals with a selected sample of some of the most interesting algorithms from the wide range of those used to solve the cutting problems. The Viswanathan-Bagchi algorithm for the exact solution of constrainted two-dimensional orthogonal Cutting stock probléme with gillotine cuts is briefly described. It enables to process a wide range of additional problem constraints. The body of the thesis concentrates on heuristic algorithms used to solve orthogonal Open dimension problems. The Best-fit algorithm according to Burke et al. (2004) is described in detail. The work introduces two modifications of this algorithm that helped improve the solution in 42 out of the 89 benchmark problems, while a worse solution was achieved only in 10 of them. Moreover, new and more effective data structures and procedures that enable to solve the testing exercise with approx 50 000 rectangles in just about 2,5 seconds have been introduced.
|
|
|
Řešení markovských řetězců s oceněním přechodů pomocí MS Excel
Rusín, Michal ; Kořenář, Václav (advisor) ; Fábry, Jan (referee)
Cílem bakalářské práce bylo vytvořit aplikaci v prostředí MS Excel, která řeší úlohy markovských rozhodovacích řetězců. Práce obsahuje teoretickou část s popisem markovských řetězců s oceněním přechodů a praktickou část s popisem aplikace. V aplikaci lze řešit markovské rozhodovací řetězce s konstantním oceněním přechodů, s měnícím se oceněním přechodů a rozhodovací procesy s alternativami. Aplikace řeší pouze úlohy malého rozsahu s maximálním počtem pěti stavů a deseti iterací.
|
|
|
Route optimalisation for gas-meter reading
Šik, Petr ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis aims to find an optimal route taken by workers reading gas-meters. The text consists of three parts: the collection of necessary data, the selection and subsequent modification of the heuristic method and the calculation itself. Two techniques of data collection are applied: purchase from a specialised company and calculation based on geographical coordinates. These techniques are compared in the end. The method of the nearest neighbour is used for calculation, after being modified for this particular case. The calculation itself is done by the program named Gas-meters, which was created for the purpose of this thesis. The route potentially used by the gas company workers is then the result of the thesis. Furthermore, the thesis presents specific corporate savings possibly brought by using the presented program.
|
|
|
Application of Heuristic Methods for Vehicle Routing Problem with Time Windows
Chytrá, Alena ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
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.
|
|
| |
|
|
Strategical decision of Baťa a.s.
Plášková, Pavlína ; Fábry, Jan (advisor) ; Tichý, Filip (referee)
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.
|
|
|
Okružní problém s vyzvednutím a doručením, případová studie
Dostalíková, Lucie ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
Diplomová práce se zabývá analýzou a výpočtem optimalizační úlohy z praxe. Jedná se o optimalizaci nočních linek vnitrostátní přepravy na území ČR. Cílem je nalezení řešení, které zefektivní organizaci těchto linek a usnadní práci lidí s nimi spojenou. Celý výpočet úlohy je inspirován okružním problémem s doručením a vyzvednutím (?Pickup and Delivery Problem?). Na výpočet problému jsou použity dva modely: model založený na hledání optimálního více produktového toku a model spočívající na výběru tras. Modely jsou založeny na rozdílných přístupech. Díky oběma modelům je možné si uvědomit, že na jednu optimalizační úlohu lze pohlížet z více stran a z obdržených výsledků si pak vytvořit ucelenější pohled na problém.
|
guest ::
