LESTARI, - (2013) TRAVELING SALESMAN PROBLEM USING ANT COLONY OPTIMIZATION ALGORITHM. Other thesis, Unika Soegijapranata Semarang.
|
Text (COVER)
10.02.0013 Lestari - COVER.pdf Download (351kB) | Preview |
|
|
Text (CHAPTER 1)
10.02.0013 Lestari - CHAPTER 1.pdf Download (43kB) | Preview |
|
![[img]](https://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (CHAPTER 2)
10.02.0013 Lestari - CHAPTER 2.pdf Restricted to Registered users only Download (297kB) |
|
|
Text (CHAPTER 3)
10.02.0013 Lestari - CHAPTER 3.pdf Download (24kB) | Preview |
|
|
Text (CHAPTER 4)
10.02.0013 Lestari - CHAPTER 4.pdf Download (98kB) | Preview |
|
|
Text (CHAPTER 5)
10.02.0013 Lestari - CHAPTER 5.pdf Download (849kB) | Preview |
|
|
Text (CHAPTER 6)
10.02.0013 Lestari - CHAPTER 6.pdf Download (25kB) | Preview |
|
|
Text (REFERENCES)
10.02.0013 Lestari - REFERENCES.pdf Download (23kB) | Preview |
Abstract
The Traveling Salesman Problem is one of the most intensively studied problems in computational mathematics. 71ze traveling salesman problem consists ofa salesman and a set of cities. The salesman has to visit each one of the cities starting from a certain one (e.g. the hometown) and relllrning to the same city. The challenge of the problem is that the traveling salesman wants to minimize the total length of the trip. The Ant Colony Optimization (ACO) meta-heuristic is inspired by the foraging behavior of real ants, in particular by the way ants find short paths between their nest and food sources. While a single ant has limites vision and would not be able to accomplish this feat, a swarm of ants can succeed by indirectly communicating via pheromone markings. This project described about the issue in traveling salesman problem which discusses the problem of finding the shortest route in the graph in order to go through all places and back at the starting place. The purpose of this project is to solve the problem in determining the route using Ant Colony Optimization so that the travel distance to the all places is being optimal.
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works 000 Computer Science, Information and General Works > 020 Library and Information Science |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Mrs Christiana Sundari |
| Date Deposited: | 16 Oct 2018 08:10 |
| Last Modified: | 16 Oct 2018 08:10 |
| URI: | http://repository.unika.ac.id/id/eprint/17071 |
Actions (login required)
 |
View Item |
