Cecilia Di Chio

Learn More
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces that encourage each particle to fly back both towards the best point sampled by it and towards the swarm's best point, while its momentum tries to keep it moving in its current(More)
Recommended by T. Blackwell Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimisation (PSO) and evolutionary algorithms. This connection enables us to generalise PSO to virtually any solution representation in a natural and straightforward way. The new geometric(More)
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the standard algorithm can make it well suited for the foraging problem. We propose two approaches to model foraging behaviour: the first uses a standard particle swarm algorithm, with(More)
Despite the many features that the behaviour of the standard particle swarm algorithm shares with grouping behaviour in animals (e.g. social attraction and communication between individuals), this biologically inspired technique has been mainly used in classical optimi-sation problems (i.e. finding the optimal value in a fitness landscape). We present here(More)
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continuous and combinatorial spaces. In previous work we have developed the theory behind it. The aim of this paper is to demonstrate the applicability of GPSO in practice. We demonstrate(More)
We extend our previous research on evolving the physical forces which control particle swarms by considering additional ingredients , such as the velocity of the neighbourhood best and time, and different neighbourhood topologies, namely the global and local ones. We test the evolved extended PSOs (XPS) on various classes of benchmark problems. We show that(More)
This paper has been inspired by two quite different works in the field of Particle Swarm theory. Its main aims are to obtain particle swarm equations via genetic programming which perform better than hand-designed ones on the group-foraging problem, and to provide insight into behavioural ecology. With this work, we want to start a new research direction:(More)