| dc.description.abstract | The Split Delivery Vehicle Routing Problem (SDVRP) is a modification of the classical
Vehicle Routing Problem (VRP), which aims to establish optimal routes for a fleet of
vehicles serving customers with multiple delivery splits. A large number of integer linear
programming mathematical models were formulated, and heuristic algorithms were
proposed to tackle the problem. This paper considers a sugar production company that
has a sugar factory in Bien Hoa, Dong Nai, Vietnam. Nowadays, the company relies on
delivery service providers to provide the best service and does not possess a delivery
system. Moreover, the company does not build any effective methods for planning
vehicle routes to deliver products to customers. This paper aims to develop a delivery
system for the company with the optimal routes by applying a mixed integer linear
programming (MILP) split delivery vehicle routing problem (SDVRP) for minimizing
the total distance traveled and solved by CPLEX 20.1.0 software. In addition, the cost
analysis is conducted to evaluate the proposed solution cost in 6 years and compare it to
the company’s current system cost. Besides, the proposed solution is compared to an
existing method in a publication for the same problem to emphasize the advantage of
the proposed solution. The proposed solution’s computational results prove that its cost
is lower after 2 years than the company's current system cost and the proposed solution
is better at solving larger-scale problems than considered publication and acquiring
optimal solutions regarding total distance traveled. | en_US |
