Meta-optimalizace solveru systému generálního a hlavního klíče
Meta-optimization of a master key system solver
Type of document
diplomová prácemaster thesis
Author
Jumurov Ruslan
Supervisor
Černoch Radomír
Opponent
Šedivý Jan
Field of study
Umělá inteligenceStudy program
Otevřená informatikaInstitutions assigning rank
katedra počítačůRights
A university thesis is a work protected by the Copyright Act. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one?s own expense. The use of thesis should be in compliance with the Copyright Act http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf and the citation ethics http://www.cvut.cz/sites/default/files/content/d1dc93cd-5894-4521-b799-c7e715d3c59e/cs/20160901-metodicky-pokyn-c-12009-o-dodrzovani-etickych-principu-pri-priprave-vysokoskolskych.pdfVysokoškolská závěrečná práce je dílo chráněné autorským zákonem. Je možné pořizovat z něj na své náklady a pro svoji osobní potřebu výpisy, opisy a rozmnoženiny. Jeho využití musí být v souladu s autorským zákonem http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf a citační etikou http://www.cvut.cz/sites/default/files/content/d1dc93cd-5894-4521-b799-c7e715d3c59e/cs/20160901-metodicky-pokyn-c-12009-o-dodrzovani-etickych-principu-pri-priprave-vysokoskolskych.pdf
Metadata
Show full item recordAbstract
Many practical problems are NP-Hard (or NP-Complete), for which best algorithms may guarantee only exponential worth-case time complexity, if P != NP. Typically, these algorithms can not do better, but several types of heuristics can be invented into algorithms to improve their performance, without any guarantee for better worth-case complexity.
Lock-chart solving is a NP-Hard problem. It is specified by a lock system - a set of keys and locks installed in one or several buildings, for each key customer decides which doors it should be able to open. Lock-Chart problem is formulated by these requirements. For lock-chart solving many different combinatorial optimization algorithms and techniques can be used. One of which is backtracking algorithm. This algorithm can use different pruning technique and heuristics. Heuristics are typically chosen randomly on each backtrack, with some participation of random shakes technique.
This master thesis presents approach of meta-heuristic optimization for Lock-chart problem Solver based on Machine Learning techniques. Main efforts of this thesis are: patterns and dependencies between heuristics and lock-chart problems were discovered, Decision Tree based heuristic selection system was created and included into the current backtracking algorithm, performance improvement was measured by two experiments. Proposed Decision tree based heuristic selection approach outperformed the random heuristic selection approach in 92 problem instances out of 113. Many practical problems are NP-Hard (or NP-Complete), for which best algorithms may guarantee only exponential worth-case time complexity, if P != NP. Typically, these algorithms can not do better, but several types of heuristics can be invented into algorithms to improve their performance, without any guarantee for better worth-case complexity.
Lock-chart solving is a NP-Hard problem. It is specified by a lock system - a set of keys and locks installed in one or several buildings, for each key customer decides which doors it should be able to open. Lock-Chart problem is formulated by these requirements. For lock-chart solving many different combinatorial optimization algorithms and techniques can be used. One of which is backtracking algorithm. This algorithm can use different pruning technique and heuristics. Heuristics are typically chosen randomly on each backtrack, with some participation of random shakes technique.
This master thesis presents approach of meta-heuristic optimization for Lock-chart problem Solver based on Machine Learning techniques. Main efforts of this thesis are: patterns and dependencies between heuristics and lock-chart problems were discovered, Decision Tree based heuristic selection system was created and included into the current backtracking algorithm, performance improvement was measured by two experiments. Proposed Decision tree based heuristic selection approach outperformed the random heuristic selection approach in 92 problem instances out of 113.
Collections
- Diplomové práce - 13136 [892]