Implementation of the Artificial Bee Colony Algorithm in Determining the Shortest Route for Expeditionary Companies
on
Authors:
Ni Wayan Windayani, Cokorda Rai Adi Pramartha
Abstract:
“Delivery service is a promised business so many new companies are opening this business. However, it is not uncommon for parcel delivery to be delayed. From the field of Informatics, determining the courier route is included in the Traveling Salesman Problem. The TSP problem can be solved using several algorithms, one of which is the Artificial Bee Colony or ABC algorithm. Artificial Bee Colony algorithm adapted from the behavior of bee colonies in search of food. In this study, primary data is used in the form of destination points in the Bangli sub-district area of ??PT Global Jet Express Bangli delivery of packages using 20 destination points. The results of this system showed that the three parameters tested, namely the number of bees, the maximum limit and the maximum iteration did not show significant changes for the best distance. In this study, the shortest distance obtained using the Artificial Bee Colony algorithm is the number of bees is 10, the limit is 20 and the maximum iteration is 40 with a value of 38,42 km.”
Keywords
Keyword Not Available
Downloads:
Download data is not yet available.
References
References Not Available
PDF:
https://jurnal.harianregional.com/jnatia/full-92693
Published
2022-11-25
How To Cite
WINDAYANI, Ni Wayan; PRAMARTHA, Cokorda Rai Adi. Implementation of the Artificial Bee Colony Algorithm in Determining the Shortest Route for Expeditionary Companies.Jurnal Nasional Teknologi Informasi dan Aplikasnya, [S.l.], v. 1, n. 1, p. 99-106, nov. 2022. ISSN 3032-1948. Available at: https://jurnal.harianregional.com/jnatia/id-92693. Date accessed: 08 Jul. 2024.
Citation Format
ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian
Issue
Vol 1 No 1 (2022): JNATIA Vol. 1, No. 1, November 2022
Section
Articles
Copyright
This work is licensed under a Creative Commons Attribution 4.0 International License
Discussion and feedback