Penyelesaian Heterogenous Fleet Vehicle Routing Problem with Time Windows Menggunakan Algoritma Sequential Insertion

Main Article Content

Marrica Ahmad
Annisa Kesy Garside

Abstract

Intisari— PT Sarwa Jaya Bersama merupakan distributor bihun jagung yang berlokasi di Surabaya. Dalam mendistribusikan produk tersebut, retail memiliki jam buka dan tutup dan kendaraan yang digunakan memilki kapasitas yang berbeda-beda. Permasalahan rute yang dihadapi perusahaan adalah kendaraan kadang-kadang datang terlambat sehingga pengiriman harus dijadwalkan ulang. Selain itu pemilihan kendaraan yang tepat untuk mengunjungi retail akan mempengaruhi total biaya bahan bakar yang dikeluarkan. Untuk menyelesaikan permasalahan perusahaan, penelitian ini mengusulkan penentuan rute dengan menggunakan algoritma sequential insertion. Dengan menggunakan algoritma ini, terbentuk 3 rute dengan jarak tempuh yang lebih minimum dan kedatangan kendaraan berada pada jam buka dan tutup pada masing-masing retail. Penghematan biaya bahan bakar dengan rute usulan sebesar 45,31% atau sejumlah Rp 254.720.



Abstract— PT Sarwa Jaya Bersama is a distributor of corn vermicelli located in Surabaya. In distributing these products, retailers have opening and closing hours and the vehicles used have different capacities. The route problem faced by the company is that vehicles sometimes arrive late so deliveries must be rescheduled. In addition, the selection of the right vehicle to visit the retail will affect the total fuel costs incurred. To solve the company's problems, this research proposes determining the route by using sequential insertion algorithm. By using this algorithm, 3 routes are formed with a minimum mileage and vehicle arrivals are at the opening and closing hours of each retail. The fuel cost savings with the proposed route is 45.31% or Rp 254,720.

Dimensions

Downloads

Download data is not yet available.

Article Details

Section
Articles
Author Biographies

Marrica Ahmad, Universitas Muhammadiyah Malang

Jurusan Teknik Industri Universitas Muhammadiyah Malang Jln. Raya Tlogomas No. 246, Malang 65144

Annisa Kesy Garside, Universitas Muhammadiyah Malang

Jurusan Teknik Industri Universitas Muhammadiyah Malang Jln. Raya Tlogomas No. 246, Malang 65144

References

Paolo Toth & Daniele Vigo et al., “V ehicle R outing,” Public Transp., vol. 4, no. 1–2, pp. 573–586, 2006, [Online]. Available: http://liu.diva-portal.org/smash/get/diva2:22533/FULLTEXT01.

E. Choi and D. W. Tcha, “A column generation approach to the heterogeneous fleet vehicle routing problem,” Comput. Oper. Res., vol. 34, no. 7, pp. 2080–2095, 2007, doi: 10.1016/j.cor.2005.08.002.

J. Sripriya, A. Ramalingam, and K. Rajeswari, “A hybrid Genetic Algorithm for Vehicle Routing Problem with Time Windows,” ICIIECS 2015 - 2015 IEEE Int. Conf. Innov. Information, Embed. Commun. Syst., no. January, 2015, doi: 10.1109/ICIIECS.2015.7193072.

K. H. Kang, B. K. Lee, Y. H. Lee, and Y. H. Lee, “A heuristic for the vehicle routing problem with due times,” Comput. Ind. Eng., vol. 54, no. 3, pp. 421–431, 2008, doi: 10.1016/j.cie.2007.08.004.

G. Laporte, M. Gendreau, J. Y. Potvin, and F. Semet, “Classical and modern heuristics for the vehicle routing problem,” Int. Trans. Oper. Res., vol. 7, no. 4–5, pp. 285–300, 2000, doi: 10.1111/j.1475-3995.2000.tb00200.x.

Y. Priyandari, “Alogaritma Sequential Insertion untuk Memecahkan Vehicle Routing Problem dengan Multiple Trips, Time Window dan Simultaneous Pickup Delivery,” Performa, vol. 7, no. 1, pp. 88–96, 2008.

A. F. Abdurrahman, A. Y. Ridwan, and B. Santosa, “Penyelesain Vehicle Routing Problem (VRP) dalam Penugasan Kendaraan dan Penentuan Rute untuk Meminimasi Biaya Transportasi pada PT. XYZ dengan Menggunakan Algoritma Genetika,” J. Tek. Ind., vol. 9, no. 1, pp. 16–24, 2019.

A. Poot, G. Kant, and A. P. M. Wagelmans, “A savings based method for real-life vehicle routing problems,” J. Oper. Res. Soc., vol. 53, no. 1, pp. 57–68, 2002, doi: 10.1057/palgrave/jors/2601252.

C. Abadi, S. Susanty, and H. Adianto, “Penentuan Rute Kendaraan Distribusi Produk Roti Menggunakan Metode Nearest Neighbor dan Metode Sequential Insertion,” J. Online Inst. Teknol. Nas. Januari, vol. 01, no. 03, pp. 2338–5081, 2014.

D. B. Paillin and E. Wattimena, “Penerapan algoritma sequential insertion dalam pendistribusian BBM di Kawasan Timur Indonesia (Studi kasus pada PT. Pertamina Upms VIII Terminal Transit Wayame-Ambon),” Arika, vol. 9, no. 1, pp. 53–62, 2015.

A. Arvianto, A. H. Setiawan, and S. Saptadi, “Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal,” J. Tek. Ind., vol. 16, no. 2, pp. 85–96, 2014, doi: 10.9744/jti.16.2.83-94.