National Repository of Grey Literature 50 records found  previous11 - 20nextend  jump to record: Search took 0.00 seconds. 
Optimizing Parcel’s Delivery of Czech Post
Svojšová, Kateřina ; Skočdopolová, Veronika (advisor) ; Borovička, Adam (referee)
The aim of my bachelor's thesis is to optimize the parcel's delivery of the Czech post in the surroundings of Kolín and Kutná Hora, which is operated by Depo Kolín 70. This service's speciality is that the parcels are being delivered to individual post offices according to the zip code. The main task is to minimize costs of delivery on these parcels, the next thing is to settle the optimal count of cycles assuming that delivery car has to come back to the Depo and another thing is to consider an opening time of post offices. Discrete models are used to solve this problem, specifically vehicle routing problem with time windows. To solve this model has been used LINGO optimizing software.
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.
Timetabling on Business College
Marešová, Iva ; Jablonský, Josef (advisor) ; Skočdopolová, Veronika (referee)
This thesis deals with a creation of a timetable on Business College. In the first part the areas in which we can encounter scheduling are introduced, because timetabling undoubtedly belongs to scheduling tasks. Then the linear programming theory is explained. With its help a model for a timetable is made. The assignment problem, which forms a basis for timetable creation model, will be mentioned. We cannot imagine all that without the support of computers. That is why one chapter is dedicated to useable computer programs. The next chapter discusses didactics and its requirements for a good timetable. These requirements are then taken into account in an application chapter. Fundamental part of the thesis is the creation of the timetable for real Business College, taking into account all important conditions. At the end of this thesis a mathematical model is introduced which is suitable for creating timetables for twenty-four classes of this school.
Optimization in advertisement allocation
Do Chi, Linh ; Sekničková, Jana (advisor) ; Skočdopolová, Veronika (referee)
This thesis focuses on the optimization in advertisement allocation. The main aim of the bachelor's thesis is to propose a strategy, how to allocate an advertising for Penny Company s. r. o. that will maximize overall affinity by using quantitative methods. The thesis is divided into theoretical and practical parts. There are some indicators that specify measuring impact of advertising campaign and some basic types of media introduced to readers in the preliminary of theoretical section. Furthermore there are described basic concepts related to the linear programming together with methods and the ways of enrollment into system MPL for Windows which is later delivered itself as a troubleshooting. In the practical section there are two assignments of scheduling advertising which are solved by using MPL for Windows. In the end the results will be interpreted and verified.
Goal Programming Models: Theory, Applications, Software Support
Skočdopolová, Veronika ; Jablonský, Josef (advisor) ; Brezina, Ivan (referee) ; Šubrt, Tomáš (referee)
Goal programming is an approach for solving decision problems. The aim of this doctoral thesis is to show the practical use of this approach for solving real problems. The first chapter brings a brief introduction to multicriteria decision making. The second chapter is devoted to goal programming, its history, theory, criticism and also to its practical applications. The third chapter deals with description of a model for optimisation of white mass production. This model utilises the goal programming principle to deal with measuring deviations of raw materials' composition. A part of this chapter is a presentation of OPTIPROT, an application that implements the mentioned model. In the fourth chapter there are described three mathematical models for timetabling at a department level; two multistage models and one complex model. All three models are formulated utilising goal programming. In this chapter there is also described an application that implements the complex model for timetabling.
Sensitive analysis in matrix of structural coefficients in optimal solution
Zýková, Petra ; Sekničková, Jana (advisor) ; Skočdopolová, Veronika (referee)
This thesis deals with sensitive analysis in optimal solution in a linear program. In the theoretical part of this thesis are derived expressions for intervals of stability for the right site of constraints, price coefficients basis variable and non-basis variable, structural coefficient non-basis variable and basis variable. In the practical part of this thesis are derivate expressions used in example. There is shown, how changes in the interval of stability of structural coefficient influence optimal solution.
High school timetabling using linear programming
Kozárová, Barbora ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
The school's schedule involves folding lessons within five working days, so that in each class were taught subjects required by the school curriculum in the correct number of hours and for each hour was assigned a teacher and a number of classrooms in which teaching will be realized. However, it is necessary to keep order in the resulting schedule avoid collision or vice versa unnecessary delays in the schedules of students and teachers in order to meet the conditions laid down by legislation and at the same time it was granted as much as possible the requirements of the management, teachers, or students or their parents. In this study it is proposed a mathematical model for the formation of a high school schedule that was created with the help of MPL for Windows and data provided by Gymnázium Chomutov.
Timetabling – Preparation of a timetable for school
Jeřábková, Eva ; Jablonský, Josef (advisor) ; Skočdopolová, Veronika (referee)
The aim of the thesis is to create a model of timetable for primary school for all teachers and classes so that the timetable is in compliance with all teaching plans, the conditions of the Ministry of Education, Youth and Sports (general education program), the school's needs and requirements of teachers. The timetable is created for a particular school, ZŠ nám. Svobody in Prague. The first part of the thesis is focused on the theoretical description of methods and procedures for dealing with the problem of timetable. The second part describes the elementary school, for which the timetable is made, it's classes, teachers and conditions of the tuition. It is also formulated and described a mathematical model of the problem that is solved by using the program Lingo.
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.
Beer production optimization in a brewery
Kopecký, Michal ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
The present thesis is based on actual data provided by the employees of the Zubr Brewery and it focuses on production optimization, aiming to maximize yearly profit while taking into account various limitations defined in advance. A convenient tool for determining the optimum yearly production of individual products is linear programming. For the purposes of this thesis, the production planning problem is utilized. An economic model was constructed on the basis of available data and -- after several essential calculation tasks -- a mathematical model was established, which was subsequently calculated using Microsoft Excel and its Solver functionality. Finally, the resultant values were interpreted. Apart from the analysis per se, the first two chapters explain the concept of linear programming and briefly introduce the Zubr Brewery, its products and its technology of brewing.

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