PENCARIAN RUTE OPTIMAL TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA ANT COLONY OPTIMIZATION (ACO)

  • Aliffia Yasya Nuraliya Jurusan Matematika, Prodi Matematika, Universitas Jenderal Soedirman, Indonesia
  • Siti Rahmah Nurshiami Jurusan Matematika, Prodi Matematika, Universitas Jenderal Soedirman, Indonesia
  • Jajang Jajang Jurusan Matematika, Prodi Statistika, Universitas Jenderal Soedirman, Indonesia

Abstract

The implementation of product distribution requires transportation to deliver products effectively across various locations. Challenges encountered during this process include varying distribution sites, travel distances, time taken for product delivery, transportation costs, and other related factors. To address these challenges, selecting an efficient travel route is crucial. The Traveling Salesman Problem (TSP) serves as a practical application of graph theory in tackling such distribution issues. The Ant Colony Optimization (ACO) algorithm emerges as a viable solution for route optimization, particularly in addressing TSP challenges to derive optimal routes. Results derived from the TSP calculations utilizing ACO, executed through the Matlab R2018a application, employed parameters of

Published
2025-06-28
How to Cite
NURALIYA, Aliffia Yasya; NURSHIAMI, Siti Rahmah; JAJANG, Jajang. PENCARIAN RUTE OPTIMAL TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA ANT COLONY OPTIMIZATION (ACO). Jurnal Ilmiah Matematika dan Pendidikan Matematika, [S.l.], v. 17, n. 1, p. 101-114, june 2025. ISSN 2550-0422. Available at: <https://jos.unsoed.ac.id/index.php/jmp/article/view/15866>. Date accessed: 01 july 2025. doi: https://doi.org/10.20884/1.jmp.2025.17.1.15866.

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.