HYBRID ALGORITMA PARTICLE SWARM OPTIMIZATION DENGAN SIMULATED ANNEALING PADA TRAVELLING SALESMAN PROBLEM
Daftar Isi:
- Traveling Salesman Problem is one of the optimization problems to find the shortest route a salesman must travel to a number of cities exactly once and return to the city early. Transporting garbage is one of the problems for Traveling Salesman Problem (TSP). There are many algorithms that can be used to find the shortest route such as Particle Swarm Optimization (PSO) algorithm and Simulated Annealing (SA). This study aims to apply a combination of PSO and SA algorithms to solve the problem of finding the shortest route of garbage transportation in the Ilir Barat II District. On the combined PSO algorithm with SA, the shortest route for trash transportation is obtained TPA → TPS 7 (Pasar Tangga Buntung) → TPS 3 (Ki Gede Ing Suro) → TPS 1 (Jl. Diponogoro) → TPS4(Jl. Ratna, Jl. Talang Kerangga) → TPS 5 (Jl. Makrayu, Jl.Rambutan) → TPS 6 (Jl. Jambu) → TPS 8 (Pasar Sekanak) → TPS 2 (SMPN 1 Palembang)→TPA, with a distance of 21,905 km