Comparison of ABC and CS algorithms

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.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