Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem

Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem

Blog Article

The classical capacitated vehicle routing problem (CVRP) is a very popular combinatorial optimization problem in the field of logistics and supply chain management.Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets.We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO) along with a novel decoding method to solve CVRP.Decoding method chewmax pet products chicken feet natural chew dog treats is important to relate the encoded particle position to a feasible CVRP solution.

In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations.Such searching strategies help the BLS-PSO to perform better than the existing proposals by shohoof obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time.Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches.