Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal

Authors

  • Ary Arvianto Fakultas Teknik, Program Studi Teknik Industri, Universitas Diponegoro, Jl. Prof. Sudharto, Tembalang, Semarang 50239
  • Aditya Hendra Setiawan Fakultas Teknik, Program Studi Teknik Industri, Universitas Diponegoro, Jl. Prof. Sudharto, Tembalang, Semarang 50239
  • Singgih Saptadi Fakultas Teknik, Program Studi Teknik Industri, Universitas Diponegoro, Jl. Prof. Sudharto, Tembalang, Semarang 50239

DOI:

https://doi.org/10.9744/jti.16.2.83-94

Keywords:

VRP, route selection, heterogeneous fleet, multiple time windows, Sequential Insertion

Abstract

In this paper we developed a VRP model for multiple routes, multiple time windows for multiple products and heterogeneous vehicles. The solution were constructed using a heuristic approach, i.e, a sequential insertion algorithm. Additionally, this model is applied to solve fuel distributions for eight customers in East Nusa Tenggara. It needs two tankers with capacity of 4700 kilo liters, so that those distributions can be accomplished with a minimum number of vehicles, total completion time, and range of completion time. The result of this study shows that for a heterogeneous vehicles problem, a vehicle with the largest capacity may not necessarily be the vehicle that provides an optimal solution. Moreover, advance trials should be conducted by providing a limited number of tankers for each tanker capacity, so the description of heterogeneous vehicles becomes more visible. In the future research, the solution will be improved by utilizing relocation techniques.

References

Bodin, L., Golden, B., Assad, A., and Ball, M., Routing and Scheduling of Vehicles and Crews. The State of the Art, Computer and Operations Research, 10, 1983, pp. 63-211.[CrossRef]

Gendreau, M., Taillard, E.D., and Laporte, G., Vehicle Routing Problem with Multiple Use of Vehicles, Journal of the Operation Research Society, 36(3), 1997, pp. 919–935.

Braysy, O., and Gendreau, M., Genetic Algorithms for the Vehicle Routing Problem with Time Windows, Arpakannus, 1, 2001, pp.33-38.

Belmecheri, F., Prins, C., and Yalaoui, F., Particle Swarm Optimization Algorithm for a Vehicle Routing Problem with Heterogeneous Fleet, mixed Backhauls, and Time Windows. 24th IEEE International Parallel and Distributed Processing Symposium, Atlanta, GA, USA, 6 Pages, 2010.

Belfiore, P., and Yoshizaki, Scatter Search for a Real-Life Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Split Deliveries in Brazil, European Journal of Operational Research,199(3), 2009, pp. 750–758.[CrossRef]

Subramanian, A., and Huachi P., A Hybrid Algorithm for the Heterogeneous Fleet Vehicle Routing Problem, European Journal of Operational Research, 221(2), 2012, pp. 285-295.

Suprayogi, Algoritma Sequential Insertion untuk Memecahkan Vehicle Routing Problem with Multiple Trips and Time Windows, Jurnal Teknik dan Manajemen Industri, ITB, 23(3), 2003, pp. 30–46.

Imawati, D., Pemecahan Vehicle Routing Problem with Multiple Trips and Time Windows dengan Menggunakan Algoritma Local Search dan Simulated Annealing, Tugas Sarjana Teknik Industri ITB, 2004.

Arvianto, A., Teknik Local Search untuk Pemecahan Masalah Rute dan Jadwal Kendaraan dengan Karakteristik Multiple Time Windows, Tesis Magister Teknik Indutri ITB, 2009.

Yudistira. T., Suprayogi, dan Halim, A.H., Algoritma Heuristik Penjadwalan Alat Angkut untuk Pendistribusian Produk Majemuk dengan Sumber Tunggal dan Destinasi Majemuk, Prosiding Seminar Sistem Produksi VI, 2003, pp. 573-586.

Downloads

Published

2014-12-31