The vehicle routing problem for perishable goods: A systematic review

40Citations
Citations of this article
160Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Vehicle Routing Problem (VRP) is the problem for finding optimal routes in the distribution system, and this problem needs attention because it can improve distribution performance. One of the problems in VRP is the Vehicle Routing Problem for Perishable Goods (VRPfPG). This issue addresses VRP for products that are rapidly losing quality and perishable. This paper attempts to review the Vehicle Routing Problem for Perishable Goods (VRPfPG). A systematic review has been carried out on fifty-nine (59) published papers from 2001 to March 2020. The optimization methods in this review were classified into single and multi-objective problems. In addition, the review was also conducted based on the objective function. The results show the metaheuristic algorithm to be a popular optimization method for solving single and multi-objective problems. Further, the results also show that minimizing the total cost distribution to be the objective function that was often used by researchers. Finally, future studies are suggested to explore a more comprehensive investigation in the VRPfPG.

Cite

CITATION STYLE

APA

Utama, D. M., Dewi, S. K., Wahid, A., & Santoso, I. (2020). The vehicle routing problem for perishable goods: A systematic review. Cogent Engineering, 7(1). https://doi.org/10.1080/23311916.2020.1816148

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free