Show simple item record

dc.contributor.advisorHuy, Nguyen Hoang
dc.contributor.authorTrinh, Lam Khanh
dc.date.accessioned2019-11-16T04:07:36Z
dc.date.available2019-11-16T04:07:36Z
dc.date.issued2018
dc.identifier.other022004386
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/3324
dc.description.abstractNowadays, the sustainable and substantial growth in food industry that expanded the distribution of company based on most experience and made it more complicated. Consequently, the delivery takes significant cost and time to transport. This problem has been researching for many years to discover a method that can solve and support to make decision that would minimize the costs along with customers’ requirements. Vehicle Routing Problem with Time Window (VRPTW) applying heuristic search and mathematical model to arrange the desired route to obtain the goal of minimal total cost. By using case study Tho Phat Food, which is big brand of many types of traditional cake, meat bun, especially in Viet Nam, proposes research framework with two methods to archive the solution, the first aim is to find exact solution by mix integer programming, second stage using heuristic searching tool based on Ant colony algorithm by Matlab software programming to apply with larger scale of customer. The results pointed out that the proposed model in this study helps company to improve the process of assigning driver of each type of vehicle with appropriate route. Keywords: VRPTW, Food Industry, Ant Colony Optimization (ACO), Mix Integer Programming (MIP)en_US
dc.language.isoen_USen_US
dc.publisherInternational University - HCMCen_US
dc.subjectMix integer programming; Ant Colony optimizationen_US
dc.titleApply Ant Colony Optimization Algorithm (ACO) For Vehicle Routing Problem With Time Windows In Food Industry: The Case Of Tho Phat fooden_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record