An optimisation solution of Capacitated Vehicle Routing Problem (CVRP)

Nowadays, the continuous increase in traffic makes the management of road flows increasingly difficult. Hence, transportation network and delivery problems are becoming a real priority. To solve this complexity of situation we call on Vehicle Routing Problem (VRP). When we have capacity constraints, we talk about Capacitated Vehicle Routing Problem (CVRP) considered as a variant of Vehicle Routing Problem (VRP). Due to the increasing of supply chain complexity, new optimization techniques in additional to new technologies give a great development, and so new Information and Communications Technologies (ICT) are implemented as support to the transportation and logistics management. This paper develops an optimization algorithm to solve CVRP of goods. We give an example of delivery distribution of BIM Stores in El Jadida city in Morocco. The aim is to deliver goods to the different points of Bim stores for a minimum cost while never exceeding the capacity of trucks to optimize the trucks tour. For that, we use an algorithm of operational research using Python language: The Guided Local Search. The results obtained represent the optimal path for delivering goods to different points of BIM stores in El Jadida city.