| dc.contributor.advisor | Zelinka, Ivan | |
| dc.contributor.author | Chodúr, David | |
| dc.date.accessioned | 2016-11-03T07:34:42Z | |
| dc.date.available | 2016-11-03T07:34:42Z | |
| dc.date.issued | 2016 | |
| dc.identifier.other | OSD002 | cs |
| dc.identifier.uri | http://hdl.handle.net/10084/115979 | |
| dc.description | Import 03/11/2016 | cs |
| dc.description.abstract | Cílem této práce je hybridizace evolu ních algoritm . Pro ú ely této práce byly zvoleny t i, jenû jsou v praxi hojn vyuûívány. Konkrétn se tedy jedná o Di erential Evolution, Artificial Bee Colony a Harmony search. K hybridizaci bylo pouûito Iterované lokální prohledávání s adaptivní pertrubací a Iterovan ̋ greedy akgoritmus s tabu-rekonstruk ní strategii. eöen ̋ kombinatorick ̋ problém je blocking flowshop with blocking. Konkrétn byly testy provád ny na Taillardov ̋ch datov ̋ch souborech. | cs |
| dc.description.abstract | The goal of this thesis is hybridization of evolutioanary algorythms. For the purpose of this thesis there have been chosen three algorythms that are widdely used in practice. For their hy- bridization there have been used two local search algorithms Tabu-mechanism improved iterated greedy and Enhanced self adaptive iterated local search with pertrubation . The solved com- binatorial problem was flowshop with blocking. Specificaly the test have been done on Taillars data files | en |
| dc.format.extent | 1570273 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | cs | |
| dc.publisher | Vysoká škola báňská - Technická univerzita Ostrava | cs |
| dc.subject | Lokální prohledávání, greedy algoritmus, pertrubace , diferenciální revoluce, um lé v elstvo, harmony search, diplomová práce | cs |
| dc.subject | Local search, greedy algorithm, pertrubation, Di erential evolution, Artificial bee colony, harmony search, diploma thesis | en |
| dc.title | Aplikace hybridního evolučního algoritmu pro kombinatorické optimalizační problémy s omezeními | cs |
| dc.title.alternative | Application of Hybrid Evolutionary Aalgorithms for Constraint Based Combinatorial Optimization Problem | en |
| dc.type | Diplomová práce | cs |
| dc.contributor.referee | Skanderová, Lenka | |
| dc.date.accepted | 2016-08-09 | |
| dc.thesis.degree-name | Ing. | |
| dc.thesis.degree-level | Magisterský studijní program | cs |
| dc.thesis.degree-grantor | Vysoká škola báňská - Technická univerzita Ostrava. Fakulta elektrotechniky a informatiky | cs |
| dc.description.department | 460 - Katedra informatiky | |
| dc.thesis.degree-program | Informační a komunikační technologie | cs |
| dc.thesis.degree-branch | Informatika a výpočetní technika | cs |
| dc.description.result | dobře | cs |
| dc.identifier.sender | S2724 | cs |
| dc.identifier.thesis | CHO0065_FEI_N2647_2612T025_2016 | |
| dc.rights.access | openAccess | |