National Repository of Grey Literature 141 records found  1 - 10nextend  jump to record: Search took 0.00 seconds. 
Analysis of the performance growth of the optimization solvers
Škvarková, Alexandra ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
It would not be possible to solve real optimization problems, which usually contain a huge number of variables and constraints, without high-performance optimization systems. Today's software market offers a vast number of different systems available to provide solutions to linear and non-linear optimization tasks, including integer conditions. One such optimization system is called Gurobi. It is available in several versions. This thesis is focused on the performance comparison of three solver versions (i.e. 7.0.2, 6.0.5 and 5.0.2) using tasks that are in the MPS format, they are obtained from the MIPLIB 2010 electronic library, namely from the Benchmark section. The results are compared according to the time period needed to solve the task for each investigated version.
Aplication of simulation models for operating production line analysis and improvement
Zajoncová, Michaela ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
This work is dedicated to analysis and potential improvement in operation of production line using simulation model. More precisely the analysis goal is to optimize production line used for production of Cisco routes in company Foxconn CZ. Aim of this work is to verify options for line balancing improvement by decreasing human resources and increasing the number of testing units. For this purpose, simulation was used as tool for optimization. This work focuses on application of simulation modelling theory in practical case. Results were acquired by experimenting with simulation model created in computer mode, which is describes real operating system. With use of simulation, non-effective parts of real system were detected and for these non-effective parts, more effective use of human and technical resources was suggested.
Inventory routing problem
Špolc, Miroslav ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
Inventory routing problem is a mathematical method of operations research, consisting of two basic models (vehicle routing problem and inventory allocation). The goal of this master thesis is to introduce the reader to what exactly inventory routing is, why and how it was created and how it evolved over the course of years. Also, some examples of actual real-life applications of the problem will be shown together with the results of their implementation. Researches and papers of the last almost 40 years, written by experts on the subject are used as the source for this master thesis. From these works, the summarizing thesis was written, putting together the most important knowledge on how to solve the problem. Its contribution is not just the explanation of the theory and its development, but also introduction of some real applications of Inventory routing. Applicability of the model and its positive results in the form of cost savings is shown on real examples.
The determination of the route for running footraces by a modification Travelling Salesman Problem
Havel, Filip ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with finding the optimal route for running footraces. This work seeks to find a link that determines a lap with a predetermined beginning and a goal at the same time, given the possibility of 251 intersections. This model is derived from the travelling salesman problem, whose primary task is to pass the specified set of places according to the shortest route or in the shortest possible time and to return back to the starting point while visiting each place only once. Of course, the routes searched for in this work may be differentiated in several aspects. First of all, it is not necessary to include all of the places you can visit multiple times. The resulting route does not have to be the shortest, but it should have a certain span of distance, as the height metrics obtained are the key factor for optimization. A solution with the exact methods will be demonstrated by the LINGO optimization software, but only for a higher computational difficulty with a limited range of tasks, 21 junctions in the city center. Determining a longer route on a larger set of intersections will allow for derived heuristics with working names: the furthest neighbor with the smallest ascent and a minimal profile change. Part of the thesis is a detailed description of the mathematical model used, the general procedure, along with both a demonstration and an analysis of the applied heuristics.
Vehicle Routing Problem with Private and Common Carriers
Zikmund, Adam ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with a problem from the field of combinatorial optimization called Vehicle Routing Problem with Private and Common Carriers (VRPPC). A complete undirected symmetric graph is given. The task is to satisfy demands in all nodes with minimal total costs. There are two possibilities of doing so. Either private fleet or common carrier can be used for the transport of the demanded goods. The private costs depend on the covered distance whereas the common costs are conditional only on the weight of demand. Several heuristic methods for solving this problem are proposed and tested on three experimental instances of different sizes (in terms of number of nodes). Emphasis is primarily put on comparison between the presented heuristic and the classical optimization approach, which can often lead to inferior results (especially in case of larger instances) because of the computational complexity of the given problem.
Optimalization of distribution of immobile clients
Maříková, Eliška ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
Distribution problems today belong to one of the most used mathematical models in our everyday life. You can come across them when delivering items or transporting people. In my work I deal with the application of the distribution problems and their modification to transporting of handicapped people, specially for finding a route for the transfer of customers from the starting point to its destination while maintaining the capacities of the vehicles with the subsequent extension of the time windows and a further modification in the form of finding the routes where the customer is transported from the final destination point back to its starting point. To find the optimal solution, the combination of traveling salesman problem and the vehicle routing problem is used in my Bachelor thesis. The model is applied to real-time data from the company Societa o. p. s., which is one of the major companies in providing services to immobile people. The software MPL was used to calculate the optimal solution
Application of optimizing models in milk products distribution
Hanko, Filip ; Fábry, Jan (advisor) ; Skočdopolová, Veronika (referee)
This bachelor thesis focuses on the distribution of SABI milk products into MILK AGRO, spol s.r.o. retail stores, which are located in Prešov. The main objective is to optimize goods distribution and minimize costs. At the same time, the customer's demands have to be fulfilled and vehicle capacity cannot be exceeded. The problem of goods distribution from depot to stores is solved by the Vehicle routing problem model in MPL. It is necessary to consider specifications of a Heterogenous fleet, because the company holds vehicles with different capacities. The practical part includes comparison of costs, which are spent on goods distribution with vehicles of particular capacities. It also includes an application of the Heterogenous fleet vehicle routing problem with time windows to this specific problem. Following interpretation, results from the task are compared with real distribution system used by the company.
Analysis of the company´s expenses associated with relocation of the distribution center
Petrovičová, Andrea ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
The objective of the thesis is to analyze the company´s expenses associated with relocation of the distribution centre as well as to describe the components of expenses associated with transport between company and customers. An important part of the thesis is comparison of the individual delivery routes. The theoretical part provides a brief description of Vehicle Routing Problem and its modifications as well as the different options how to solve it. The expenses calculations of truck transport are approximated to the reader. The practical part shows the real problem of Nestlé. The decreasing of the expenses is shown on real data. The reason of decreasing is the relocation of the distribution centre. The model routes are compared with the actual ones using MPL. It also shows the potential cost reduction.
Assignment problem and its particular application in passenger transport
Asterová, Jana ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
This thesis is focused on the topic of assignment problems. The theoretical part presents a summary of the most important previously published findings on linear and quadratic assignment problem. The basic formulations of both problems are introduced, as well as the outline of some methods developed for their solution. Finally both problems are illustrated by practical applications that have appeared in the literature. The practical part gives insight into the issue of assignment of transport orders to drivers in a company and proposes a suitable model that speeds up the process of distributing the orders. The transfers conducted by the company start at the airport and terminate in a hotel in the city centre of Prague or vice versa. When proposing order schedules for the drivers, it is necessary to take into account not only the time of the transfers, but additionally the capacity and the category of the vehicle.
The real use of operation research method in conjunction with logistics Cross-Docking technology
Dvořáková, Alžběta ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with the real use of operation research method in conjunction with logistics Cross-Docking technology. It is possible to solve this conjunction with either routing problems along with its modifications or simulations methods. The theoretical part describes routing problems, routing problems with time windows, simulations methods with their possibilities of real use and logistics technologies. A model of a Cross-Docking terminal that was created in the program Simul8 can be found in the practical part of this thesis. The goal of the simulation was to ensure smooth flow of products through the terminal without any long queues in the terminal. Routing problems designed to minimize the length of its routes can be found in the second half of the practical part. Other possible real application is routing problems on the real problem. The solution for this task was found using the modelling system MPL for Windows.

National Repository of Grey Literature : 141 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.