Show simple item record

dc.contributor.authorAnh, Mai Thi Quynh
dc.date.accessioned2015-02-13T05:12:09Z
dc.date.accessioned2018-05-16T04:08:17Z
dc.date.available2015-02-13T05:12:09Z
dc.date.available2018-05-16T04:08:17Z
dc.date.issued2014
dc.identifier.urihttp://10.8.20.7:8080/xmlui/handle/123456789/1286
dc.description.abstractIn the classical definition of Vehicle Routing Problem (VRP), a truck visits only a single customer, if the customer requests the number of products exceeding the capacity of a vehicle shall allow the application classical VRP unreasonable. The Split Delivery Vehicle Routing Problem (SDVRP) is one of the methods are given to solve the problem mentioned above. SDVRP is a method which contrary to what has been assumed by classical VRP: a customer can be served more than one truck if their demands exceed the capacity of the truck. In this thesis, I present a mathematical model and a method to solve the mathematical model on this important problem.en_US
dc.description.sponsorshipM.Eng. Nguyen Hoang Minhen_US
dc.language.isoen_USen_US
dc.publisherInternational University HCMC, Vietnamen_US
dc.relation.ispartofseries;022001876
dc.subjectVehicle - Production managementen_US
dc.titleTabu Search Heuristic for Vehicle Routing problem with split deliveryen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record