Vehicle Routing Problem for Optimizing the Canvassing Distribution System at CV Anugrah Semata Wayang 67

Putri, Aysah, Yusnia (2026) Vehicle Routing Problem for Optimizing the Canvassing Distribution System at CV Anugrah Semata Wayang 67. S1 thesis, Universitas Andalas.

[img] Text (Cover dan Abstrak)
Cover dan Abstrak.pdf - Published Version

Download (418kB)
[img] Text (BAB I)
BAB I.pdf - Published Version

Download (704kB)
[img] Text (BAB Akhir)
BAB Akhir.pdf - Published Version

Download (217kB)
[img] Text (Daftar Pustaka)
Daftar Pustaka.pdf - Published Version

Download (233kB)
[img] Text (Tugas Akhir Full Text)
Skripsifulltext.pdf - Published Version
Restricted to Repository staff only

Download (6MB) | Request a copy

Abstract

The main problem faced by CV Anugrah Semata Wayang 67, particularly in the distribution operations of Team 1 in the Padang City, Solok Regency, and South Solok Regency areas, is low operational efficiency due to the absence of a structured routing and scheduling system. Product loading in the canvassing system is still based on subjective estimation without demand forecasting, which leads to the risk of stock mismatches. In addition, route determination is carried out manually using a nearest-neighbor approach, often resulting in overlapping routes, backtracking, and increased fuel consumption. This study adopts a data-driven approach by utilizing time series forecasting methods to estimate customer demand based on historical data. Furthermore, the distribution problem is modeled using the Periodic Vehicle Routing Problem with Multiple Products (PVRPMP) to determine optimal visit schedules and delivery routes within a six-day planning horizon. The model is solved using two approaches: an exact method with the Gurobi Optimizer and a metaheuristic method using the Cuckoo Search Algorithm (CSA). The analysis process is supported by software such as Minitab, Microsoft Excel, Google Maps, and Python. The results show that the implementation of the PVRPMP model significantly improves distribution efficiency. The total travel distance is reduced by 599.36 km per month (27.76%), from 2,758.72 km to 2,159.36 km. This reduction leads to operational cost savings of Rp565,497.18 per month or Rp6,785,966.14 annually. From an economic feasibility perspective, the analysis results show a Benefit-Cost Ratio (BCR) of 1.767 (>1), indicating that the proposed solution is feasible to implement as it provides greater benefits than the costs incurred. The distribution schedule in the Padang area is optimized from six days to five working days, providing opportunities for market expansion. Therefore, the integration of demand forecasting and route optimization based on PVRPMP is proven to be effective in improving distribution efficiency. This approach not only reduces costs and travel distance but also provides strategic flexibility in managing company operations.

Item Type: Thesis (S1)
Supervisors: Eri Wirdianto, S.T., M.Sc
Uncontrolled Keywords: Distribution, Canvassing; Forecasting; Periodic Vehicle Routing Problem with Multiple Products and Multi-Day Trips (PVRPMP); Delivery Scheduling.
Subjects: H Social Sciences > HE Transportation and Communications
Q Science > Q Science (General)
Q Science > QA Mathematics
T Technology > T Technology (General)
Divisions: Fakultas Teknik > S1 Teknik Industri
Depositing User: S1 Teknik Industri
Date Deposited: 23 Apr 2026 10:10
Last Modified: 23 Apr 2026 10:10
URI: http://scholar.unand.ac.id/id/eprint/525070

Actions (login required)

View Item View Item