A Particle Swarm Optimization for the Dynamic Vehicle Routing Problem

Abstract

Various versions of the Vehicle Routing Problem (VRP) have been studied for many years. VRP is a static problem, while in the real world, many problems have dynamic nature. In the Dynamic VRP (DVRP), not all information about the problem is known at the beginning of the planning horizon, and, in most cases the information can change after the solution process begins. This two characteristics make the DVRP harder than static VRP. In this study the DVRP is examined and a Particle Swarm Optimization algorithm is proposed. The most known benchmarks are solved with the proposed algorithm and the results are compared with the previous employed methods in the literature.