Aplikasi Algoritma Hybrid dalam Penentuan Rute Pendistribusian Produk (Studi Kasus: PT. Enseval Putera Megatrading)

Eri Wirdianto, Dhina Regenie, Wisnel Wisnel

Abstract

PT. Enseval Putera Megatrading is a company which operates in general business and distribution of pharmacy products, general needs, cosmetics, foods and hospital equipments. In their current practice, routing in products deliveries, which is limited by time windows, has not considered the utilisation of vehicles' maximum loading capacities. Distribution route from hybrid algorithm using heuristic clustering and Mixed-Integer Linear Programming approach can accommodate such problem with time windows and vehicles' capacities utilisation. Based on comparison between company’s current route and the route from hybrid algorithm, it can be seen that the hybrid algorithm is able to decrease total distance and total cost of transportation. This new route concerns on vehicles allocation and time windows limit. This new route can minimize the total cost of transportation that company has to pay.

Keywords: Routing, time windows, heuristic clustering, mixed-integer linear programming, transportation cost


Abstrak

PT. Enseval Putera Megatrading merupakan perusahaan yang bergerak dalam bidang perdagangan umum dan pendistribusian produk farmasi, keperluan umum, kosmetik, makanan, serta peralatan dan perlengkapan rumah sakit. Dilihat dari kondisi saat ini, rute pengiriman produk yang dibatasi oleh adanya time windows belum mempertimbangkan penugasan kendaraan berdasarkan pemanfaatan kapasitas muat maksimum. Rute distribusi yang dihasilkan dengan algoritma hybrid melalui pendekatan heuristic clustering dan metode Mixed-Integer Linear Programming mampu mengakomodir kedua hal tersebut. Berdasarkan perbandingan yang dilakukan terhadap rute distribusi yang digunakan perusahaan saat ini, rute yang dihasilkan dengan algoritma hybrid dapat menghemat jarak tempuh dan total biaya transportasi dengan memperhatikan alokasi kendaraan dan batasan time windows. Dengan demikian, rute yang dihasilkan dapat meminimasi total biaya transportasi yang harus dikeluarkan perusahaan.

Kata kunci: Rute pendistribusian, time windows, heuristic clustering, mixed-integer linear programming, biaya transportasi


Full Text:

PDF

References

Ballou, R.H. (1998). Business Logistic Management: Planning, Organizing, and Controlling The Supply Chain (Ed. 3). New Jersey: Prentice Hall.

Bowersox, D.J., et.al. (2002). Supply Chain Logistics Management. Boston: The McGraw-Hill Companies, Inc.

Mester, D., et.al. (2007). A Multi-parametric Evolution Strategies Algorithm for Vehicle Routing Problems. Expert Systems with Application, 32, pp. 508-717.

Laporte, G. (1992). The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithm, European Journal of Operational Research, 59, pp. 345-358.

Ozaydin, E. (2007) Capacited Vehicle Routing Problem with Time Windows. Molde College, Norway.

Dondo, R. and Cerda, J. (2007). A Cluster-based Optimization Approach for Multi-depot Heterogeneous Fleet Vehicle Routing Problem With Time Window, European Journal of Operational Research, 176, pp. 1478-1507.

Gendreau, M. and Potvin, J.Y. (2005). Metaheuristics in Combinatorial Optimization. Annals of Operations Research, 140, pp. 189-213.

Tjuju, T.D. dan Ahmad, D. (1994). Operations Research: Model-model Pengambilan Keputusan. Bandung: Bandung.

Matz, A., et.al. (1990). Akuntansi Biaya: Perencanaan dan Pengendalian. Jakarta: Erlangga.

Refbacks

  • There are currently no refbacks.