{"id":102,"date":"2023-03-24T15:16:03","date_gmt":"2023-03-24T15:16:03","guid":{"rendered":"https:\/\/do016265.webs.act.reading.ac.uk\/?page_id=102"},"modified":"2023-03-28T10:43:49","modified_gmt":"2023-03-28T10:43:49","slug":"particle-swarm-optimization-pso","status":"publish","type":"page","link":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/particle-swarm-optimization-pso\/","title":{"rendered":"Particle Swarm Optimization (PSO)"},"content":{"rendered":"<h3>What is Particle swarm optimization?<\/h3>\n<p>Particle swarm optimization (PSO), which was first introduced by Kennedy and Eberhart in 1995, is a bio-inspired algorithm that mimics the social behaviour of a flock of birds or a school of fish. It is used to search for an optimal solution from a set of possible soloutions. <\/p>\n<p>This algorithm has been used to solve a wide range of optimization problems in many fields, such as engineering, economics, and machine learning. It is effective in solving problems that are difficult or impossible to solve with simple traditional techniques.<\/p>\n<h3>How Particle Swarm Optimization works?<\/h3>\n<p>In summary, the algorithm operates by creating a swarm of particles, in which each represnt a possible soloution to an optimzation problem <\/p>\n<p>These particles move around a search space, adjusting their position according to their own data (personal best) and the knowlege feeback from neighboring particles.<\/p>\n<p>Every particle would have their own position vector, which determines the current soloution candidate, and velocity vector, that represents the direction and magnitude of the particles movement. <\/p>\n<p>Each particles position and velocity are updated based on its own optimum solution and the best solution of the swarm.<\/p>\n<p>The algorithm starts by initializing a swarm of particles with random positions and velocities in the search space. Then, the particles move in the search space iteratively.<\/p>\n<p> At each iteration, the position and velocity of each particle are updated based on the following equations:<\/p>\n<ul>\n<li>Velocity update: <code>v<sub>i<\/sub>(t+1) = wv<sub>i<\/sub>(t) + c<sub>1<\/sub>r<sub>1<\/sub>(p<sub>i<\/sub> - x<sub>i<\/sub>(t)) + c<sub>2<\/sub>r<sub>2<\/sub>(p<sub>g<\/sub> - x<sub>i<\/sub>(t))<\/code><\/li>\n<li>Position update: <code>x<sub>i<\/sub>(t+1) = x<sub>i<\/sub>(t) + v<sub>i<\/sub>(t+1)<\/code><\/li>\n<\/ul>\n<p>where <code>v<sub>i<\/sub>(t)<\/code> and <code>x<sub>i<\/sub>(t)<\/code> are the velocity and position of particle <code>i<\/code> at iteration <code>t<\/code>, respectively; <code>w<\/code>, <code>c<sub>1<\/sub><\/code>, and <code>c<sub>2<\/sub><\/code> are the inertia weight, cognitive parameter, and social parameter, respectively; <code>r<sub>1<\/sub><\/code> and <code>r<sub>2<\/sub><\/code> are random numbers between 0 and 1; <code>p<sub>i<\/sub><\/code> is the best position of particle <code>i<\/code> so far; and <code>p<sub>g<\/sub><\/code> is the best position of the swarm so far.<\/p>\n<p>(Xu et al.,2016)<\/p>\n<h3>applications of particle swarm optimization<\/h3>\n<p>&#8211; Neural networks: PSO can be used to train neural networks by optimizing the weights and improving their accuracy.<\/p>\n<p>&#8211; Bioinformatics: this algorithim can also optimize the parameters of many bioinformatics algorithms, such as protein folding, DNA sequencing. <\/p>\n<p>Portfolio: They can also be utlized in optimzing the portfolios of assets, and this can reduce risks.<\/p>\n<h6> references<\/h6>\n<p> Xu, X., Rong, H., Trovati, M., Liptrott, M., &#038; Nik, N. (2016). CS-PSO: Chaotic Particle Swarm Optimization Algorithm for Solving Combinatorial Optimization Problems. Journal of Computers, 11(7), 710-722.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>What is Particle swarm optimization? Particle swarm optimization (PSO), which was first introduced by Kennedy and Eberhart in 1995, is a bio-inspired algorithm that mimics the social behaviour of a flock of birds or a school of fish. It is used to search for an optimal solution from a set of possible soloutions. This algorithm [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/pages\/102"}],"collection":[{"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/comments?post=102"}],"version-history":[{"count":7,"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/pages\/102\/revisions"}],"predecessor-version":[{"id":157,"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/pages\/102\/revisions\/157"}],"wp:attachment":[{"href":"https:\/\/do016265.webs.act.reading.ac.uk\/index.php\/wp-json\/wp\/v2\/media?parent=102"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}