Show simple item record

dc.contributor.authorKhang, Nguyen Ngoc
dc.date.accessioned2018-02-13T11:28:38Z
dc.date.accessioned2018-05-16T04:09:12Z
dc.date.available2018-02-13T11:28:38Z
dc.date.available2018-05-16T04:09:12Z
dc.date.issued2016
dc.identifier.other022003587
dc.identifier.urihttp://10.8.20.7:8080/xmlui/handle/123456789/2278
dc.description.abstractThe vehicle routing problem is the central core of distribution management. It is one of the most noticeable problem that hundreds of companies and organizations in delivery and collection of goods or people have to face with everyday. Find a method to reduce cost and optimize scheduling can save up many resources for the company, thus the process of research and investigate the vehicle routing problem are crucial and necessary. The objective is to create a meticulous model in order to reduce the cost of transportation and the time factor as much as possible, and on the other hand, keep the services, vehicles and human factor in a continuous flow without any interruption. This thesis serves the purpose of application in Gemadept, a logistics-based company. Keywords: Vehicle routing problem, time window , optimization, NP-Hard, VRPTWen_US
dc.description.sponsorshipDr. Phan Nguyen Ky Phucen_US
dc.language.isoen_USen_US
dc.publisherInternational University - HCMCen_US
dc.subjectVehicle Routing Problemen_US
dc.titleVehicle Routing Problem with the time window: A case study in gemadept logistics companyen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record