|
| |
|
|
Vybrané problémy související s vehicle routing
Kuklis, Imrich ; Pergel, Martin (advisor) ; Surynek, Pavel (referee)
In our thesis we concentrate on a well-known problem which is popular among the scientists from the field of logistics, theoretical computer science and applied mathematics. This problem is called the Vehicle Routing Problem. We concentrate mainly on the Vehicle Routing Problem with Time Window. We implement some scheduling algorithms and compare their results. Powered by TCPDF (www.tcpdf.org)
|
|
|
Evidence of work activities
Hoang, Van Tru ; Kopecký, Michal (advisor) ; Pergel, Martin (referee)
1 Abstract: This thesis describes design and implementation of an application that is used for maintaining the evidence of work activities. The program allows its users to manage and review their activites and activities of their subordinates. Project managers and administrators are able to generate reports where details about employee's activities and projects in the organization are shown. Program is based on the OnlyOffice Community Server application, which is collaborative open-source software for project and document management.
|
|
|
Interval solver for nonlinear constraints
Garajová, Elif ; Hladík, Milan (advisor) ; Pergel, Martin (referee)
The thesis is focused on the Sivia algorithm (Set Inverter via Interval Ana- lysis) designed for solving a continuous constraint satisfaction problem using interval methods and propagation techniques. Basic properties of the algorithm are derived, including the correction of its presented complexity bound. Some improvements concerning the testing of constraint satisfaction and optimiza- tion of the number of interval boxes describing the solution are proposed. The thesis also introduces contractors used to enhance the effectivity of the Sivia algorithm by reducing the interval boxes processed. Presented algorithms were implemented in a solver for nonlinear constraints with a simple visualization of the result using the Matlab language. A comparison of basic contractors on specific examples is given.
|
|
|
CPX Device Integrator
Janoušek, Josef ; Holan, Tomáš (advisor) ; Pergel, Martin (referee)
The thesis studies possibilities of communication among programs (that process measured quantities) and measuring devices used for testing of patients in an exercise lab. The existing technique is based on direct interconnection of concrete pair of device and program, which makes parallel connection of more devices and programs impossible. So the goal was to create the integration tool which all devices can connect to. His job is to manage and process a communication among devices during the measurement. The program attendant can easily set the form of interconnection which allows creating various examination scenarios. The program will be prepared for integration of devices from various manufacturers. As a result it contributes to simplification and efficiency improvement of examination technique of diagnostics of patients in an exercise lab. Powered by TCPDF (www.tcpdf.org)
|
|
|
Particular Problems Related to the Vehicle Routing Problem
Kuklis, Imrich ; Pergel, Martin (advisor) ; Majerech, Vladan (referee)
Title: Particular Problems Related to the Vehicle Routing problem Author: Imrich Kuklis Department: Department of Software and Computer Science Education Supervisor: RNDr. Martin Pergel, Ph.D., Department of Software and Computer Science Education Abstract: In this thesis we present and implement some scheduling algorithms. In the first part we discuss the vehicle routing problem and its variants. In the second part we describe the algorihms we used in the thesis. In the third part we compare the algorithm by their results on several tests. In the last chapter we describe the documentation of the programs which we implemented and discuss the possible future extension of the thesis. Powered by TCPDF (www.tcpdf.org)
|
|
|
Algoritmické problémy související s průnikovými grafy
Ivánek, Jindřich ; Pergel, Martin (advisor) ; Rytíř, Pavel (referee)
In this thesis we study two clique-cover problems which have interesting applications regarding the k -bend intersection graph representation: the edge-clique-cover-degree problem and the edge-clique-layered-cover problem. We focus on the complexity of these problems and polynomial time algorithms on restricted classes of graphs. The main results of the thesis are NP-completness of the edge-clique-layered-cover problem and a polynomial-time 2-approximation algorithm on the subclass of diamond-free graphs for the same problem as well as some upper bounds on particular graph classes.
|
|
|
Universal backup
Douša, Daniel ; Pergel, Martin (advisor) ; Fučík, Milan (referee)
The main assignment of job is to solve the problem of colliding access to a shared data store for different types of data backup. The main limitation is the impossibility to run the server software on the shared medium. For this reason, there is a need to find resolutions of conflicts only with using of a shared data space and non-guaranteed direct connections of clients. As part of the work is implemented the solution has preference direct clients with a guarantee in the form of a synchronizing file on a shared medium. Part of the draft solution is to create an application that allows various types of backup (full, differential, synchronization, etc.). The application also allows distributed backup (backup data from multiple location) with synchronization mechanisms. Powered by TCPDF (www.tcpdf.org)
|
|
|
Universal discrete simulator
Vytasil, Jiří ; Pergel, Martin (advisor) ; Holan, Tomáš (referee)
In this thesis we analyzed the design and implementation of the program allowing you to perform discrete-event simulation. Further in the program we implemented visualization of discrete-event simulation. Emphasis is placed mainly on~universality. In addition to the program and its description includes information of discrete-event simulation, which allows easier understanding of~program operation. For a description of discrete-event simulation using finite-state automata and regular grammars. These parts are described more in order to more easily understand the description of the discrete-event simulation. The~system also allows adjustment of input files for easier operation of the program. Powered by TCPDF (www.tcpdf.org)
|
|
|
Universal discrete simulator
Vytasil, Jiří ; Pergel, Martin (advisor) ; Bednárek, David (referee)
In this thesis we analyzed the design and implementation of the program allowing you to perform discrete-event simulation. Further in the program we implemented visualization of discrete-event simulation. Emphasis is placed mainly on universality. In addition to the program and its description includes information of discrete-event simulation, which allows easier understanding of program operation. For a description of discrete-event simulation using finite-state automata and regular grammars. These parts are described more in order to more easily understand the description of the discrete-event simulation. The system also allows adjustment of input files for easier operation of the program.
|
guest ::
