Model Rute Perjalanan Minimal Dengan Menggunakan Vehicle Routing Problem Pada PT X
Abstract
In this research discusses the problem of distributing goods from a depot to several customer locations to minimize travel costs. The problem is solved by using the Vehicle Routing Problem method. The data used in this research is secondary data with 10 customers and one depot. The aim of this research is to form a model from the data that has been obtained and determine the optimal travel route based on the model that has been formed. The first step is to form the objective function of the problem, then form the constraints that may occur. After the model is formed, a solution to the problem is sought. The total cost of the trip is obtained by multiplying the cost of the trip per kilometer by the total distance traveled.
Downloads
References
Prasetyo, W. dan Tamyiz, M. (2017). Vehicle Routing Problem dengan Aplikasi Metode Nearest Neihbor, Journal of Research and Technology, 03(02),88-99.
Luenberger, D. G. dan Ye, Y. (2021). Linear and Nonlinear Programming 5th Edition. Springer
Ferdiansyah, A., Sholihah, S. A., Rifni, M., Grets, E. S., Situmorang, J. K., dan Oktaviany, I. (2021). Analisis Perencanaan Rute Pengiriman Barang Menggunakan Metode Vehicle Routing Problem (VRP).
Amri, M., Rahman, A., dan Yuniarti, R. (2014). Penyelesaian Vehicle Routing Problem dengan Menggunakan
Metode Nearest Neighbor.
Copyright (c) 2022 Jurnal Teknologi Dan Sistem Informasi Bisnis - JTEKSIS
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under an Attribution 4.0 International (CC BY 4.0) that allows others to share — copy and redistribute the material in any medium or format and adapt — remix, transform, and build upon the material for any purpose, even commercially with an acknowledgment of the work's authorship and initial publication in this journal.
