Vehicle Routing Problem Dengan Time Window Untuk Multiple Product Dan Multiple Route Menggunakan Algoritma Sequential Insertion


  • Dita Ayu Pratama Putri



VRP, time window, multiple product, multiple route, sequential insertion


In this article is related to implemented a method in order to solve vehicle routing problem (VRP) for mineral water distribution activity from depot to customers which has particular constraints such as variant of product that has to be load at a vehicle (multiple product), vehicle’s capacity and time window of each customers. One of the company’s vehicle have 64 customers that must be visited in 6 days so there is a few route has been developed (multiple route). The constraint that set up sustained there might be few customers missed to be visited during horizon plan. Sequential Insertion Algorithm which is one of heuristic method for Vehicle Routing Problem with Time Window is choosen to built a vehicle routing solution. The result from this study show that this method in particular conditions and constraints give a better solusion than the company actual routes. Moreover, in this article, the comparasion of distance and completion time between solution route and actual route, and also the saving in cost is also analyzed. The using of Sequential Insertion Algorithm in this article can be used and applied because its perform an optimal result.


Download data is not yet available.


R. Ballou, "Business Logistics Management: Planning, Organizing and Organizing the Supply Chain," ed: Prentice Hall, New Jersey, 1998.

M. Schneider, A. Stenger, and D. Goeke, "The electric vehicle-routing problem with time windows and recharging stations," Transportation Science, vol. 48, pp. 500-520, 2014.

O. Bräysy and M. Gendreau, "Genetic algorithms for the vehicle routing problem with time windows," Arpakannus,(1), pp. 33-38, 2001.

J. R. Montoya-Torres, J. L. Franco, S. N. Isaza, H. F. Jiménez, and N. Herazo-Padilla, "A literature review on the vehicle routing problem with multiple depots," Computers & Industrial Engineering, vol. 79, pp. 115-129, 2015.

K. Govindan, A. Jafarian, R. Khodaverdi, and K. Devika, "Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food," International Journal of Production Economics, vol. 152, pp. 9-28, 2014.

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," Jurnal Teknik Industri, vol. 16, pp. 83-94, 2014.

S. F. Ghannadpour, S. Noori, R. Tavakkoli-Moghaddam, and K. Ghoseiri, "A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application," Applied Soft Computing, vol. 14, pp. 504-527, 2014.

J.-F. Cordeau, Laporte, G., Savelsbergh, M. W. P. & Vigo, D, Handbooks in Operations Research and Management Science. North Holland, Elsevier B.V., 2007.

Y. Qi, Z. Hou, H. Li, J. Huang, and X. Li, "A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows," Computers & Operations Research, vol. 62, pp. 61-77, 2015.


How to Cite

Putri, D. A. P. (2017). Vehicle Routing Problem Dengan Time Window Untuk Multiple Product Dan Multiple Route Menggunakan Algoritma Sequential Insertion. Jurnal Teknik Industri, 17(1), 22-30.