SAPUTRA, HIRO SURYA (2024) COMPARISON ANALYSIS OF LOCAL SEARCHES FOR SOLVING SYMMETRIC TRAVELLING SALESMAN PROBLEM. S1 thesis, UNIVERSITAS KATOLIK SOEGIJAPRANATA.
|
Text
18.K1.0039_HIRO SURYA SAPUTRA_COVER_1.pdf Download (679kB) | Preview |
|
![[img]](http://repository.unika.ac.id/style/images/fileicons/text.png) |
Text
18.K1.0039_HIRO SURYA SAPUTRA_BAB I_1.pdf Restricted to Registered users only Download (550kB) |
|
|
Text
18.K1.0039_HIRO SURYA SAPUTRA_BAB II_1.pdf Restricted to Registered users only Download (617kB) |
|
|
Text
18.K1.0039_HIRO SURYA SAPUTRA_BAB III_1.pdf Restricted to Registered users only Download (752kB) |
|
|
Text
18.K1.0039_HIRO SURYA SAPUTRA_BAB IV.pdf Restricted to Registered users only Download (666kB) |
|
|
Text
18.K1.0039_HIRO SURYA SAPUTRA_BAB V.pdf Restricted to Registered users only Download (544kB) |
|
|
Text
18.K1.0039_HIRO SURYA SAPUTRA_DAFPUS.pdf Download (587kB) | Preview |
Abstract
This project serves as the alternative to brute force method and neural network. In this paper we are using two local searches, the “Nearest Vertice” and “Tree Upcycling, Christofides” algorithm. We implement both of them for comparison analysis. The control for this thesis is Gurobipy optimizer. Both algorithms will be compared to each other. We use total distance and runtime comparison. After that we take the next step to compare optimized version of both algorithms. After those several comparison analyses was conducted, we conclude the results in the end.
| Item Type: | Thesis (S1) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science |
| Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
| Depositing User: | ms. Wiwien Vieragustin |
| Date Deposited: | 10 Jul 2025 07:46 |
| Last Modified: | 10 Jul 2025 07:46 |
| URI: | http://repository.unika.ac.id/id/eprint/37120 |
| Keywords: | UNSPECIFIED |
Actions (login required)
 |
View Item |