has parameter global optimization algorithm maximum iterations particle swarm 2019-01-18 http://identifiers.org/biosimulators/copasi http://identifiers.org/doi/10.1109/ICNN.1995.488968 AZ The particle swarm optimization method suggested by Kennedy and Eberhart is inspired by a flock of birds or a school of fish searching for food. Each particle has a position Xi and a velocity Vi in the parameter space. Additionally, it remembers its best achieved objective value O and position Mi. Dependent on its own information and the position of its best neighbor (a random subset of particles of the swarm) a new velocity is calculated. With this information the position is updated.