An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands
An improved variant of the particle swarm optimization algorithm is presented. A new formulation of the location routing problem with stochastic demands is given. A new neighborhood topology for PSO suitable for combinatorial optimization problems is proposed. The proposed algorithm is tested in the CLRP and in the LRPSDs. Comparisons with other algorithms from the literature are performed.
particle swarm optimization capacitated location routing problem location routing problem with stochastic demands expanding neighborhood topology combinatorial neighborhood topology global and local neighborhood topology