Anonymous user
Particle swarm optimization: Difference between revisions
no edit summary
(→{{header|J}}: simplify defn of michalewicz) |
No edit summary |
||
Line 4:
</p>
<p>
The goal of parameter selection is to ensure that the global minimum is discriminated from any local minima, and that the minimum is accurately determined, and that convergence is achieved with acceptible resource usage. To provide a common basis for comparing implementations, the following test cases
<ul>
<li> McCormick function - bowl-shaped, with a single minimum
<ul> function parameters and bounds (recommended):
<li> -1.5 < x1 < 4 </li>
<li> -3 < x2 < 4 </li>
</ul>
<ul> search parameters (suggested):
<li> omega = 0 </li>
<li> phi p = 0.6 </li>
<li> phi g = 0.3 </li>
<li> number of particles = 100 </li>
<li> number of iterations = 40 </li>
</ul>
<li> Michalewicz function - steep ridges and valleys, with multiple minima
<ul> function parameters and bounds (recommended):
<li> 0 < x1 < pi </li>
<li> 0 < x2 < pi </li>
</ul>
<ul> search parameters (suggested):
<li> omega = 0.3 </li>
<li> phi p = 0.3 </li>
<li> phi g = 0.3 </li>
<li> number of particles = 1000 </li>
<li> number of iterations = 30 </li>
</ul>
</ul>
</p>
| |||