JAVA Journal of Electrical and Electronics Engineering
Vol 14, No 1 (2016)

Implementation of Traveling Salesman Problem (TSP) based on Dijkstra's Algorithm in the Information System of Delivery Service

Syahputra, M. Firman Aji (Unknown)
Devita, Riri Nada (Unknown)
Siregar, Sherly Allsa (Unknown)
Kirana, Kartika Candra (Unknown)

Article Info

Publish Date
01 Apr 2016

Abstract

Traveling Salesman Problem (TSP) was defined as a task for finding of the shortest route. The finding  of  the  shortest  route influences a price of delivery service and profit of company.  Therefore, we proposed an implementation of Traveling Salesman Problem (TSP) based on Dijkstra’s Algorithm in a information systems of delivery services" for optimizing the finding of shortest route. This algorithm using distance which is extracted from Google Maps. There are 60 routes which are tested. The results show the accuracy of TSP based on Dijkstra’s algorithm is 100%. The results can be concluded that the implementation of Dijkstra’s algorithm is accurate for finding the shortest route.

Copyrights © 2016




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
866.381 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
JAVA Journal of Electrical and Electronics Engineering
Website

Abbrev

java

Publisher

Institut Teknologi Sepuluh Nopember Surabaya

Subject

Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering

Description

JAVA Journal of Electrical and Electronics Engineering is published by the Department of Electrical Engineering Faculty of Industrial Technology, Institut Teknologi Sepuluh Nopember (ITS), Surabaya – Indonesia. Topics include all practical aspects of theory and methods of energy and power system, ...