Model vehicle routing problem untuk penentuan rute distribusi unit sepeda motor dengan metode saving matrix

Mohammad Cipto Sugiono

Abstract


PT X is a manufacturing company that produces motorcycle units. With the continuous increase of product demand from consumers, it makes PT X being one of the largest manufacturing companies in Indonesia. As long this determination of the distribution route is conducted by PT X only based on the experience and knowledge of the drivers. The distribution route should include the configuration of the appropriate distribution channels, in order for the delivery to be fast at a low cost. This problem is known as the Vehicle Routing Problem (VRP). To overcome the problem must conduct research in the hope to minimize the cost of distribution of motorcycle units to the dealers, that is by calculating fuel consumption, tolls chargers, bundles of units and loading and unloading. The problem Vehicle Routing Problem (VRP) is solved by using Saving Matrix method. The calculation result can minimize distribution costs of Rp3.323.500,-. While the actual cost of the company is Rp3.530.000,-. So it can be seen that there is a deease in the cost of Rp206.500/day.

 

Model Vehicle Routing Problem (VRP) untuk penentuan rute distribusi unit sepeda motor dengan metode saving matrix


Keywords


vehicle routing problem, saving matrix

Full Text:

PDF

References


D. B. Paillin and F. Sosebeko, “Penentuan rute optimal distribusi produk nestle dengan metode traveling salesman problem (tTSP) (Studi kasus: PT. Paris Jaya Mandiri),” ARIKA, vol. 11, no. 1, pp. 35–44, Mar. 2017, doi: 10.30598/arika.2017.11.1.35.

V. Suwanti, P. Bintoto, and R. N. I. Dinullah, “Penerapan min plus algebra pada penentuan rute tercepat distribusi susu,” Limits: Journal of Mathematics and Its Applications, vol. 14, no. 2, pp. 103–112, Dec. 2017, doi: 10.12962/limits.v14i2.3085.

A. K. Garside and S. Sudaningtyas, “Performansi algoritma CODEQ dalam penyelesaian vehicle routing problem,” Jurnal Teknik Industri, vol. 16, no. 1, pp. 53–58, May 2014, doi: 10.9744/jti.16.1.53-58.

A. Kurnia and D. Ernawati, “Perencanaan rute distribusi yang optimal dengan metode algoritma differential evolution (DE) PT. XYZ,” JUMINTEN, vol. 2, no. 4, pp. 73–84, Jul. 2021, doi: 10.33005/juminten.v2i4.244.

A. K. Garside and D. N. Cahyanti, “Penyelesaian vehicle routing problem with simultaneous pick up and delivery dengan algoritma tabu search,” Jurnal Ilmiah Teknik Industri, vol. 17, no. 2, pp. 125–134, Dec. 2018, doi: 10.23917/jiti.v17i2.6703.

R. Saraswati, W. Sutopo, and M. Hisjam, “Penyelesaian capacitated vechile routing problem dengan menggunakan algoritma sweep untuk penentuan rute distribusi koran: Studi kasus,” Jurnal Manajemen Pemasaran, vol. 11, no. 2, pp. 41–44, Oct. 2017, doi: 10.9744/pemasaran.11.2.41-44.

E. Armandi, A. Purwani, and U. Linarti, “Optimasi rute pengangkutan sampah kota Yogyakarta menggunakan hybrid genetic algorithm,” Jurnal Ilmiah Teknik Industri, vol. 18, no. 2, pp. 236–244, Dec. 2019, doi: 10.23917/jiti.v18i2.8744.

D. B. Paillin and F. M. Kaihatu, "Implementasi metode saving matrix dalam penentuan rute terbaik untuk meminimumkan biaya distribusi (UD. Roti Arsita)," ARIKA, vol. 12, no. 2, pp. 123-140, 2018, doi: 10.30598/arika.2018.12.2.123.

M. Maulidiah, J. Jono, and I. R. Ramli, “Penentuan rute penyaluran bantuan bencana guna meminimalkan biaya distribusi dengan metode saving matriks,” Jurnal Rekayasa Industri (JRI), vol. 1, no. 1, Oct. 2019, doi: 10.37631/jri.v1i1.57.

