Implementation of the Artificial Bee Colony Algorithm in Determining the Shortest Route for Expeditionary Companies

  • Ni Wayan Windayani Universitas Udayana
  • 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.

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 Aplikasinya (JNATIA), [S.l.], v. 1, n. 1, p. 99-106, nov. 2022. Available at: <https://ojs.unud.ac.id/index.php/jnatia/article/view/92693>. Date accessed: 27 jan. 2023.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.