Home > Search Results: Kozárová, Barbora
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
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.
Detailed record
Parcel pick-up optimization
 Kozárová, Barbora ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
Vehicle routing problems solve problems of optimizing the transport routes. The principle of solutions of problems of the first type is finding the shortest circuit that begins and ends in the same place and includes places that can be visited in any order, each of them has to be visited exactly once. In the second type of problems there is also considered the size of the requirements and the capacity of the vehicle, which has to return back to the store. Both tasks can be extended to the so-called time windows, which indicate the interval between the earliest possible and latest allowable start of the customer service. This work aims to calculate the optimal route for the drivers of unnamed wholesale company. The objective is to minimize the distance travelled per day in order to reduce fuel costs. The solution is implemented using the models of Travelling Salesman problem, Vehicle Routing problem and their modifications with time windows through systems LINGO, eventually GUROBI, and MPL for Windows. To illustrate the application of heuristic methods the calculation is carried out by savings method.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English