| dc.description.abstract | This thesis delves into the realm of logistics optimization by addressing the Vehicle
Routing Problem with Time Windows (VRPTW). The objective is to develop a robust and
efficient model that enhances the delivery systems of businesses operating in dynamic
environments. The research focuses on incorporating various factors into the optimization
model to make it more reflective of real-world scenarios. The goal is to come up with a
routing network for 5 trucks to deliver to 20 customers. Also, this paper calculates the total
cost and distance traveled as well. To overcome existing limitations, this research suggests
considering factors such as traffic conditions and customer service time intervals.
Furthermore, the study advocates exploring diverse scenarios and conducting sensitivity
analyses to evaluate the solution's adaptability and robustness under varying conditions,
including changes in demand patterns, transportation disruptions, and fluctuations in fuel
prices. The findings of this research contribute to the optimization of VRPTW, offering
valuable insights for businesses seeking to enhance the efficiency of their delivery systems
in the face of dynamic and challenging real-world conditions. The mathematical model
uses the MILP method to develop. Then, Visual Code Studio is used to implement a code
to solve the problem with given constraints. The result satisfies the requirements with a
minimized cost and travel distance. | en_US |
