Cover Image

A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem

Annisa Kesy Garside, Nabila Rohmatul Laili


This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verifies that the total journey time to visit the trips does not exceed the working hours of the vehicle. The implementation of the heuristic CFRS to solve the real problem faced by the LPG distributor shows that the procedure could provide a better routing solution.


vehicle routing; cluster first route second; multi trip; tabu search; periodic

Full Text:



[1] G. B. Dantzig and J. H. Ramser, "The truck dispatching problem," Management science, vol. 6, pp. 80-91, 1959.

[2] B. Eksioglu, A. V. Vural, and A. Reisman, "The vehicle routing problem: A taxonomic review," Computers & Industrial Engineering, vol. 57, pp. 1472-1483, 2009.

[3] C. Lin, K. L. Choy, G. T. Ho, S. H. Chung, and H. Lam, "Survey of green vehicle routing problem: past and future trends," Expert systems with applications, vol. 41, pp. 1118-1138, 2014.

[4] S. Srivatsa Srinivas and M. Gajanand, "Vehicle routing problem and driver behaviour: a review and framework for analysis," Transport reviews, vol. 37, pp. 590-611, 2017.

[5] A. Imran and L. Okdinawati, "Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem," Jurnal Teknik Industri, vol. 12, pp. 10-15, 2012.

[6] B. E. Gillett and L. R. Miller, "A heuristic algorithm for the vehicle-dispatch problem," Operations research, vol. 22, pp. 340-349, 1974.

[7] M. L. Fisher and R. Jaikumar, "A generalized assignment heuristic for vehicle routing," Networks, vol. 11, pp. 109-124, 1981.

[8] R. Dondo and J. Cerdá, "A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows," European Journal of Operational Research, vol. 176, pp. 1478-1507, 2007.

[9] K. Shin and S. Han, "A centroid-based heuristic algorithm for the capacitated vehicle routing problem," Computing and Informatics, vol. 30, pp. 721-732, 2012.

[10] F. Cakir, W. N. Street, and B. W. Thomas, "Revisiting Cluster First, Route Second for the Vehicle Routing Problem," no. August, 2015.

[11] S. E. CÖMERT, H. R. YAZGAN, I. Sertvuran, and H. ŞENGÜL, "A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain," Sādhanā, vol. 42, pp. 2067-2080, 2017.

[12] D. Hiquebran, A. Alfa, J. Shapiro, and D. Gittoes, "A revised simulated annealing and cluster-first route-second algorithm applied to the vehicle routing problem," Engineering Optimization, vol. 22, pp. 77-107, 1993.

[13] D. A. P. Putri, "Vehicle Routing Problem Dengan Time Window Untuk Multiple Product Dan Multiple Route Menggunakan Algoritma Sequential Insertion," Jurnal Teknik Industri, vol. 17, pp. 22-30, 2016.

[14] A. Mingozzi, R. Roberti, and P. Toth, "An exact algorithm for the multitrip vehicle routing problem," INFORMS Journal on Computing, vol. 25, pp. 193-207, 2013.

[15] B. Fleischmann, "The vehicle routing problem with multiple use of vehicles," Fachbereich Wirtschaftswissenschaften, Universität Hamburg, 1990.

[16] É. D. Taillard, G. Laporte, and M. Gendreau, "Vehicle routeing with multiple use of vehicles," Journal of the Operational research society, vol. 47, pp. 1065-1070, 1996.

[17] R. J. Petch and S. Salhi, "A multi-phase constructive heuristic for the vehicle routing problem with multiple trips," Discrete Applied Mathematics, vol. 133, pp. 69-92, 2003.

[18] D. Cattaruzza, N. Absi, and D. Feillet, "Vehicle routing problems with multiple trips," 4OR, vol. 14, pp. 223-259, 2016.

[19] A. M. Campbell and J. H. Wilson, "Forty years of periodic vehicle routing," Networks, vol. 63, pp. 2-15, 2014.

[20] E. J. Beltrami and L. D. Bodin, "Networks and vehicle routing for municipal waste collection," Networks, vol. 4, pp. 65-94, 1974.

[21] R. Russell and W. Igo, "An assignment routing problem," Networks, vol. 9, pp. 1-17, 1979.

[22] G. Clarke and J. W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Operations research, vol. 12, pp. 568-581, 1964.

[23] N. Christofides and J. E. Beasley, "The period routing problem," Networks, vol. 14, pp. 237-256, 1984.

[24] J.-F. Cordeau, G. Laporte, and A. Mercier, "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational research society, vol. 52, pp. 928-936, 2001.

[25] J. F. Cordeau, M. Gendreau, and G. Laporte, "A tabu search heuristic for periodic and multi‐depot vehicle routing problems," Networks: An International Journal, vol. 30, pp. 105-119, 1997.<105::AID-NET5>3.0.CO;2-G.

[26] P. Parthanadee and R. Logendran, "Periodic product distribution from multi-depots under limited supplies," Iie Transactions, vol. 38, pp. 1009-1026, 2006.

[27] E. Angelelli and M. G. Speranza, "The periodic vehicle routing problem with intermediate facilities," European journal of Operational research, vol. 137, pp. 233-247, 2002.

[28] F. Alonso, M. J. Alvarez, and J. E. Beasley, "A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions," Journal of the Operational Research Society, vol. 59, pp. 963-976, 2008.

[29] A. Rusdiansyah and D.-b. Tsao, "An integrated model of the periodic delivery problems for vending-machine supply chains," Journal of Food Engineering, vol. 70, pp. 421-434, 2005.

[30] T. E. Saputro and A. Prihatina, "Perencanaan Jadwal dan Rute Distribusi Rokok untuk Menekan Total Biaya Transportasi," Jurnal Teknik Industri, vol. 13, pp. 151-157, 2012.

DOI: | Abstract views : 435 | PDF views : 435 |

Copyright (c) 2019 Jurnal Teknik Industri

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

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