GDL

Journal from gdlhub / 2020-06-02 11:37:17
By : Rezania Agramanisti Azdy, Febriyanti Darnis, JNTETI
Created : 2020-06-02, with 1 files

Keyword : Shortest Path, Tempat Penampungan Sementara, Tempat Pemrosesan Akhir
Url : http://ejnteti.jteti.ugm.ac.id/index.php/JNTETI/article/view/532
Document Source : WEB

The problem of waste in big cities in Indonesia is still the main focus of the related department. Generally, the problem is the lack of garbage transport facilities that can be used to transport waste from the temporary shelter (Tempat Penampungan Sementara, TPS) to the final processing site (Tempat Pemrosesan Akhir, TPA). This lack of garbage transport makes the garbage contained in TPS not fully transportable to TPA due to limited capacity and operational time of the related service. In overcoming this problem, optimization of garbage transport facility utilization can be carried out to optimize the capacity of the garbage transported by finding the shortest path that can be traversed by the garbage transporter. This paper aims to apply the Bellman-Ford algorithm for determining waste collection routes. The Bellman-Ford algorithm allows a negative weighting for its edge value, so that it can anticipate the possible costs to be incurred in the selection of the garbage collection path. The stages of this paper were data requirements analysis, design, implementation, and testing. The results of the study are trajectories with a minimum cost from the origin location to the destination location, although it does not pass through all TPS that must be visited.

Give Comment ?#(0) | Bookmark

Property	Value
Publisher ID	gdlhub
Organization	JNTETI
Contact Name	Herti Yani, S.Kom
Address	Jln. Jenderal Sudirman
City	Jambi
Region	Jambi
Country	Indonesia
Phone	0741-35095
Fax	0741-35093
Administrator E-mail	elibrarystikom@gmail.com
CKO E-mail	elibrarystikom@gmail.com