The problem of determining vehicle routes in logistics has a role Which on pIt isnting bagi company to reduce transportation costs and late fees. Time window constraints are very common in current distribution processes. This research focuses on optimizing fuel costs and penalties. In this study the authors used the Vehicle Routing Problem with Time Windows (VRPTW). VRPTW is one of the most tackled transportation problems in real world situations. Artificial Bee Colony Algorithm (ABC) and Camel Algorithm (CA) will be used in the research. Study This is Focused on optimizing fuel costs and penalties. Furthermore, the two algorithms will be compared which of the two algorithms is the most optimal for solving the route determination problem in VRPTW. Numerical testing will be carried out for the proposed algorithm, as well as conducting experiments on several parameters to determine the effect of parameters for fuel costs and penalties.