Show simple item record

dc.contributor.advisorNguyen Hoang, Huy
dc.contributor.authorDiep Tu, Khoi
dc.date.accessioned2020-10-19T02:20:56Z
dc.date.available2020-10-19T02:20:56Z
dc.date.issued2019
dc.identifier.other022005199
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/3630
dc.description.abstractHighlands Coffee is the biggest coffee chain in Vietnam with more than 233 stores as of the end 2018. As the company’s growth reach an unprecedented level for a Vietnamese F&B chain, the brand must maintain the efficiency of their supply chain in order to meet its expanding business model: to reach the majority of consumers by delivering high-quality beverages at affordable price. However, Highlands Coffee is facing a challenge in weekly fulfillment process of coffee ingredients to their extensive number coffee shops, especially in Ho Chi Minh City where the brand has the most shops with 92 locations, due to the lack of proper vehicle routing. The purpose of this project is to find a routing plan with minimized total traveling distance and number of trucks for delivering coffee ingredients weekly to all Highlands Coffee's stores in Ho Chi Minh City. Keywords: vehicle routing problem (VRP); time window delivery; split load delivery; tabu search heuristics; coffee ingredients.en_US
dc.language.isoen_USen_US
dc.publisherInternational University - HCMCen_US
dc.subjectVehicle routing problemen_US
dc.titleVehicle routing problem with time windows and spilit delivery through taba search heuristic: A case study of Highlands coffeeen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record