Article Per Year (5 Year)
p-Index From 2019 - 2024
0.947
P-Index
This Author published in this journals
All Journal IAES International Journal of Artificial Intelligence (IJ-AI) Bulletin of Electrical Engineering and Informatics Prosiding SNATIKA Vol 01 (2011) Sinkron : Jurnal dan Penelitian Teknik Informatika International Journal of Natural Science and Engineering Jurnal Masyarakat Indonesia
Poltak Sihombing
FMIPA USU, Medan
Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

Published : 6 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Sinkron : Jurnal dan Penelitian Teknik Informatika

 1 
Combination of Ant Colony Tabu Search Algorithm with Firefly Tabu Search Algorithm (ACTS-FATS) in Solving the Traveling Salesman Problem (TSP) Harahap, Siti Sarah; Sihombing, Poltak; Zarlis, Muhammad
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 1 (2023): Articles Research Volume 7 Issue 1, 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i1.12016

Abstract

Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem, one of the optimization problems that can be applied to various activities such as finding the shortest path. The optimization problem in TSP is the most widely discussed and has become the standard for testing computational algorithms. TSP is a good object to test optimization performance. With scientific developments in the field of informatics, many researchers have optimized the application of algorithms to solve the Traveling Salesman Problem (TSP). In this study, researchers used a combination of Ant Colony Tabu Search – Firefly Algorithm Tabu Search (ACTS-FATS). The combination is doneto overcome Premature Convergence (trapped local optimum) which is a shortcoming of the ant colony algorithm, get the best running time by looking at the process of each point movement with the ant colony and firefly methods. After testing, getting the best running time results of 27.79%, and getting an accuracy rate of 17%.
Co-Authors Erna Budhiarti Nababan Fauzan Nurahmadi Ghazali, Alfin Gunawan Gunawan Harahap, Siti Sarah Muhammad Zarlis, Muhammad Opim Salim Sitompul Sutarman Sutarman