Vehicle Routing Problem For Reverse Logistics: A Case Study Of Food Bank Vietnam

Abstract

Reverse Logistics has been one of the concerned aspect to study in the supply chain industry. In this study, the problem of finding optimal routes for an organisation to deliver wasted and surplus food from the restaurants back to the farm is adressed. Green Vehicle Routing Problem (G-VRP) which is a modification of the classical Vehicle Routing Problem (VRP),is implemented in this study by using mixed integer linear programming (MILP) and Ant Colony Optimization (ACO) methods. The total cost of the proposed method using Time Value of Money (TVM) is presented to provide a holistic picture in this transportation scenario. The outcomes show how effective the suggested strategy would bring in forming optimal routes lowering transportation costs and offer logisticians and transportation managers useful insights for practical implementations.