Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows

Edwin Hendrawan; I Gede Agus Widyadana

doi:10.30656/jsmi.v2i1.518

Authors

Edwin Hendrawan Petra Christiant University
I Gede Agus Widyadana Petra Christiant University

DOI:

https://doi.org/10.30656/jsmi.v2i1.518

Keywords:

Evolutionary Algorithm, HFVRP with Time Windows, Rute, Vehicle Routing Problem

Abstract

PT. X is a distributor of spare parts with 128 customers for Surabaya City and Sidoarjo City. Number of delivery vehicles owned by PT. X is 15. Determination of delivery route owned by PT. X is completed manually based on driver experience. This research is to make a model of determining the route with minimum cost by considering the travel time and the capacity of the vehicle. Model formation is accomplished in accordance with the PT X policy that each colleague can only be served by one vehicle and the maximum shipping time of 7 hours. The model formed is Heterogeneous Fleet Vehicle Routing Problem with Time Windows (HFVRPWTW). The settlement method used is Evolutionary Algorithm (EA) by reviewing 3 cases. The number of vehicles decreased by the model isÂ with an average difference of 1.67 vehicles. The shipping cost generated by the model is lower than the company for case 1 of 3,155 IDR and case 2 of 25,005 IDR. This condition indicates the model will use less number of vehicles with low shipping costs and large container utilities in 2 cases.

Downloads

Download data is not yet available.

References

Ç. Koç, T. Bekta?, O. Jabali, and G. Laporte, “A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows,” Comput. Oper. Res., vol. 64, pp. 11–27, 2015.

B. L. Golden, S. Raghavan, and E. A. Wasil, The vehicle routing problem: latest advances and new challenges, vol. 43. Springer Science & Business Media, 2008.

J. Szymon and ?. Dominik, “Solving multi-criteria vehicle routing problem by parallel tabu search on GPU,” Procedia Comput. Sci., vol. 18, pp. 2529–2532, 2013.

J. C. Molina, I. Eguia, J. Racero, and F. Guerrero, “Multi-objective vehicle routing problem with cost and emission functions,” Procedia-Social Behav. Sci., vol. 160, pp. 254–263, 2014.

M. Gendreau, G. Laporte, C. Musaraganyi, and É. D. Taillard, “A tabu search heuristic for the heterogeneous fleet vehicle routing problem,” Comput. Oper. Res., vol. 26, no. 12, pp. 1153–1173, 1999.

É. D. Taillard, “A heuristic column generation method for the heterogeneous fleet VRP,” RAIRO-Operations Res., vol. 33, no. 1, pp. 1–14, 1999.

J.-F. Cordeau and Q. Groupe d’études et de recherche en analyse des décisions (Montréal, The VRP with time windows. Montréal: . Les Cahiers du GERAD, 2000.

N. Balakrishnan, “Simple heuristics for the vehicle routeing problem with soft time windows,” J. Oper. Res. Soc., vol. 44, no. 3, pp. 279–287, 1993.

X. Yao and Y. Liu, “Fast Evolutionary Programming.,” Evol. Program., vol. 3, pp. 451–460, 1996.

P. Larrañaga and J. A. Lozano, Estimation of distribution algorithms: A new tool for evolutionary computation, vol. 2. Springer Science & Business Media, 2001.

R. Dondo and J. Cerdá, “A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows,” Eur. J. Oper. Res., vol. 176, no. 3, pp. 1478–1507, 2007.