Prikaz rada algoritma roja pčela na problemu trgovačkog putnika

undergraduate thesis

• Title (english): Demonstration of Bee Colony Algorithm Applied on Travelling Salesman Problem
• Author: Franjo Garić
• Mentor: Nikica Hlupić (mentor)
• Committee member: Nikica Hlupić (predsjednik povjerenstva)
• Committee member: Damir Kalpić (član povjerenstva)
• Committee member: Boris Milašinović (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2018-09-06, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

U ovom radu su navedene prednosti i mane metode iscrpne pretrage i roja pčela na problemu trgovačkog putnika. Prva dva poglavlja govore o umjetnoj inteligenciji i algoritmima općenito. Treće poglavlje opisuje sam problem trgovačkog putnika kroz matematički prikaz. U četvrtom i petom poglavlju su opisane metode iscrpne pretrage i roja pčela, njihovi pseudokodovi, primjene na zadanom problemu te prednosti i mane. Šestim poglavljem je ukratko opisan nacrt algoritma roja pčela u programskom jeziku Java. U posljednjem poglavlju su navedene usporedbe oba algoritma kroz određena svojstva.

Abstract (english)

The paper outlines the advantages and disadvantages of exhaustive test method and the bee colony algorithm on the travelling salesman problem. The first two chapters speak about artificial inteligence and algorithms in general. The third chapter describes the travelling salesman problem through mathematical presentation. The fourth and fifth chapter describes the methods of exhaustive search and the bee colony, their pseudocodes, application to the problem and their advantages and disadvantages. The sixth chapter briefly describes the draft of bee colony algorithm written in Java programming language. The last chapter lists the comparisons of both algorithms through certain properties.

• Keywords: algoritam; roj pčela; Java; Swing; trgovački putnik; iscrpna pretraga
• Keywords (english): algorithm; bee colony; Java; Swing; travelling salesman; exhaustive test
• Language: croatian
• URN:NBN: urn:nbn:hr:168:718642
• Study programme: Title: Computing; Study programme type: university; Study level: undergraduate; Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2019-03-13 20:23:49