M Persona” Motivation 16sg8 ESD.77 PSO is a zero-order, non-calculus-based method(no gradients are needed) can solve discontinuous mutlimodal, non-convex problems includes some probabilistic features in the motion of particles is a population-based search method, i.e. it moves from a set of points (particles' positions)to another set of points with likely improvement in one iteration(move). is that good or bad ?1 Does it remind you of another heuristic? The Genetic Algorithm(GA) The ga is inherently discrete(in terms of handling design variables PSo is inherently continuous(in terms of handling design variables Some researchers report that Pso requires less function evaluations than the ga (most problems studied are continuous) In Compindex: there are 18150 hits for the Ga from 1990 to 2004, whereas there are only 105 hits for PSo-many version of PSo are likely to appear ⊙ Rania hassan3/2004 Engineering Systems Division -Massachusetts Institute of Technology9 © Rania Hassan 3/2004 Engineering Systems Division - Massachusetts Institute of Technology “Personal” Motivation Personal” Motivation PSO – is a zero-order, non-calculus-based method (no gradients are needed). – can solve discontinuous, mutlimodal, non-convex problems. – includes some probabilistic features in the motion of particles. – is a population-based search method, i.e. it moves from a set of points (particles’ positions) to another set of points with likely improvement in one iteration (move). [is that good or bad ??] Does it remind you of another heuristic? The Genetic Algorithm (GA) – The GA is inherently discrete (in terms of handling design variables) – PSO is inherently continuous (in terms of handling design variables) – Some researchers report that PSO requires less function evaluations than the GA (most problems studied are continuous). – In Compindex: there are 18150 hits for the GA from 1990 to 2004, whereas there are only 105 hits for PSO - many version of PSO are likely to appear