Optimalno punjenje kontejnera pomoću evolucijskih algoritama

master's thesis

• Title (english): Optimal container filling using evolutionary algorithms
• Author: Nikolina Dujmović
• Mentor: Nela Bosner (mentor)
• Committee member: Nela Bosner (predsjednik povjerenstva)
• Committee member: Dijana Ilišević (član povjerenstva)
• Committee member: Zlatko Drmač (član povjerenstva)
• Committee member: Eduard Marušić-Paloka (član povjerenstva)
• Granter: University of Zagreb; Faculty of Science; (Department of Mathematics); Zagreb
• Defense date and country: 2021-09-24, Croatia
• Scientific / art field, discipline and subdiscipline: NATURAL SCIENCES; Mathematics

Abstract

U ovom radu upoznali smo se s osnovama evolucijskih algoritama i njihovom primjenom na konkretnom problemu. Na početku rada iznijeli smo glavnu ideju evolucijskih algoritama, kroz proces evolucije možemo pratiti povećanje sposobnosti cijele populacije. Uz glavnu ideju iznijeli smo i komponente evolucijskih algoritama te smo ih pobliže objasnili. Nakon toga smo se koncentrirali na reprezentaciju i varijacijske operatore i objasnili koji operatori se mogu primijeniti na koju vrstu reprezentacije. Uz ovo je bilo lakše prikazati različite varijante evolucijskih algoritama i navesti sve bitnije značajke. Nakon što smo se upoznali s osnovama evolucijskih algoritama, predstavili smo problem punjenja kontejnera i nekoliko različitih načina rješavanja tog problema koji su ovisili o postavljenim uvjetima i pretpostavkama koje smo zadali. Na kraju smo prikazali rezultate dobivene iz implementiranih načina rješavanja.

Abstract (english)

This thesis gives an overview of evolutionary algorithms and their application to a certain problem. In the beginning, we gave the main idea for the evolutionary algorithms, through the process of evolution we can monitor the increase in fitness for the whole population. We also presented and explained components of evolutionary algorithms. We concentrated on representation and variation operators and the link between the two of them. With that knowledge, it was easy to present different variants of evolutionary algorithms. In this thesis, we also presented the optimal container loading problem and gave several different ways to solve it. Lastly, we presented how each solution behaves under different constrictions and assumptions.

• Keywords: evolucijski algoritmi; varijacijski operatori; punjenje kontejnera
• Keywords (english): evolutionary algorithms; variation operators; container loading problem
• Language: croatian
• URN:NBN: urn:nbn:hr:217:038844
• Study programme: Title: Applied Mathematics; Study programme type: university; Study level: graduate; Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Open access
• Created on: 2021-10-26 12:00:59