A heuristic development for the load- dependent vehicle routing problem with route time windows

Modern transportation must adapt to the increasingly complicated needs of the local and international transport markets to support economic activity. Today's transportation must be able to combine the transportation process into a continuous transport chain with close ties to logistics activities in order to facilitate the transportation process. It is safer, quicker, more dependable, of higher quality, and requires fewer steps to transport things. The fundamental prerequisite for improving the supply, distribution, and transportation chains is the vehicle routing problem (VRP). To meet the restrictions connected to customers, costs, and vehicles and address the issues of cost, distance, and total load, Vehicle routing problems with time window (VRPTW) is an optimization problem for route management. This study will focus on the main objective is to minimize the total load distance within a certain time.