Optimizing Agricultural Materials Trucking Under Capacitated And Time Window Vehicle Routing Problem: A Case Of Loc Troi Group

Abstract

The primary subjects covered and explored in this study will be the delivery of agricultural materials by the Loc Troi Group with Vehicle Routing Problem under capacitated and time window constraints. To maximize profits and lower operating expenses, it is vital to optimize costs, transit time, and route planning based on company objectives. A Mix Integer Linear Programming technique is utilized to generate the mathematical model and operate the system for network design in an effort to achieve this goal. Customers' location and demand will first be allocated integer values based on MILP, after which a model will be built with particular constraints (capacity, time window), and ultimately results will be provided by PYTHON. In order to reach a decision, the data will be thoroughly examined in terms of the relative importance of the various elements. The model will be tested with 3 scenarios, the first scenario is to reduce the number of trucks, the second to reduce demand by 10% and finally to reduce demand by 10%. The outcomes demonstrate that the algorithms produce the best outcomes and are appropriate for this situation, lead to the result that original scenario illustrate the best solution for this problem. For improved progress, nevertheless, more research should also be taken into account. And yet, more investigation should also be explored for improved development.