dc.contributor.author | Anh, Mai Thi Quynh | |
dc.date.accessioned | 2015-02-13T05:12:09Z | |
dc.date.accessioned | 2018-05-16T04:08:17Z | |
dc.date.available | 2015-02-13T05:12:09Z | |
dc.date.available | 2018-05-16T04:08:17Z | |
dc.date.issued | 2014 | |
dc.identifier.uri | http://10.8.20.7:8080/xmlui/handle/123456789/1286 | |
dc.description.abstract | In 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.sponsorship | M.Eng. Nguyen Hoang Minh | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | International University HCMC, Vietnam | en_US |
dc.relation.ispartofseries | ;022001876 | |
dc.subject | Vehicle - Production management | en_US |
dc.title | Tabu Search Heuristic for Vehicle Routing problem with split delivery | en_US |
dc.type | Thesis | en_US |