| dc.description.abstract | In Logistics and Supply Chain Management study the Vehicle Routing Problem is a very important issue. A case study of LOTTE E-commercial which trading product online was to improve the transportation management. The Vehicle Routing Problem in this study is to find to reduce transportation cost and optimize scheduling of vehicles between the time window constraint of customers and depot. Thus, the objectives of this study were to reduce transportation cost and scheduling time response to the demand of customer. Due to the delivery in Ho Chi Minh City, this problem became the vehicle routing problem with time windows constraints (VRPTW). Therefore, the exact algorithms based on the application of Mixed Integer linear programming is proposed in this paper with the purpose of minimizing the total transportation cost. Finally, CPLEX Studio IDE 12.8.0 is applied to solve the problem. At the same time, results are discussed in term of implications for the routing of vehicles at Lotte in terms of the construct validity of time window constraint of customers and warehouse and people can quickly adjust the scheduling result, this gets quite well result in the practical application.
Keywords: Vehicle Routing Problem, VRPTW, Mixed Integer Programming, Branch-and-Cut, Time window. | en_US |
