| dc.contributor.advisor | Pangrác, Ondřej | |
| dc.creator | Kovács, Peter | |
| dc.date.accessioned | 2018-09-25T08:24:36Z | |
| dc.date.available | 2018-09-25T08:24:36Z | |
| dc.date.issued | 2018 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11956/100907 | |
| dc.description.abstract | The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulated Annealing, Tabu Search or Greedy algo- rithms. Metaheuristics were compared on three different NP-hard problems. Specificaly, Traveling Salesman Problem, Graph Coloring Problem and Set Covering Problem. Detailed description of implementation of metaheuristics in particular problems can be found in this work. Metaheuristics were com- pared based on cost function and execution time. However, this work tries to identify instances, in which Ant Colony was the best choice. Ant Colony is reliable metaheuristic on large Traveling Salesman or Set Covering problems. | en_US |
| dc.description.abstract | V práci sa venujem porovnávaniu metaheuristiky Ant Colony s inými metaheuristikami ako Simulated Annealing, Tabu Search alebo hladné al- goritmy. Metaheuristiky som porovnával na probléme obchodného cestujú- ceho, pri ofarbovaní grafu a množinovom pokrytí. V práci sú podrobne rozo- braté implementácie metaheuristík na jednotlivé problémy. Pri porovnávaní je braná do úvahy hlavne výsledná cenu riešenia, ale aj čas. V práci je snaha identifikovať, v ktorých prípadoch je vhodné použiť Ant Colony. Ant Colony v prípade množinového pokrytia a problému obchodného cestujúceho funguje spoľahlivo pri veľkých instanciách. | cs_CZ |
| dc.language | Slovenčina | cs_CZ |
| dc.language.iso | sk_SK | |
| dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
| dc.subject | optimization | en_US |
| dc.subject | heuristics | en_US |
| dc.subject | Ant Colony | en_US |
| dc.subject | Traveling Salesman Problem | en_US |
| dc.subject | Graph Coloring | en_US |
| dc.subject | Set Covering | en_US |
| dc.subject | optimalizácia | cs_CZ |
| dc.subject | heuristiky | cs_CZ |
| dc.subject | mravčia kolónia | cs_CZ |
| dc.subject | problém obchodného cestujúceho | cs_CZ |
| dc.subject | ofarbovanie grafu | cs_CZ |
| dc.subject | množinové pokrytie | cs_CZ |
| dc.title | Optimalizácia mravčou kolóniou | sk_SK |
| dc.type | bakalářská práce | cs_CZ |
| dcterms.created | 2018 | |
| dcterms.dateAccepted | 2018-06-22 | |
| dc.description.department | Computer Science Institute of Charles University | en_US |
| dc.description.department | Informatický ústav Univerzity Karlovy | cs_CZ |
| dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
| dc.description.faculty | Faculty of Mathematics and Physics | en_US |
| dc.identifier.repId | 194310 | |
| dc.title.translated | Ant colony optimization | en_US |
| dc.title.translated | Optimalizace mravenčí kolonií | cs_CZ |
| dc.contributor.referee | Balko, Martin | |
| thesis.degree.name | Bc. | |
| thesis.degree.level | bakalářské | cs_CZ |
| thesis.degree.discipline | General Computer Science | en_US |
| thesis.degree.discipline | Obecná informatika | cs_CZ |
| thesis.degree.program | Computer Science | en_US |
| thesis.degree.program | Informatika | cs_CZ |
| uk.thesis.type | bakalářská práce | cs_CZ |
| uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Informatický ústav Univerzity Karlovy | cs_CZ |
| uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Computer Science Institute of Charles University | en_US |
| uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
| uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
| uk.faculty-abbr.cs | MFF | cs_CZ |
| uk.degree-discipline.cs | Obecná informatika | cs_CZ |
| uk.degree-discipline.en | General Computer Science | en_US |
| uk.degree-program.cs | Informatika | cs_CZ |
| uk.degree-program.en | Computer Science | en_US |
| thesis.grade.cs | Velmi dobře | cs_CZ |
| thesis.grade.en | Very good | en_US |
| uk.abstract.cs | V práci sa venujem porovnávaniu metaheuristiky Ant Colony s inými metaheuristikami ako Simulated Annealing, Tabu Search alebo hladné al- goritmy. Metaheuristiky som porovnával na probléme obchodného cestujú- ceho, pri ofarbovaní grafu a množinovom pokrytí. V práci sú podrobne rozo- braté implementácie metaheuristík na jednotlivé problémy. Pri porovnávaní je braná do úvahy hlavne výsledná cenu riešenia, ale aj čas. V práci je snaha identifikovať, v ktorých prípadoch je vhodné použiť Ant Colony. Ant Colony v prípade množinového pokrytia a problému obchodného cestujúceho funguje spoľahlivo pri veľkých instanciách. | cs_CZ |
| uk.abstract.en | The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulated Annealing, Tabu Search or Greedy algo- rithms. Metaheuristics were compared on three different NP-hard problems. Specificaly, Traveling Salesman Problem, Graph Coloring Problem and Set Covering Problem. Detailed description of implementation of metaheuristics in particular problems can be found in this work. Metaheuristics were com- pared based on cost function and execution time. However, this work tries to identify instances, in which Ant Colony was the best choice. Ant Colony is reliable metaheuristic on large Traveling Salesman or Set Covering problems. | en_US |
| uk.file-availability | V | |
| uk.publication.place | Praha | cs_CZ |
| uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Informatický ústav Univerzity Karlovy | cs_CZ |
| thesis.grade.code | 2 | |
