Talk:Particle swarm optimization: Difference between revisions

m
no edit summary
No edit summary
mNo edit summary
Line 15:
: So... ok, maybe any function from wikipedia's [[wp:Test_functions_for_optimization|Test functions for optimization]] should be considered valid, here. But how do we then judge an implementation for correctness?
 
: Judging a particle swarm implementation for correctness seems like a serious problem. Basically you start with a set of random numbers and then have them perform a not-quite-random walk within the space defined by some arbitrary function. And, on top of that, "particalparticle swarm optimization" itself is not a single algoritm but a bunch of related algorithms (for example, depending on how the concept of "best known position" is implemented - what's the scope of "best known" for example).
 
: In other words, currently the task suggests that each implementation should be different. And, since we're working with random numbers, we should expect different results from two runs of the same program. But that won't give us comparable implementations.
6,951

edits