PSO - Revision history

Vigen at 06:52, 25 March 2026

2026-03-25T06:52:10Z

← Older revision		Revision as of 06:52, 25 March 2026
Line 1:		Line 1:
	In computational science, '''particle swarm optimisation''' is a computational method that optimises a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle’s position and velocity. Each particle’s movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions. [[Category:Abbreviations]]		* In computational science, '''particle swarm optimisation''' is a computational method that optimises a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle’s position and velocity. Each particle’s movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions.
			* Project safety officer

			[[Category:Abbreviations]]
	[[Category:Scientific terms]]		[[Category:Scientific terms]]
	[[Category:FAPlist]]		[[Category:FAPlist]]
			[[Category:Roles and functions]]

Vigen at 20:38, 24 March 2026

2026-03-24T20:38:20Z

← Older revision		Revision as of 20:38, 24 March 2026
Line 1:		Line 1:
	In computational science, '''particle swarm optimisation''' is a computational method that optimises a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle’s position and velocity. Each particle’s movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions. [[Category:Abbreviations]]		In computational science, '''particle swarm optimisation''' is a computational method that optimises a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle’s position and velocity. Each particle’s movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions. [[Category:Abbreviations]]
			[[Category:Scientific terms]]
			[[Category:FAPlist]]

Vigen: Page created automatically by script

2026-02-13T20:15:05Z

Page created automatically by script

New page

In computational science, '''particle swarm optimisation''' is a computational method that optimises a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle’s position and velocity. Each particle’s movement is influenced by its local best known position, but is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions. [[Category:Abbreviations]]