| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Primerjava algoritmov ABC in CS : diplomsko delo
Authors:Bajs, David (Author)
Mernik, Marjan (Mentor) More about this mentor... New window
Files:.pdf VS_Bajs_David_2020.pdf (1,64 MB)
MD5: 76EA0A538BBA3EB06DCA82262F4942A4
Work type:Bachelor thesis/paper (mb11)
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu sta bila raziskana algoritma ABC in CS. Algoritma ABC in CS spadata v metahevristične algoritme, s katerimi rešujemo probleme, kjer je iskalni prostor prevelik, da bi raziskali vse možne rešitve. Algoritma smo primerjali na zveznih problemih in pri diskretnem primeru, ki je bil sestavljanje urnika za zaposlene v podjetju. Po implementaciji algoritmov, smo najprej primerjali dobljene rezultate med algoritmoma. Nato smo primerjali delovanje algoritmov z rezultati iz literature. Na koncu pa smo še primerjali, kako algoritma delujeta pri sestavljanju urnika za zaposlene v podjetju.
Keywords:evolucijski algoritmi, algoritem ABC, algoritem CS, zvezni problemi, problem sestavljanja urnika
Year of publishing:2020
Place of performance:Maribor
Publisher:[D. Bajs]
Number of pages:IX, 46 f.
COBISS_ID:36433155 New window
Categories:KTFMB - FERI
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.


License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:14.09.2020

Secondary language

Title:Comparison of ABC and CS algorithms
Abstract:This diploma thesis studies and implements ABC and CS algorithms. ABC and CS algorithms are a part of metaheuristic algorithms, which are used to solve problems, where the search space is too large for testing all possible solutions. We have compared the algorithms on constrained numerical problems and on a discrete problem. Rostering problem in a company was used as a discrete problem. At first, we compared the results of solutions between the two algorithms. Afterwards we compared the results between our implementation of algorithms and results, which were written in the bibliography. In the end we compared how the algorithms worked on the rostering problem in a company.
Keywords:evolutionary algorithms, ABC algorithm, CS algorithm, constrained numerical optimization, rostering problem


Leave comment

You have to log in to leave a comment.

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

Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica