Pencarian Rute Terpendek dalam Pengantaran Surat dalam Menggunakan Algoritma Artficial Bee Colony di Kantor Kelurahan Kolhua

SUAT, Elsy Anita (2020) Pencarian Rute Terpendek dalam Pengantaran Surat dalam Menggunakan Algoritma Artficial Bee Colony di Kantor Kelurahan Kolhua. Diploma thesis, Universitas Katolik Widya Mandira.

	Text COVER-ABSTRAK_opt.pdf Download (389kB)
	Text BAB I-converted.pdf Download (185kB)
	Text BAB II-converted.pdf Download (284kB)
	Text BAB III-converted.pdf Download (115kB)
	Text BAB IV-converted.pdf Download (994kB)
	Text BAB V-converted.pdf Download (116kB)
	Text BAB VI-converted.pdf Download (97kB)

Abstract

The optimum path recommendations are really needed by employees. This is due to the many problems encountered when delivering a messenger is the lack of information about the location of the RT / RW, so that officers have difficulty in determining the shortest route and alternative routes in conducting mail delivery. This of course will spend time in finding a destination location so that all delivery of mail does not work on the same day and there are often delays in receiving mail. Therefore, we need a calculation that can recommend an efficient route for mail delivery. One method that can solve the shortest path problem is the Artificial Bee Colony algorithm. Meanwhile, the tool used is visual studio code with the Python programming language and mongodb as a database and map display using Google earth and Google maps. The experiment that have been done with the Artificial Bee Colony algorithm it proved that the distance data from RW 004 to RT 034 is closer to the predicted result in the calculations process produces different values by doing a manual calculations 588,9 meters and the numbers of iterations is 10 while calculations using the system can be obtained with on optimum distance is 588,6 meters and the numbers of iterations is 500. Thus, it is very helpful for the office to determine the closest route so that the cost incurred can be minized to accelerate the delivery of mail.

Actions (login required)

View Item