|
|
Optimal Scheduling Systems for Outdoor Activity
Rykala, Kryštof ; Matyáš, Jiří (referee) ; Češka, Milan (advisor)
The thesis discusses technologies and approaches for implementation of information system. Its part and motivation is automatic scheduling of activities. A model for resource-contraint project scheduling is defined using mixed-integer linear programming. Part of this thesis are client, server and planning programs that form a system for management of an outdoor center with automatic scheduling of activities.
|
|
|
Optimization models supporting strategic decisions in waste management
Mazlová, Lenka ; Hrabec, Dušan (referee) ; Nevrlý, Vlastimír (advisor)
This diploma thesis focuses on the creation of a complex optimization model for network flow problem in waste management. The main goal is designing a model of mixed integer programming problem that includes every aspect from production to waste treatment, its implementation in the Julia programming language and the description of the obtained results. The final model can plan transport routes, determine the method of waste transportation and allocate processing and treatment facilities, including sizing their capacities. This model is then used for test calculations on real data from Czech Republic.
|
|
|
Optimal Scheduling Systems for Outdoor Activity
Rykala, Kryštof ; Matyáš, Jiří (referee) ; Češka, Milan (advisor)
The thesis discusses technologies and approaches for implementation of information system. Its part and motivation is automatic scheduling of activities. A model for resource-contraint project scheduling is defined using mixed-integer linear programming. Part of this thesis are client, server and planning programs that form a system for management of an outdoor center with automatic scheduling of activities.
|
|
|
Modified Chinese Postman Problems - Experiments
Jelínek, Tomáš ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This master's thesis describes modified Chinese Postman Problems. These Problems are solved by (mixed) integer linear programming. The modified problems and also used approach (integer programming) belong at least to the NP complexity class. The thesis analyzes, compares and estimates computational complexity of each model. Based on this analysis, usability of described models for solving real-life problems is deduced. The models are focused on problems in urban environment. Therefore, it is possible to apply these models on problems like optimization of a waste collection or road maintenance. Graph and problem generator is programmed for purposes of this thesis.
|
|
|
Comparison of professional optimization systems performance
Rýdlová, Lenka ; Jablonský, Josef (advisor) ; Charvát, Karel (referee)
The problems of linear programming are very extensive in practice and professional optimization systems are necessary to their solution. Most of the time, these problems concern mixed integer programming. These types of problems have to be solved other then simplex method, even if the other methods are based on it. Integer conditions cause high difficulty with solving and disproportionately prolong solution time. These problems can be found in an electronically library MIPLIB. The library is used to testing optimization systems, which are whole range. The best programs on the market are CPLEX, Gurobi, Xpress and LINGO, used at our university. The focus of this thesis is testing the performance of each program listed above. The comparison is done based on solution time and accuracy of the calculated optimal solution.
|
|
|
Application of optimization methods in e-shopping
Hollayová, Nela ; Zouhar, Jan (advisor) ; Fábry, Jan (referee)
The subject of the thesis is the optimization of one the key processes in a book e-shop, namely delivery of goods from suppliers. In particular, we focus on the problems of selection of suppliers and the subsequent route optimization in daily pick-ups of orders. The proposed solution uses a combination of two mixed integer programming models. The model for supplier selection was designed so as to reflect the empiric approaches that are currently employed in the e-shop; the model for route optimization is a modified version of the canonical travelling salesman problem. On the basis of achieved results, we presented effective procedures for solving both of the aforementioned problems and suggested their implementation into the e-shop's enterprise resource planning system.
|
|
|
Optimization over the internet
Šálek, Pavel ; Jablonský, Josef (advisor) ; Rada, Miroslav (referee)
The goal of this thesis is to analyse and evaluate the efficiency of systems used for solving problems of mathematical programming, which are available within the frame of project NEOS (Network Enabled Optimization Server). The most frequent algorithms for solving linear programming and mixed integer programming are described in the beginning of the work -- simplex algorithms, the interior point method, cutting plane method and branch and bound method. These algorithms are used in solvers, which are supported by NEOS server. The efficiency of the algorithms and solvers are tested on collection of chosen problems contained in libraries of NETLIB and MIPLIB.
|
guest ::
