Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Swarm intelligence
Population structure and particle swarm performance
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Population structure and particle swarm performance
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Don't push me! Collision-avoiding swarms
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Dissipative particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Particle swarm optimisation with spatial particle extension
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Extending particle swarm optimisers with self-organized criticality
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Automatic generation of optimised working time models in personnel planning
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Particle swarm optimization and an agent-based algorithm for a problem of staff scheduling
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
| Hi-index | 0.00 |
The current paper uses a real-life scenario from logistics to compare various forms of neighbourhood topologies within particle swarm optimization (PSO). Overall, gbest (all particles are connected with each other and change information) outperforms other well-known topologies, which is in contrast to some other results in the literature that associate gbest with premature convergence. However, the advantage of gbest is less pronounced on simpler versions of the application. This suggests a relationship between the complexity of instances from an identical class of problems and the effectiveness of PSO neighbourhood topologies.