Show simple item record

dc.contributor.advisorHo, Thi Thu Hoa
dc.contributor.authorPham, Thanh Nhan
dc.date.accessioned2025-02-13T07:37:59Z
dc.date.available2025-02-13T07:37:59Z
dc.date.issued2024
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/6547
dc.description.abstractVehicle 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.en_US
dc.language.isoenen_US
dc.subjectPythonen_US
dc.subjectGenetic Algorithmen_US
dc.subjectVehicle Routing Problemsen_US
dc.subjectMixed Integer Non-Linear Programmingen_US
dc.subjectOptimizationen_US
dc.titleOptimizing Vehicle Routing Problem With Fresh Product: A Case Study Of Saigon.Coop In Ho Chi Minh City Regionen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record