Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach
Distribution is one of the essential activities in business because it determines the price of products or goods in the market. So, choosing the shortest path is considered one of the most important things in business, especially distributors. PT Everbright, one of the business actors engaged in the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Bina Nusantara University
2021-12-01
|
| Series: | ComTech |
| Subjects: | |
| Online Access: | https://journal.binus.ac.id/index.php/comtech/article/view/7964 |
| _version_ | 1827883175219560448 |
|---|---|
| author | Hengki Tamando Sihotang |
| author_facet | Hengki Tamando Sihotang |
| author_sort | Hengki Tamando Sihotang |
| collection | DOAJ |
| description | Distribution is one of the essential activities in business because it determines the price of products or goods in the market. So, choosing the shortest path is considered one of the most important things in business, especially distributors. PT Everbright, one of the business actors engaged in the manufacture of batteries and as the main distributor, hopes that the distribution of goods to have the shortest route so that costs can be minimized. The aim of the research was to determine the shortest path in distributing goods in the Medan area to the location of consumers. The research used Ant Colony Optimization (ACO). Determination of the shortest path is based on distance calculations in kilometers, protocol roads, gangs, normal road conditions, and differences between small and major roads. Based on the research results, it is found that the J1 line has the greatest value. So, the path chosen by the ants to pass is J1 which is 11 km away from the departure location (PT Everbright) to the destination (Pasar Glugur Kota). It passes through PT Everbright --> Jln. Gatot Subroto --> Jln. Kapt. Muslim --> Jln. Tgk. Amir Hamzah --> Jln. KH. Syeikh Abdul Wahab Rokan --> Pasar Glugur Kota. |
| first_indexed | 2024-03-12T19:08:47Z |
| format | Article |
| id | doaj.art-0bcc268130b3408eae801d4bc00b1716 |
| institution | Directory Open Access Journal |
| issn | 2087-1244 2476-907X |
| language | English |
| last_indexed | 2024-03-12T19:08:47Z |
| publishDate | 2021-12-01 |
| publisher | Bina Nusantara University |
| record_format | Article |
| series | ComTech |
| spelling | doaj.art-0bcc268130b3408eae801d4bc00b17162023-08-02T06:03:22ZengBina Nusantara UniversityComTech2087-12442476-907X2021-12-0112212313310.21512/comtech.v12i2.79647038Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm ApproachHengki Tamando Sihotang0STMIK Pelita NusantaraDistribution is one of the essential activities in business because it determines the price of products or goods in the market. So, choosing the shortest path is considered one of the most important things in business, especially distributors. PT Everbright, one of the business actors engaged in the manufacture of batteries and as the main distributor, hopes that the distribution of goods to have the shortest route so that costs can be minimized. The aim of the research was to determine the shortest path in distributing goods in the Medan area to the location of consumers. The research used Ant Colony Optimization (ACO). Determination of the shortest path is based on distance calculations in kilometers, protocol roads, gangs, normal road conditions, and differences between small and major roads. Based on the research results, it is found that the J1 line has the greatest value. So, the path chosen by the ants to pass is J1 which is 11 km away from the departure location (PT Everbright) to the destination (Pasar Glugur Kota). It passes through PT Everbright --> Jln. Gatot Subroto --> Jln. Kapt. Muslim --> Jln. Tgk. Amir Hamzah --> Jln. KH. Syeikh Abdul Wahab Rokan --> Pasar Glugur Kota.https://journal.binus.ac.id/index.php/comtech/article/view/7964shortest pathant colony optimization (aco)algorithm |
| spellingShingle | Hengki Tamando Sihotang Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach ComTech shortest path ant colony optimization (aco) algorithm |
| title | Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach |
| title_full | Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach |
| title_fullStr | Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach |
| title_full_unstemmed | Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach |
| title_short | Determination of the Shortest Path Using the Ant Colony Optimization (ACO) Algorithm Approach |
| title_sort | determination of the shortest path using the ant colony optimization aco algorithm approach |
| topic | shortest path ant colony optimization (aco) algorithm |
| url | https://journal.binus.ac.id/index.php/comtech/article/view/7964 |
| work_keys_str_mv | AT hengkitamandosihotang determinationoftheshortestpathusingtheantcolonyoptimizationacoalgorithmapproach |