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

Eri Wirdianto    (Fakultas Teknik UNAND - Indonesia)
Dhina Regenie (Jurusan Teknik Industri, Fakultas Teknik, Universitas Andalas, Padang - Indonesia)
Wisnel Wisnel (Jurusan Teknik Industri, Fakultas Teknik, Universitas Andalas, Padang - Indonesia)

 ) Corresponding Author
Copyright (c) 2017 Eri Wirdianto, Dhina Regenie, Wisnel Wisnel

PT. Enseval Putera Megatrading is a company which operates in general business and distribution of pharmacy products, general needs, cosmetics, foods and hospital equipment. In their current practice, routing in products deliveries, which is limited by time windows, has not considered the utilization of vehicles' maximum loading capacities. Distribution route from a hybrid algorithm using heuristic clustering and Mixed-Integer Linear Programming approach can accommodate such problem with time windows and vehicles' capacities utilization. Based on the comparison between company’s current route and the route from the 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.

Rute pendistribusian; time windows; heuristic clustering; mixed-integer linear programming; biaya transportasi
  Click to Read the Full Text

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

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

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

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

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

[6] 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.

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

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

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

StatisticsArticle Metrics

This article has been read : 598 times
PDF file viewed/downloaded : 502 times

This article can be traced from

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.