Optimisation of the multi-depots pick-up and delivery problems with time windows and multi-vehicles using PSO algorithm

Abstract

Many sectors in the transport industry are concerned about the vehicle routing problem (VRP), hence the growing interest of researchers for this type of problem and its variants. This is due essentially to its many real applications in logistics for the transport of goods. The originality and contribution of our work is that we have dealt a problem that combines several variants: multiple vehicles (m), multiple depots (MD), pickup and delivery problem (PDP) with time windows (TW). Hence the notation of our problem: m-MDPDPTW. In this paper, we present the m-MDPDPTW, which is an optimisation problem belonging to the category of NP Hard problems. This problem must meet requests for transport between customers and suppliers satisfying precedence, capacity and time constraints. The goal is to find the best solution, which is the best route minimising the total travelled distance. To solve and optimise our m-MDPDPTW, we have developed a new algorithm based on the particle swarm optimisation (PSO) method. The performance of this new approach is tested on data set instances of Li and Lim's benchmark problems in which we have added multiple depot locations. Comparing with prior works, our proposed approach gave better results by decreasing the distance for several studied instances.