HYBRID ALGORITMA PARTICLE SWARM OPTIMIZATION DENGAN SIMULATED ANNEALING PADA TRAVELLING SALESMAN PROBLEM

HANIFAH, SAKINAH and Dewi, Rustiana Novi and Eliyati, Ning (2019) HYBRID ALGORITMA PARTICLE SWARM OPTIMIZATION DENGAN SIMULATED ANNEALING PADA TRAVELLING SALESMAN PROBLEM. Undergraduate thesis, Sriwijaya University.

[thumbnail of RAMA_44201_08011281419063.pdf] Text
RAMA_44201_08011281419063.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (981kB) | Request a copy
[thumbnail of RAMA_44201_08011281419063_TURNITIN.pdf] Text
RAMA_44201_08011281419063_TURNITIN.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (8MB) | Request a copy
[thumbnail of RAMA_44201_08011281419063_0013117004_0020115903_01_front_ref.pdf] Text
RAMA_44201_08011281419063_0013117004_0020115903_01_front_ref.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.
Download (728kB)
[thumbnail of RAMA_44201_08011281419063_0013117004_0020115903_02.pdf] Text
RAMA_44201_08011281419063_0013117004_0020115903_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (451kB) | Request a copy
[thumbnail of RAMA_44201_08011281419063_0013117004_0020115903_03.pdf] Text
RAMA_44201_08011281419063_0013117004_0020115903_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (205kB) | Request a copy
[thumbnail of RAMA_44201_08011281419063_0013117004_0020115903_04.pdf] Text
RAMA_44201_08011281419063_0013117004_0020115903_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (498kB) | Request a copy
[thumbnail of RAMA_44201_08011281419063_0013117004_0020115903_05.pdf] Text
RAMA_44201_08011281419063_0013117004_0020115903_05.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (194kB) | Request a copy
[thumbnail of RAMA_44201_08011281419063_0013117004_0020115903_06.pdf] Text
RAMA_44201_08011281419063_0013117004_0020115903_06.pdf - Bibliography
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.
Download (157kB) | Request a copy

Abstract

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

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: Traveling Salesman Problem, Particle Swarm Optimization, Simulated Annnealing
Subjects: Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics
Divisions: 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User: Users 805 not found.
Date Deposited: 07 Aug 2019 02:25
Last Modified: 07 Aug 2019 02:25
URI: http://repository.unsri.ac.id/id/eprint/2554

Actions (login required)

View Item View Item