| dc.contributor.advisor | Silalahi, Bib Paruhum | |
| dc.contributor.advisor | Bakhtiar, Toni | |
| dc.contributor.author | Salsabila, Syifa Azkiyyah | |
| dc.date.accessioned | 2022-12-16T06:38:58Z | |
| dc.date.available | 2022-12-16T06:38:58Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/115573 | |
| dc.description.abstract | Travelling Salesman Problem (TSP) adalah salah satu permasalahan
distribusi yang sering kali ditemui. Penyelesaian dari permasalahan dalam
Travelling Salesman Problem ini adalah mencari rute terpendek atau jarak
minimum. Terdapat beberapa metode yang dikembangkan untuk menyelesaikan permasalahan ini. Mulai dari metode eksak hingga metode modern atau meta heuristic. Dalam penelitian ini, dua metode heuristik digunakan untuk menyelesaikan Travelling Salesman Problem (TSP), yaitu Particle Swarm Optimization (PSO) dan Ant Colony Optimization (ACO). Solusi yang diperoleh kemudian dibandingkan dengan menggunakan metode eksak dalam bentuk Mixed-Integer Linear Programming (MILP). Hasil yang didapat menunjukkan waktu eksekusi metode Particle Swarm Optimization lebih baik daripada metode Mixed-Integer Linear Programming dan algoritme Ant Colony Optimization (ACO). Namun, ada perbedaan yang mencolok dari ketiga metode dalam total jarak perjalanan. | id |
| dc.description.abstract | The Travelling Salesman Problem (TSP) is one of the distribution problems
that is often encountered. The solution of TSP is to find the shortest route or minimum distance. Several methods have been developed to solve this problem. Starting from exact methods to modern methods or meta heuristics. In this study, two heuristic methods will be used to solve TSP, Particle Swarm Optimization and Ant Colony Optimization. The solution obtained will be compared with the solution obtained using the exact method in the form of Mixed-Integer Linear Programming (MILP). The results obtained show that the execution time of the Particle Swarm Optimization method is better than the Mixed-Integer Linear Programming method and Ant Colony Optimization algorithm. However, there is a significant difference among the three methods in the total travel distance. | id |
| dc.language.iso | id | id |
| dc.publisher | IPB University | id |
| dc.title | Penyelesaian Travelling Salesman Problem Menggunakan Algoritme Ant Colony Optimization dan Particle Swarm Optimization | id |
| dc.title.alternative | Solving Travelling Salesman Problem Using Ant Colony Optimization and Particle Swarm Optimization Algorithm | id |
| dc.type | Undergraduate Thesis | id |
| dc.subject.keyword | ant colony optimization | id |
| dc.subject.keyword | integer linear programming | id |
| dc.subject.keyword | particle swarm optimization | id |
| dc.subject.keyword | particle swarm optimization | id |
