TRAVELLING SALESMAN PROBLEM ASSISTED WITH GOOGLE API AND METHOD COMPLETE ENUMERATION

Pratama, Tan Gerry (2013) TRAVELLING SALESMAN PROBLEM ASSISTED WITH GOOGLE API AND METHOD COMPLETE ENUMERATION. Other thesis, Unika Soegijapranata Semarang.

	Text (COVER) 10.02.0003 Tan Gerry Pratama - COVER.pdf Download (310kB)
	Text (CHAPTER 1) 10.02.0003 Tan Gerry Pratama - CHAPTER 1.pdf Download (51kB)
	Text (CHAPTER 2) 10.02.0003 Tan Gerry Pratama - CHAPTER 2.pdf Restricted to Registered users only Download (116kB)
	Text (CHAPTER 3) 10.02.0003 Tan Gerry Pratama - CHAPTER 3.pdf Download (33kB)
	Text (CHAPTER 4) 10.02.0003 Tan Gerry Pratama - CHAPTER 4.pdf Download (39kB)
	Text (CHAPTER 5) 10.02.0003 Tan Gerry Pratama - CHAPTER 5.pdf Download (604kB)
	Text (CHAPTER 6) 10.02.0003 Tan Gerry PratamaCHAPTER 6.pdf Download (32kB)
	Text (REFERENCES) REFERENCES.pdf Download (89kB)

Abstract

In this modem era, a problem traveling salesman problem is often used as an ingredient for solving the problem. Search the shortest distance of a few points are needed in today's remember the importance of time and cost efficiency in transport in the modem era. This application aims to map a user in any city that must be passed first in the desire to achieve the most optimal distance. This application is made with the help of google API (which helps to map meta and distance of the town) and assisted by complete enumeration algorithm that makes comparisons distance of each city and find the optimal point. So if the project has been completed, I wish this application can useful for much people to easier them activities to get a minimum for a route cities.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mrs Christiana Sundari
Date Deposited:	09 Oct 2018 02:39
Last Modified:	09 Oct 2018 02:39
URI:	http://repository.unika.ac.id/id/eprint/16998

Actions (login required)

View Item