Model Rute Perjalanan Minimal Dengan Menggunakan Vehicle Routing Problem Pada PT X

  • Eko Sulistyono Sulistyono Institut Teknologi Batam

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

Download data is not yet available.

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.

Published
2022-07-05
How to Cite
Sulistyono, E. (2022). Model Rute Perjalanan Minimal Dengan Menggunakan Vehicle Routing Problem Pada PT X. Jurnal Teknologi Dan Sistem Informasi Bisnis, 4(2), 293-299. https://doi.org/10.47233/jteksis.v4i2.497