A New Resolution Strategy for Dynamic Capacitated Vehicle Routing Problem with Time Window

Every company is focused on maximizing profits while ensuring that its supply chain is well managed. In this paper, we propose a resolution strategy using two insertion methods and optimization algorithms to reduce the economic and energy costs associated with transport and distribution, specifically on the dynamic capacitated routing problem with time window (DCVRPTW). This strategy proposes to group customers into sites using the k-means clustering algorithm, optimize routes using Tabu search, and then choose between two methods to insert a dynamic customer into the most suitable site while optimizing new routes. Our approach aims at minimizing fuel costs, penalties, and CO \(_2\) emissions. The results of the different simulations show a reduction in the costs generated at each site. ...