GUNAWAN, T JENG RICKY (2014) Travelling Salesman Problem Assisted WITH TABU SEARCH ALGORITHM. Other thesis, Unika Soegijapranata Semarang.
|
Text (COVER)
10.02.0024 Tjeng Ricky Gunawan - COVER.pdf Download (311kB) | Preview |
|
|
Text (CHAPTER 1)
10.02.0024 Tjeng Ricky Gunawan - CHAPTER 1.pdf Download (31kB) | Preview |
|
![[img]](https://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (CHAPTER 2)
10.02.0024 Tjeng Ricky Gunawan - CHAPTER 2.pdf Restricted to Registered users only Download (131kB) |
|
|
Text (CHAPTER 3)
10.02.0024 Tjeng Ricky Gunawan - CHAPTER 3.pdf Download (27kB) | Preview |
|
|
Text (CHAPTER 4)
10.02.0024 Tjeng Ricky Gunawan - CHAPTER 4.pdf Download (77kB) | Preview |
|
|
Text (CHAPTER 5)
10.02.0024 Tjeng Ricky Gunawan - CHAPTER 5.pdf Download (476kB) | Preview |
|
|
Text (CHAPTER 6)
10.02.0024 Tjeng Ricky Gunawan - CHAPTER 6.pdf Download (27kB) | Preview |
|
|
Text (REFERENCES)
10.02.0024 Tjeng Ricky Gunawan - REFERENCES.pdf Download (56kB) | Preview |
Abstract
In this modern era, the TSP problem is often used as an ingredient to solve the problem. Find I he shortest distance from the distance between two cities is needed in these days given the importance of time efficiency and cost of transportation in the modern era. This application aims to find the shortest distance from the past some of the city taken. This application is created by saving the city in the distance and in a matrix and then processed into the tabu search algorithm
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Mrs Christiana Sundari |
| Date Deposited: | 16 Oct 2018 08:15 |
| Last Modified: | 16 Oct 2018 08:15 |
| URI: | http://repository.unika.ac.id/id/eprint/17088 |
Actions (login required)
 |
View Item |
