Optimasi Jalur Distribusi dengan Metode Vehicle Routing Problem (VRP)

Agung Chandra, Bambang Setiawan


The purpose of the study was to apply the method of Vehicle Routing Problem (VRP) Method to accelerate product distribution and minimize the use of fuel. The method of VRP is one of the solutions to find the shortest route from 57 locations in Jabodetabek (Jakarta, Bogor, Depok, Tangerang, Bekasi), four locations in Bandung, and three locations in Surabaya. The result shows that the most efficient method of VRP is by combining the heuristics and meta-heuristics – simulated annealing methods which reduce the distance about 11.79 % in Jabodetabek, 0 % in Bandung, and 8.98 % in Surabaya.


VRP method; heuristics; metaheuristics

Full Text:



Caplice, C. (2006). Transportation management: Vehicle routing. Cambridge, MA: MIT Center for Transportation and Logistics.

Clarke, G., & Wright, J.W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.

Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). Cambridge, MA: MIT Press.

Dantzig, G.B., Fulkerson, D.R., & Johnson, S.R. (1954). Solution of a large scale traveling salesman problem. Operations Research 2, p.393-410.

Dantzig, G.B., & Ramser, J.H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.

Dasgupta, S., Papadimitriou, C.H. & Vazirani, U.V. (2006). Algorithms. New York: McGraw-Hill Education.

Eglese, R.W. (1990). Simulated annealing: a tool for operational research. European Journal of Operational Research, 46, 271-281.

Jaramillo, J.R. (2010). The green single vehicle routing problem. Myrtle Beach, SC: SE INFORMS Annual Meeting.

Laporte, G. (2006). A short history of the traveling salesman problem. Montreal, Canada: Center for Research on Transportation & GERAD HEC.

Marinakis, Y., & Migdalas, A. (2007). Annotated bibliography in vehicle routing. Operational Research, 7(1), 27-46.

Oliveira, J.F., & Carravilla, M.A. (2009). Heuristics and local search.

Parragh, S.N., Doerner, K.F., & Hard, R.F. (2008a). A survey on pickup and delivery problems. Part I: Transportation between customers and depot. J Betriebswirtschaft, 58, 21-51.

Parragh, S.N., Doerner, K.F., & Hard, R.F. (2008b). A Survey on pickup and delivery problems. Part II: Transportation between customers and depot. J Betriebswirtschaft, 58, 81-117.

Rutenbar, R.A. (1989). Simulated Annealing Algorithms: An Overview. IEEE Circuits and Devices Magazine, 19-26.

Saiyed, A.R. (2012). The traveling salesman problem. Indiana State University.

DOI: http://dx.doi.org/10.25292/j.mtl.v5i2.233


  • There are currently no refbacks.


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

JURNAL MANAJEMEN TRANSPORTASI & LOGISTIK | ISSN : 2442-3149 (Online) | ISSN : 2355-472X (Print)

 Creative Commons Licence
Jurnal Manajemen Transportasi & Logistik is licensed under a  Creative Commons Attribution-NonCommercial 4.0 International License.

View My Stats