PENGEMBANGAN SISTEM PENDUKUNG CAPACITATED VEHICLE ROUTING PROBLEM WITH MULTIPLE PRODUCT (STUDI KASUS : AMDK TIRTA BINANGUN)

Risa Nurvitasari, NIM.: 19106060004 (2023) PENGEMBANGAN SISTEM PENDUKUNG CAPACITATED VEHICLE ROUTING PROBLEM WITH MULTIPLE PRODUCT (STUDI KASUS : AMDK TIRTA BINANGUN). Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (PENGEMBANGAN SISTEM PENDUKUNG CAPACITATED VEHICLE ROUTING PROBLEM WITH MULTIPLE PRODUCT (STUDI KASUS : AMDK TIRTA BINANGUN)) 19106060004_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (1MB) | Preview
	Text (PENGEMBANGAN SISTEM PENDUKUNG CAPACITATED VEHICLE ROUTING PROBLEM WITH MULTIPLE PRODUCT (STUDI KASUS : AMDK TIRTA BINANGUN)) 19106060004_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (4MB) | Request a copy

Abstract

AMDK Tirta Binangun Kulon Progo is a company that produces bottled drinks under the brand name AirKu. Its product variants consist of 120ml cups, 240ml cups, 330ml bottles, 600ml bottles, and 19-liter gallons. In the distribution process, the company does not have a specific method for determining routes. This has not guaranteed that the distribution route taken is optimal. Another problem is the limited number of vehicles used. Therefore, to solve these issues, the Capacitated Vehicle Routing Problem with Multiple Products (CVRPMP) can be employed. Route determination is based on the vehicle's capacity, where one vehicle can carry multiple product variants. The method used is Nearest Neighbour. To solve the problem, several applications are integrated, such as Ms. Excel, Matlab, and Google Maps, into one unified system that can facilitate route optimization. The results obtained are proposed routes that are better than the company's initial method, and capable of reducing distance by 9.49%.

Share this knowledge with your friends :

Actions (login required)

View Item