Simulated annealing for vehicle routing problem with time window

Nowadays. Vehicle routing problems (VRP) are an important component of logistics management. and is often used in transportation logistics and distribution within this article, we will look at the vehicle routing problem and present a solution using an integer linear programming model. The objective is to reduce the total load distance of transportation for each customer. For the problem, we considered the number of customers, vehicles, and the transportation distance to determine the best route for the vehicle to take from the warehouse to the customer. from the customer back to the warehouse to avoid unnecessary travel, if a shorter distance can be traveled to deliver goods, The delivery time will also be shorter, which will benefit both the customers and the transport companies. However, the use of integer linear programming is still limited. In order to resolve the issue, we developed a simulated annealing (SA) method to create delivery routes that can satisfy both requests simultaneously while reducing transportation costs and resolving a wider issue.