Show simple item record

dc.contributor.advisorPham, Huynh Tram
dc.contributor.authorDinh, Ho Nhat
dc.date.accessioned2024-03-22T07:32:30Z
dc.date.available2024-03-22T07:32:30Z
dc.date.issued2023-01
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/5233
dc.description.abstractLogistics is recognized as a one-sector development industry in Vietnam, and it contributes considerably to the country's economy. Transport is a crucial component of logistics. As a result, the Vehicle Routing Problem Is a mathematical problem that deals with the routing route for the vehicle fleet while also decreasing pollution. It is also a key worry of growing distribution organizations because of the high cost and harmful environmental impact of fuel emissions. Traffic bottlenecks at peak hours in Vietnam, notably in Ho Chi Minh City, are the primary cause of growing travel expenses and respiratory ailments. The purpose of this research is to create a model that can answer the objective of the Vehicle Routing Problem to minimize total driving distance using data from gas stations in Ho Chi Minh City. This study employed "CPLEX" to address the problem based on the destination and truck capacity.en_US
dc.language.isoenen_US
dc.subjectVehicle Routing Problemen_US
dc.subjecttank trucken_US
dc.subjectgasolineen_US
dc.subjectpetrolimexen_US
dc.subjectland-transportationen_US
dc.titleVehicle Routing Problem: A Case Study Of Petrolimex Companyen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record