Open artur-deluca opened 5 years ago
Kennedy and Eberhardt discrete version of PSO is different from the one implement today. There they suggested a mechanism that allowed the optimization of an unspecified selection size. Maybe this can come as handy for someone
One cool example for this would be to solve an SAT or (3-SAT) problem
Kennedy and Eberhardt discrete version of PSO is different from the one implement today. There they suggested a mechanism that allowed the optimization of an unspecified selection size. Maybe this can come as handy for someone