|
|
Application for Generating of School Schedules
Fiala, Jan ; Horáček, Jan (referee) ; Rozman, Jaroslav (advisor)
This work deals with problem of generating school schedules. The solution is based on three heuristic algorithms (hill-climbing, simulated annealing, genetic algorithm) and is fully implemented in JAVA. It provides a comparison of implemented heuristic algorithms including description of their pros and cons.
|
|
|
Comparison of Programs for Scheduling
Kubalcová, Monika ; Martinek, David (referee) ; Křena, Bohuslav (advisor)
This thesis deals with timetabling issues at the Faculty of Information Technology, Brno University of Technology. It focuses mainly on scheduling of lectures and exams for students. In first part, the current situation, restrictive conditions and actual procedure are described. Afterwards, theoretical aspects of scheduling problem are discussed. In the second part of the thesis, selected software application for automatic generation of timetables are compared. The most suitable application is then evaluated by producing a real timetable. The achieved results are discussed and the future directions are suggested in the conclusion.
|
|
|
Cross_section and reinforcement optimization of roof truss
Odvárka, Miroslav ; Šimůnek, Petr (referee) ; Laníková, Ivana (advisor)
The thesis is focused on optimization of cross-section shape of reinforced concrete truss. An optimization algorithm was created in Microsoft Office Excel which optimizes the shape and reinforcement of the reinforced concrete truss. The truss is as cheap as possible while complying with the ultimate limit state and serviceability limit state - deflection. The algorithm uses the Solver tool which is a supplement program Microsoft Office Excel. Two truss variants were created. One has a cross-sectional shape of a truss designed according to empirical relationships and the second comprises an optimized cross-sectional shape using the algorithm formed. The internal truss forces were detected using Scia Engineer. Both options were statically assessed. When comparing the variants, that a considerable part of the material cost can be saved when optimizing the cross-sectional shape.
|
|
|
Asynchronous communication interfaces in FPGA
Cabal, Jakub ; Fujcik, Lukáš (referee) ; Bohrn, Marek (advisor)
The aim of this thesis is to analyze the options for implementation of asynchronous modules for clock domain crossing in an FPGA circuit. Such crossings are inevitable in moderately complex firmware designs and can lead to data corruption or loss, if implemented incorrectly. Furthermore, the work deals with application of correct constraints. The practical part of this work describes an implemented library of clock domain crossing modules. Further, the practical part describes a created methodology for use of clock domain crossing modules, whose application is demonstrated in a case study of a network interface card circuit created for the acceleration card COMBO-80G.
|
|
|
Toolbox for multi-objective optimization
Marek, Martin ; Hurák,, Zdeněk (referee) ; Kadlec, Petr (advisor)
This paper deals with multi-objective optimization problems (MOOP). It is explained, what solutions in multi-objetive search space are optimal and how are optimal (non-dominated) solutions found in the set of feasible solutions. Afterwards, principles of NSGA-II, MOPSO and GDE3 algorithms are described. In the following chapters, benchmark metrics and problems are introduced. In the last part of this paper, all the three algorithms are compared based on several benchmark metrics.
|
|
|
Airport - Time and resource constrained project sheduling
Vandas, Marek ; Petříčková, Zuzana (advisor) ; Pangrác, Ondřej (referee)
This thesis identifies constraints for safe ground airport operations. These operations consist of runway assignment, taxi operations planning and gate scheduling. The aim of this thesis is to show how this problem can be formulated as constraint satisfaction problem and then solved as a scheduling problem. Based on this model, an application that ilustrates these concepts is designed and implemented. This application enables a visualisation of results. An extendable constraint solver was implemented for the purpose of this application. This solver can be used to solve problems from other domains as well and also enables easy change of search strategy.
|
|
|
Search Strategies for Scheduling Problems
Kypta, Tomáš ; Barták, Roman (advisor) ; Čepek, Ondřej (referee)
In the present work I compare the search strategies for solving scheduling problems from the view of constraint programming. The thesis is focused on scheduling problems containing alternative activities. An analysis of previously published various ways of modelling the problems is provided, next description and experimental comparison of search strategies targetting these models is provided. The influence of strategies on the speed of the solver is studied primarily. As a sideeffect the work studies the ways how Choco solver, which was utililized for implementation of the experiments, can be used to solve the scheduling problems with alternative activities.
|
|
|
Cross_section and reinforcement optimization of roof truss
Odvárka, Miroslav ; Šimůnek, Petr (referee) ; Laníková, Ivana (advisor)
The thesis is focused on optimization of cross-section shape of reinforced concrete truss. An optimization algorithm was created in Microsoft Office Excel which optimizes the shape and reinforcement of the reinforced concrete truss. The truss is as cheap as possible while complying with the ultimate limit state and serviceability limit state - deflection. The algorithm uses the Solver tool which is a supplement program Microsoft Office Excel. Two truss variants were created. One has a cross-sectional shape of a truss designed according to empirical relationships and the second comprises an optimized cross-sectional shape using the algorithm formed. The internal truss forces were detected using Scia Engineer. Both options were statically assessed. When comparing the variants, that a considerable part of the material cost can be saved when optimizing the cross-sectional shape.
|
|
|
Planning operations of space probes
Kolombo, Martin ; Barták, Roman (advisor) ; Toropila, Daniel (referee)
The thesis addresses a complicated real-world scheduling problem from the space operations environment. The Mars Express Orbiter scheduling problem was first presented as a challenge by the European Space Agency. The thesis compares two different solutions. The first solution is an ad-hoc scheduler that is based on scheduling actions into a set of time windows and heavily utilizes local search techniques. The second solution models the problem as a constraint satisfaction problem (CSP) and uses the SICStus Prolog constraint programming solver to find a solution. Both schedulers are experimentally evaluated and the results are compared. Both approaches were able to provide a working solution. The conclusion however states that the more generic CSP based approach was capable of producing higher quality schedules even without a complicated heuristic. It however to compute the schedule for a small subset of inputs. On the other hand, the ad-hoc scheduler was capable of solving larger inputs but the produced solutions are not as good.
|
|
|
Search Strategies for Scheduling Problems
Kypta, Tomáš ; Barták, Roman (advisor) ; Čepek, Ondřej (referee)
In the present work I compare the search strategies for solving scheduling problems from the view of constraint programming. The thesis is focused on scheduling problems containing alternative activities. An analysis of previously published various ways of modelling the problems is provided, next description and experimental comparison of search strategies targetting these models is provided. The influence of strategies on the speed of the solver is studied primarily. As a sideeffect the work studies the ways how Choco solver, which was utililized for implementation of the experiments, can be used to solve the scheduling problems with alternative activities.
|
guest ::
