| dc.description.abstract | This study addresses the Capacitated Vehicle Routing Problem with Time
Windows (CVRPTW) specifically tailored to Biti's Company. The research aims to
optimize the delivery routes of vehicles within capacity constraints and time windows, a
critical concern for Biti's Company logistics. The research methodology involves
employing the Mixed-Integer Linear Programming (MILP) method, utilizing the
CPLEX solver for analysis. The study concludes that the MILP method, when applied to
small datasets, produces favorable results for Biti's Company. The findings have
potential implications for enhancing efficiency in the company's logistics operations.
Future research and practice could explore the scalability of other methods for larger
datasets and their applicability in real-world logistics scenarios. Exploring the
adaptability of the Capacitated Vehicle Routing Problem (CVRP) model to dynamic
conditions, such as traffic congestion or unforeseen delays, holds the potential to enhance
the responsiveness and realism of the routing system employed by Biti's Company,
offering valuable insights for optimizing route planning in similar contexts. | en_US |
