OPTIMASI ROBUST DALAM PENENTUAN RUTE KENDARAAN PENGANGKUTAN SAMPAH MENGGUNAKAN METODE SAVING MATRIX DAN METODE NEAREST NEIGHBOUR

NURAINA, NURAINA and Evi, Yuliza and Sisca, Octarina (2022) OPTIMASI ROBUST DALAM PENENTUAN RUTE KENDARAAN PENGANGKUTAN SAMPAH MENGGUNAKAN METODE SAVING MATRIX DAN METODE NEAREST NEIGHBOUR. Undergraduate thesis, Sriwijaya University.

	Text RAMA_44201_08011181823097.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_44201_08011181823097_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (7MB) | Request a copy
Preview	Text RAMA_44201_08011181823097_0027077805_0003098401_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (1MB) | Preview
	Text RAMA_44201_08011181823097_0027077805__0003098401_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (199kB) | Request a copy
	Text RAMA_44201_08011181823097_0027077805__0003098401_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (48kB) | Request a copy
	Text RAMA_44201_08011181823097_0027077805__0003098401_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (542kB) | Request a copy
	Text RAMA_44201_08011181823097_0027077805__0003098401_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (116kB) | Request a copy
	Text RAMA_44201_08011181823097_0027077805__0003098401_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (113kB) | Request a copy

Abstract

The problem of the route of the waste transportation vehicle can be viewed as a Vehicle Routing Problem (VRP). VRP that does not have certainty data is called a robust optimization problem. The route of transporting waste from the Temporary Disposal Site (TPS) to the Final Disposal Site (TPA) is carried out randomly, causing the traveled time and distance not to be optimal. Waste volume data cannot be known with certainty or can be change. Therefore, it is necessary to conduct research on robust optimization to get optimal routes. The purpose of this study is to obtain the optimal route of waste transportation in Ilir Barat I District by using the Saving Matrix method and the Nearest Neighbor method. The working time of the waste transportation process in Ilir Barat I District is carried out in two sessions, namely session 1: at 07.00-11.00 WIB and session 2: 16.00- 20.00 WIB. The calculation of waste transportation routes using the Saving Matrix method is obtained by grouping several TPS into one route and sorting using the Nearest Neighbor method. Working time of session 1 (7.00 – 11.00 WIB), waste transport vehicles serve Work Area 1, Work Area 2, Work Area 3, Work Area 4, and Work Area 5 with a total distance of 126,31 km total travel time is 5.6631 hours. As for the working time of session 2 (16.00 – 20.00 WIB) it serves Work Area 6, Work Area 7, Work Area 8, Work Area 9 with a total distance of 151.91 km, total travel time is 6.30095 hours. It was also found that the total travel time of the waste transport vehicle exceeded the working time.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Saving Matrix, Nearest Neighbour, Jarak Perjalanan, Waktu Perjalanan
Subjects:	Q Science > QA Mathematics > QA1-43 General
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Nuraina Nuraina
Date Deposited:	10 Jun 2022 02:04
Last Modified:	10 Jun 2022 02:04
URI:	http://repository.unsri.ac.id/id/eprint/72142

Actions (login required)

View Item