Article Per Year (5 Year)
p-Index From 2021 - 2026
1.77
P-Index
This Author published in this journals
All Journal TEKNIK INFORMATIKA Scan : Jurnal Teknologi Informasi dan Komunikasi e-Jurnal Arus Elektro Indonesia INTEGER: Journal of Information Technology PROMINE Prosiding Seminar Nasional Sains dan Teknologi Terapan Jurnal Telematika English Focus: Journal of English Language Education International Journal of Artificial Intelligence and Robotics (IJAIR) KERNEL: Jurnal Riset Inovasi Bidang Informatika dan Pendidikan Informatika Prosiding Seminar Nasional Teknik Elektro, Sistem Informasi, dan Teknik Informatika (SNESTIK)
Siti Agustini, Siti
Institut Teknologi Adhi Tama Surabaya (ITATS)
Computer Science & IT Control & Systems Engineering Earth & Planetary Sciences Education Electrical & Electronics Engineering Engineering Environmental Science Languange, Linguistic, Communication & Media Other

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

Found 1 Documents
Search
Journal : TEKNIK INFORMATIKA

 1 
RUTE TERPENDEK ALGORITMA PARTICLE SWARM OPTIMIZATION DAN BRUTE FORCE UNTUK OPTIMASI TRAVELLING SALESMAN PROBLEM Muchamad Kurniawan; Farida Farida; Siti Agustini
JURNAL TEKNIK INFORMATIKA Vol 14, No 2 (2021): JURNAL TEKNIK INFORMATIKA
Publisher : Department of Informatics, Universitas Islam Negeri Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/jti.v14i2.19094

Abstract

Distribution becomes an important measure of marketing success. Traveling Salesman Problem is an example of a case that can be implemented in a distribution case study to get the shortest route through which a distributor passes. The distributor must pass each node (address or city) once in a while and then return to the node where he started. Traveling salesman problems emerge as part of logistical and transportation problems that have developed and utilized in the current period which is growing in various sectors. This research proposes using the Particle Swarm Optimization and Brute Force method to compare the performance of the two methods to get the shortest route. The study was conducted in several experiments the number of points (nodes) namely 5, 10, 15, 20, 25, and 30 nodes. Overall experiments, the Particle Swarm Optimization algorithm is superior to Brute Force. The route produced by Particle Swarm Optimization has a shorter distance than Brute Force
Co-Authors Alfredo Bayu Satriya Amrullah, Wachid Ismail Charles Blanov Hasudungan Pakpahan Citra Nurina Prabiantissa Danang Haryo Sulaksono, Danang Haryo Dhiyas Rakha Allam Allam Dian Puspita Hapsari Enggar Alfianto Evy Nur Amalina Fahrezi Kusuma, Andra Fajar Yulian Siska Utama Fanani, Yazid Farida Farida Gusti Eka Yuliastuti Imani, Moch. Lazuardi Maftahatul Hakimah, Maftahatul Moch. Lazuardi Imani Muchamad Kurniawan Muchamad Kurniawan, Muchamad Muhammad, Widad Muhima, Rani Rotul Norita Prasetya Wardhani Ritonga, Mario Franko Ezra Hasiholan Wachid Ismail Amrullah Wachid, Aldi