izpis_h1_title_alt

Hibridizacija požrešnih algoritmov in hitrega urejanja
VEHOVEC, NINA (Author), Mihelič, Jurij (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (616,07 KB)
MD5: 04BE661C0D5AB053CECFCC9A44441921

Abstract
Požrešna metoda je ena izmed najbolj uporabljenih tehnik pri načrtovanju algoritmov, za katero obstaja več vrst optimizacij. Naša ideja je bila optimiziranje požrešnih algoritmov s pomočjo algoritma hitrega urejanja. V algoritem hitrega urejanja smo vstavili požrešni algoritem. Na tak način ustvarjen hibridni algoritem, lahko na določenih primerih deluje precej hitreje kot navadni požrešni algoritem. Hibridizacijo smo preizkusili na problemih preprostega nahrbtnika, menjave kovancev in izbora aktivnosti ter na Kruskalovem algoritmu in pri razvrščanju poslov v delavnici z enim strojem. Hibridni algoritem je deloval bolje od navadnega požrešnega algoritma pri preprostem problemu nahrbtnika in pri problemu menjave kovancev.

Language:Slovenian
Keywords:požrešno, nahrbtnik, posli, aktivnosti, Kruskal, kovanci, urejanje, hibridizacija, algoritmi
Work type:Bachelor thesis/paper (mb11)
Organization:FRI - Faculty of computer and information science
Year:2017
Views:596
Downloads:288
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Secondary language

Language:English
Title:Hybridization of greedy algorithms and quicksort
Abstract:
The greedy method is one of the most commonly used techniques in algorithm design and there are many different optimizations available. This thesis presents one of them. Our idea for optimization was improving the running time of greedy algorithms with the help of the quicksort algorithm. We integrated the greedy algorithm into quicksort to produce a hybrid algorithm, which can solve certain problems significantly faster than the normal greedy algorithm. In the thesis we chose to test hybridization on the activity-selection problem, the fractional knapsack problem, the coin changing problem, Kruskal's algorithm and unit-task scheduling. We experimentally confirmed that hybrid algorithms (do) indeed perform better with the coin changing problem and the fractional knapsack problem.

Keywords:greedy, hybridization, algorithms, activity-selection, knapsack, Kruskal, coin-changing, quicksort, unit-tasks

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back