Penentuan Optimasi Rute Distribusi Sparepart dengan Metode Vehicle Routing Problems (Studi Kasus di UD. Aji Batara Perkasa).

Ainia, Qorrotun (2020) Penentuan Optimasi Rute Distribusi Sparepart dengan Metode Vehicle Routing Problems (Studi Kasus di UD. Aji Batara Perkasa). Undergraduate thesis, UNIVERSITAS 17 AGUSTUS 1945 SURABAYA.

	Text ABSTRAK.pdf Download (684kB)
	Text (BAB I) BAB 1.pdf Restricted to Registered users only Download (1MB) | Request a copy
	Text (BAB II) BAB 2.pdf Restricted to Registered users only Download (1MB) | Request a copy
	Text (BAB III) BAB 3.pdf Restricted to Repository staff only Download (1MB) | Request a copy
	Text (BAB IV) BAB 4.pdf Restricted to Repository staff only Download (1MB) | Request a copy
	Text (BAB V) BAB 5.pdf Restricted to Repository staff only Download (1MB) | Request a copy
	Text LAMPIRAN.pdf Download (1MB)
	Text JURNAL.pdf Download (525kB)
	Text JURNAL TURNITIN.pdf Download (2MB)

Abstract

UD. Aji Batara Perkasa which is located on Jalan Colonel Sugiono No. 14b Ngingas Waru Sidoarjo is a manufacturing company that manufactures motorcycle spare parts. This company has a distribution characteristic, that is, shipping is done based on opening hours of store closes. currently the distribution is still using the area zone in accordance with the number of the fleet. Distribution in this way is not necessarily optimal, because in sending goods the company cannot maximize its fleet capacity. If there is a demand greater than the capacity of the fleet, shipments are sent the next day and will be fulfilled the next day, which means the product delay is 1 day. However, if there is a fleet in advance until the company, the fleet will send goods to the customer, or that often happens in the field of the fleet that is used to send to the Mojokerto and Sidoarjo region, also used for shipping to Surabaya without considering the route of each shipment and the route is still random . In this study, the sweep algorithm approach is used to cluster all customers then continue the mixed integer linear programming method applied to the capacitated vehicle routing problem with time windows model to determine the best route to meet consumer demand without exceeding the capacity of existing vehicles to minimize costs delivery. the development of a mixed integer linear programming model obtained shipping costs of Rp. 820,000 and managed to save costs by Rp. 120,000 or managed to save 15%. While on the proposed route using alternative time can be obtained savings of 7% and on the proposed route with an alternative distance of 12%.

Actions (login required)

View Item