|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
|
|
Braille Reader for Android OS
Bokiš, Daniel ; Dluhoš, Ondřej (referee) ; Procházka, Boris (advisor)
This thesis deals with the analysis and recognition of the Braille characters from a photo taken by a mobile phone. It describes design and implementation of application for recognition on Android OS mobile platform. Described general principles of analysis and processing of image are also applicable in other systems.
|
|
|
Braille Reader for Android OS
Bokiš, Daniel ; Dluhoš, Ondřej (referee) ; Procházka, Boris (advisor)
This thesis deals with the analysis and recognition of the Braille characters from a photo taken by a mobile phone. It describes design and implementation of application for recognition on Android OS mobile platform. Described general principles of analysis and processing of image are also applicable in other systems.
|
|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
guest ::
