APLIKASI ALGORITMA BRANCH AND PRICE DENGAN MODEL SYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM (SCVRP) UNTUK MEMINIMALKAN RUTE KENDARAAN PENGANGKUT SAMPAH WILAYAH ILIR TIMUR II

SHOFIATUSYIFA, SHOFIATUSYIFA and Puspita, Fitri Maya and Dwipurwani, Oki (2019) APLIKASI ALGORITMA BRANCH AND PRICE DENGAN MODEL SYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM (SCVRP) UNTUK MEMINIMALKAN RUTE KENDARAAN PENGANGKUT SAMPAH WILAYAH ILIR TIMUR II. Undergraduate thesis, Sriwijaya University.

Preview	Text RAMA_44201_08011181520023_0006107501_0028047201_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (1MB) | Preview
	Text RAMA_44201_08011181520023_0006107501_0028047201_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (222kB) | Request a copy
	Text RAMA_44201_08011181520023_0006107501_0028047201_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (30kB) | Request a copy
	Text RAMA_44201_08011181520023_0006107501_0028047201_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (594kB) | Request a copy
	Text RAMA_44201_08011181520023_0006107501_0028047201_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (67kB) | Request a copy
	Text RAMA_44201_08011181520023_0006107501_0028047201_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (30kB) | Request a copy
	Text RAMA_44201_08011181520023_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (11MB) | Request a copy
	Text RAMA_44201_08011181520023.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy

Abstract

The limited capacity of garbage transport vehicles and the lack of capacity of polling stations to collect garbage is the cause of landfill at various points. The landfill at certain points are the priority of polling stations visited first without considering the minimization of the distance. In the field there is also the use of garbage transport vehicles that overlap in the one WK (working area) that transports garbage in other WK, resulting in the route of garbage transport vehicles not being optimal. Therefore, it is necessary to optimize the route of travel that is traversed by garbage transport vehicles. The object of this research is TPS in Ilir Timur II Subdistrict. Ilir Timur II Subdistrict has seven polling stations which are divided into four WK, each WK is handled by a garbage transport vehicle. This research models the problem of garbage transport vehicle routes in the SCVRP model and is solved by the Branch and Price algorithm. Based on the results and discussion, the minimum total distance was obtained, for WK 1 was 69 km, WK 2 was 72.4 km, WK 3 was 33.8 km, and WK 4 was 72.6 km. The route of WK 1, WK 2, and WK 4 transport vehicles is optimal if handled by two garbage transport vehicles, while WK 3 is optimal if handled by a garbage transport vehicle.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	SCVRP, Branch and Price, Metode Simpleks Direvisi
Subjects:	Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Users 839 not found.
Date Deposited:	16 Aug 2019 05:26
Last Modified:	20 Aug 2019 08:01
URI:	http://repository.unsri.ac.id/id/eprint/4291

Actions (login required)

View Item