|
|
Algorithms for advance production planning and scheduling
Kršák, Pavol ; Kaczmarczyk, Václav (referee) ; Pásek, Jan (advisor)
Bachelor‘s thesis analyzes solution of operational problems of production planning. Pur- pose of the thesis is presentation of operational problems of production planning and following proposal and implementation of planning algorithms in language C# on specific planning problem. By the presentation of the problematic is listed company „COMPAS automatizace s.r.o.”, which enabled implementation of the project. The thesis analyzes planning methods and process of their implementation. More specifically the thesis ana- lyzes evolutionary algorithms, expert systems in planning and deterministic planning via linear programming. In third chapter is described in more details planning program of production of coffee blends, which was provided by COMPAS company. Like a next, the thesis describes specifically proposal of solving based on evolutionary principle. The solving consists of the model of technology designed to production of coffee blends and ActionList. ActionList represents a set of rules that are governed by model. Then ru- les are defined undergone an evolutionary process in an effort to find better solution the existing. Applied features implemented in the system COMES to repurpose by the imple- mentation of module COMES Modeller are developed together with detailed description in the fourth chapter.
|
|
|
Machine Understanding of Maps and Optimal Trajectory Calculation
Kršák, Pavol ; Burian, František (referee) ; Chromý, Adam (advisor)
The teasis deals with the creation of software tools, which use human element to extracts data necessary for navigation in the field of raster maps for orienteering. To achieve this goal, it is important to segment individual sections of the map according to symbols on the map. These symbols are illustrated on the map with one colour or combinations of colours, which create patterns. Because of identification of individual symbols, the work deals with segmentation according to colours and pattern matching. To navigate in the field is important information on height differences on the ground , for this reason the work discusses the position of contour identification and determination of their heights. Combining terrain data with data about height differences will create a 3D color models in XNA. To navigate in such a terrain that is used A* algorithm , in which the test several heuristic model defined distance. The A* algorithm then provides the optimum route according to specified criteria .The resulting application conveys the necessary tools to analyze raster maps orienteering , these tools are the manual and the automatic nature. The work includes detailed operating instructions of developed application.
|
|
|
Algorithms for advance production planning and scheduling
Kršák, Pavol ; Kaczmarczyk, Václav (referee) ; Pásek, Jan (advisor)
Bachelor‘s thesis analyzes solution of operational problems of production planning. Pur- pose of the thesis is presentation of operational problems of production planning and following proposal and implementation of planning algorithms in language C# on specific planning problem. By the presentation of the problematic is listed company „COMPAS automatizace s.r.o.”, which enabled implementation of the project. The thesis analyzes planning methods and process of their implementation. More specifically the thesis ana- lyzes evolutionary algorithms, expert systems in planning and deterministic planning via linear programming. In third chapter is described in more details planning program of production of coffee blends, which was provided by COMPAS company. Like a next, the thesis describes specifically proposal of solving based on evolutionary principle. The solving consists of the model of technology designed to production of coffee blends and ActionList. ActionList represents a set of rules that are governed by model. Then ru- les are defined undergone an evolutionary process in an effort to find better solution the existing. Applied features implemented in the system COMES to repurpose by the imple- mentation of module COMES Modeller are developed together with detailed description in the fourth chapter.
|
|
|
Machine Understanding of Maps and Optimal Trajectory Calculation
Kršák, Pavol ; Burian, František (referee) ; Chromý, Adam (advisor)
The teasis deals with the creation of software tools, which use human element to extracts data necessary for navigation in the field of raster maps for orienteering. To achieve this goal, it is important to segment individual sections of the map according to symbols on the map. These symbols are illustrated on the map with one colour or combinations of colours, which create patterns. Because of identification of individual symbols, the work deals with segmentation according to colours and pattern matching. To navigate in the field is important information on height differences on the ground , for this reason the work discusses the position of contour identification and determination of their heights. Combining terrain data with data about height differences will create a 3D color models in XNA. To navigate in such a terrain that is used A* algorithm , in which the test several heuristic model defined distance. The A* algorithm then provides the optimum route according to specified criteria .The resulting application conveys the necessary tools to analyze raster maps orienteering , these tools are the manual and the automatic nature. The work includes detailed operating instructions of developed application.
|
guest ::
RSS feed.