prikaz prve stranice dokumenta GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA
  Download
PDF 1.23 MB
undergraduate thesis
GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA
2021. urn:nbn:hr:200:564471
Vulić, Lukrecia
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Software Engineering
Chair of Programming Languages and Systems

Cite this document

Vulić, L. (2021). GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:564471

Vulić, Lukrecia. "GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:564471

Vulić, Lukrecia. "GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:564471

Vulić, L. (2021). 'GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 28 December 2024, https://urn.nsk.hr/urn:nbn:hr:200:564471

Vulić L. GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2021 [cited 2024 December 28] Available at: https://urn.nsk.hr/urn:nbn:hr:200:564471

L. Vulić, "GENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:200:564471

Please login to the repository to save this object to your list.
Metadata
TitleGENETSKI ALGORITAM ZA RJEŠAVANJE ASIMETRIČNOG PROBLEMA TRGOVAČKOG PUTNIKA
Title (english)GENETIC ALGORITHM FOR SOLVING THE ASYMMETRIC PROBLEM OF A TRADING TRAVELER
AuthorLukrecia Vulić
MentorZdravko Krpić (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Software Engineering)
(Chair of Programming Languages and Systems)
Osijek
Defense date and country2021-09-13, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Artificial Intelligence
Abstract
Asimetrični problem trgovačkog putnika je problem u kojem trgovački putnik mora obići N gradova gdje put od jednog grada do drugog može biti različit od onoga u obrnutom smjeru. Cilj je pronaći što manji put u prihvatljivom vremenskom razdoblju. U ovom radu korišten je genetskog algoritam za pronalazak rješenja problema. U radu je opisan rad genetskog algoritma i pripadajućih dijelova selekcije roditelja, operatora varijacije te selekcije preživjelih. U eksperimentalnom djelu rada ispitan je utjecajoperatora mutacije zamjene i mutacije umetanja, te različitih vjerojatnosti mutacije. Eksperiment je proveden na pet različitih problema te rezultati pokazuju da u ovim slučajevima bolje radi operator mutacije umetanja te se najbolji rezultati postižu pri vjerojatnosti mutacije od 100%.
Abstract (english)
Asymmetrical traveling salesman problem is a problem in which a traveling salesman must visit N cities but the distance between city A to city B can be different from the one in reverse. The goal of the solution is to find the minimal length tour in an acceptable time frame. In this paper, a genetic algorithm was used to find the solution to the problem. The genetic algorithm was also described in the paper as well as parts of it which are parent selection, variation operators and, survivor selection. In the experimental part of the paper mutation operators and mutation probability were tested. The experiment was conducted on five different problems and the results showed that the operator of the insert mutation worked better in these cases and the best results were achieved with mutation probability at 100%.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:564471
Study programmeTitle: Undergraduate University Study Programme in Computer Engineering
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 resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2021-12-14 12:46:44