prikaz prve stranice dokumenta Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila
  Download
PDF 1.23 MB
master's thesis
Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila
2017. urn:nbn:hr:200:834754
Hucaljuk, Arijan
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Computer Engineering and Automation
Chair of Computer Engineering

Cite this document

Hucaljuk, A. (2017). Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila (Master's 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:834754

Hucaljuk, Arijan. "Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:834754

Hucaljuk, Arijan. "Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:834754

Hucaljuk, A. (2017). 'Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 27 September 2023, https://urn.nsk.hr/urn:nbn:hr:200:834754

Hucaljuk A. Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2017 [cited 2023 September 27] Available at: https://urn.nsk.hr/urn:nbn:hr:200:834754

A. Hucaljuk, "Usporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:200:834754

Please login to the repository to save this object to your list.
Metadata
TitleUsporedba algoritama za rješavanje problema dostave paketa pomoću flote vozila
Title (english)Comparison of algorithms for packets delivery with drones
AuthorArijan Hucaljuk
MentorIvan Aleksi (mentor)
Committee memberIvan Aleksi (predsjednik povjerenstva)
Committee memberTomislav Matić (član povjerenstva)
Committee memberIvan Vidović (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Computer Engineering and Automation)
(Chair of Computer Engineering)
Osijek
Defense date and country2017-06-01, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
Diplomski rad sastoji se od predstavljanja problema pronalaska optimalne putanje za dostavu paketa zračnim putem i dolaska do rješenja istog. Razvoj izrade rada odvijao se kroz četiri stupnja: definiranje problema, pronalaska odgovarajućih algoritama za dobivanje rješenja, razvoja i implementacija algoritama i analize rezultata. Programsko rješenje napravljeno je u programskoj okolini Eclipse u programskom jeziku Java. Informacije o paketima učitavaju se iz datoteke, paketi se sortiraju prema destinacijama i veličini paketa. Kapacitet svakog zrakoplova je ograničen. Optimiranje se izvodilo pomoću pet različitih algoritama te se potom uspoređivala kvaliteta rješenja koju pruža pojedini algoritam. Kao dva najbolja algoritma za optimizaciju pokazali su se Simulirano kaljenje i Branch and bound. Za ≤500 paketa, Simulirano kaljenje daje najbolja rješenja, a za sljedeći veći broj paketa koji je testiran (1000 paketa) Branch and bound je pružio najkvalitetnije rješenje. Dobiveno rješenje se potom vizualizira na mapi i iscrtava se plan dostave.
Abstract (english)
The final paper is composed of introducing the problem of optimal package delivery with airplanes to destinations and reaching its solution. Process for reaching the solution has been made in four steps: defining the problem, finding adequate optimization algorithm, development and implementation of the algorithm and analysis of results. Programming solution is written on Eclipse platform in the Java computer language. Package information is loaded from the file, packages are sorted according to destinations and package size. Airplanes capacity is limited. Optimization has been performed with five different algorithms, and then quality of result between algorithms has been compared. Two of the best performing optimization algorithms are Simulated annealing and Branch and bound. For ≤500 packages, Simulated annealing gives best solution, for a next bigger group of packages used in tests (1000 packages) Branch and bound provided best solution. A given solution is then visualized and delivery plan is plotted on the map.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:834754
Study programmeTitle: Graduate University Study Programme in Computer Engineering
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2017-06-20 15:18:08