A. Mirza and D. Irawan, “Implementasi metode saving matrix pada sistem informasi distribusi barang”, jurnalmatrik, vol. 22, no. 3, pp. 316-324, Dec. 2020, doi: 10.33557/jurnalmatrik.v22i3.1050.

F. Ahmad and H. F. Muharram, “Penentuan jalur distribusi dengan metode saving matriks: penentuan jalur distribusi dengan metode saving matriks,” Competitive, vol. 13, no. 1, pp. 45–66, Dec. 2018, doi: 10.36618/competitive.v13i1.346.

R. A. Tyas, S. Dzulqarnain, and Q. Aini, “Optimasi jalur distribusi pada Kopkar PT. YKK AP Indonesia dengan metode saving matrix,” Sistemasi: Jurnal Sistem Informasi, vol. 9, no. 2, pp. 215–225, May 2020, doi: 10.32520/stmsi.v9i2.689.

A. D. Anggraeni and R. Rusindiyanto, “Analisa penentuan rute produk pupuk organik dengan menggunakan metode saving matrix pada PT. XYZ Surabaya,” JUMINTEN, vol. 1, no. 4, pp. 12–23, Jul. 2020, doi: 10.33005/juminten.v1i4.106.

T. Talitha and D. Hudalah, “Model kerjasama antar daerah dalam perencanaan sistem transportasi wilayah metropolitan Bandung Baya,” TATALOKA, vol. 16, no. 4, pp. 194–208, Nov. 2014, doi: 10.14710/tataloka.16.4.194-208.

N. S. Yunas and M. Huda, “Kebijakan revitalisasi sistem transportasi publik sebagai langkah antisipatif kemacetan total di kota malang,” CosmoGov: Jurnal Ilmu Pemerintahan, vol. 3, no. 1, pp. 116–126, Apr. 2017, doi: 10.24198/cosmogov.v3i1.12639.

K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: State of the art classification and review,” Computers & Industrial Engineering, vol. 99, pp. 300–313, Sep. 2016, doi: 10.1016/j.cie.2015.12.007.

T. A. El-Sayed and H. H. El-Mongy, “Free vibration and stability analysis of a multi-span pipe conveying fluid using exact and variational iteration methods combined with transfer matrix method,” Applied Mathematical Modelling, vol. 71, pp. 173–193, Jul. 2019, doi: 10.1016/j.apm.2019.02.006.

W. Kosasih, Ahmad, L. L. Salomon, and Febricky, “Comparison study between nearest neighbor and farthest insert algorithms for solving VRP model using heuristic method approach,” IOP Conference Series: Materials Science and Engineering, vol. 852, no. 1, p. 12090, Jul. 2020, doi: 10.1088/1757-899X/852/1/012090.

D. A. P. Putri, “Vehicle routing problem dengan time window untuk multiple product dan multiple route menggunakan algoritma sequential insertion,” Jurnal Teknik Industri, vol. 17, no. 1, pp. 22–30, 2016, doi: 10.22219/JTIUMM.Vol17.No1.22-30.

N. Rahmawati, S. Dewi, and M. D. P. Putra, “Distribution route of cement 40’s kg package at PT.XYZ using saving matrix”, TJAIE, vol. 4, no. 02, pp. 65-68, 2021, doi: 10.36456/tibuana.4.02.3749.65-68.

A. Al-Adwan, B. A. Mahafzah, and A. Sharieh, “Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-Hypercube and OTIS-Mesh optoelectronic architectures,” The Journal of Supercomputing, vol. 74, no. 1, pp. 1–36, Jan. 2018, doi: 10.1007/s11227-017-2102-y.

S. Hougardy and M. Wilde, “On the nearest neighbor rule for the metric traveling salesman problem,” Discrete Applied Mathematics, vol. 195, pp. 101–103, Nov. 2015, doi: 10.1016/j.dam.2014.03.012.




DOI: http://dx.doi.org/10.36055/jiss.v7i2.14018

Refbacks

  • There are currently no refbacks.


  is supported by