Hybrid Particle Swarm Optimization for Vehicle Routing Problem with Reverse Logistics

The vehicle routing problem (VRP) is a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an hybrid particle swarm optimization (PSO) for VRP with reverse logistics, which possesses a new strategy to represent the solution of the problem, and in the evolution of PSO, SA algorithm is used to optimize the sequence of the customers served by each vehicle. To illustrate the effectiveness and good performance of the proposed algorithm, a number of numerical examples are carried out, and the algorithm is compared with other methods for the same problem.