Optimasi Distribusi Koran Menggunakan Metode Saving Matriks (Studi Kasus : PT. Riau Pos Intermedia)
Abstract
Facing globalization era publishment of newspaper entrepreneur world demanded to be more competitive to fulfil consumen request. Process of distribution is strongly needed to be attended. One of important operational decision in process of distribution is determination delivery route can be categorize as Capacitated Vehicle Routing Problem (CVRP). It can be accomplished by using exact optimazition like integer programming. But in finishing need computation that very long time. Solving problem alternative method CVRP that easier is saving matrix. saving matrix conducted by making a matrix called by saving matrix. It contains list of saving acquired when coumpounding 2 consumens in 1 vehicle. Next make a row of consument by using 1 of farthest inserts, inserts cheapest, nearest neighbor and nearest insert metodh giving shortest space. Based on research gained 2 route newspaper distribution Riau pos and result of comparison row consumen show that cheapest method result shortest space is 1,646.067 km.Keywords: CVRP, cheapest, farthest, nearest, neighbour.
References
Afrianita, Siska. Algoritma Multiple Ant Colony System pada Vehicle Routing Problem with Time Windows. Skripsi Jurusan Matematika Fakultas Matematika dan Ilmu Pengetahuan Alam. Universitas Indonesia : Jakarta. 2011.
Chopra, S. dan Meindl, P. Supply Chain Management : Strategy, Planning and Operations. Prentice Hall : New Jersey. 2001.
Christian S., Joseph. Analisis Sistem Pengangkutan Sampah Kota Makassar dengan Metode Penyelesaian Vehicle Routing Problem. Jurusan Teknik Mesin Univesitas Hasanuddin : Makassar. 2011.
Elfahmi, E., F., F. Studi Komparasi Penyelesaian Capacitated Vehicle Rou ting Problem (CVRP) dengan Menggunakan Saving Matix dan Generalized Assignment. Skripsi Jurusan Matematika Universitas Brawijaya : Malang. 2011.
Golden, L. B, et al. Implementing Vehicle Routing Algorithms. Operations Research Center. Institute Technology Cambridge : India. 1975.
Han, Jian. Evaluation of Optimization Algorithms for Improvement of A Transportation Companies (In-House) Vehicle Routing System. University of Nebraska : Lincoln. 2010.
Kara, I., Laporte G., dan Bektas. Anote on the Lifted Miller-Zemlin Subtour Elimination Contraints for the Capacitated Vehicle Routing Problem. European Journal of Operational Research. Vol 158, halaman 793-795. 2004.
Pamungkas, A., N., dkk. Pembentukan Rute Distribusi Air Mineral Al-Ma’soem Menggunakan Metode Clarke Wright dan Nearest Neighbour di PT. Al- Ma’soem Muawanah. Institut Teknologi Nasional : Bandung. 2013.
Rand, K., Graham. The life and times of the Saving Method for Vehicle Routing Problems. The Operations Research Society of South Africa : Afrika Selatan. 2009.
