Optimizing Vehicle Routing Problem With Fresh Product: A Case Study Of Saigon.Coop In Ho Chi Minh City Region

Abstract

Vehicle Routing Problems is optimization problem that aims to find the most efficient routes for a fleet of vehicles to make deliveries. Vehicle Routing Problems considers factors like distance, traffic patterns, and delivery windows when creating these routes. Once the problem is optimized, companies will receive significant cost savings by minimizing travel distances and fuel consumption. Specifically, in this project, I will optimize the Vehicle Routing Problems of Saigon Coop’s distributing system in Ho Chi Minh city. The goal of this project to find a more optimized transportation cost and more efficient distributing routes for the current system, with the main products are fresh products, which turns the problem of the project into Vehicle Routing Problems with Time Windows. Finally, Python is the foundation that I use throughout the project and the problem of the paper is formulated as Mixed Integer Non- Linear Programming and Genetic Algorithm is used to validate the model to ensure the work is approachable.