NiaOrg /
NiaPy
| @@ 69-79 (lines=11) @@ | ||
| 66 | self.evaluations = 0 # evaluations counter |
|
| 67 | self.Fun = Utility.itialize_benchmark(function) |
|
| 68 | ||
| 69 | def best_bat(self): |
|
| 70 | """Find best bat.""" |
|
| 71 | ||
| 72 | i = 0 |
|
| 73 | j = 0 |
|
| 74 | for i in range(self.NP): |
|
| 75 | if self.Fitness[i] < self.Fitness[j]: |
|
| 76 | j = i |
|
| 77 | for i in range(self.D): |
|
| 78 | self.best[i] = self.Sol[j][i] |
|
| 79 | self.f_min = self.Fitness[j] |
|
| 80 | ||
| 81 | def init_bat(self): |
|
| 82 | """Initialize bat.""" |
|
| @@ 51-59 (lines=9) @@ | ||
| 48 | self.F = 0.5 |
|
| 49 | self.CR = 0.9 |
|
| 50 | ||
| 51 | def best_bat(self): |
|
| 52 | i = 0 |
|
| 53 | j = 0 |
|
| 54 | for i in range(self.NP): |
|
| 55 | if self.Fitness[i] < self.Fitness[j]: |
|
| 56 | j = i |
|
| 57 | for i in range(self.D): |
|
| 58 | self.best[i] = self.Sol[j][i] |
|
| 59 | self.f_min = self.Fitness[j] |
|
| 60 | ||
| 61 | def init_bat(self): |
|
| 62 | for i in range(self.D): |
|
| @@ 49-57 (lines=9) @@ | ||
| 46 | self.best = [0] * self.D # best solution |
|
| 47 | self.evaluations = 0 # evaluations counter |
|
| 48 | ||
| 49 | def best_flower(self): |
|
| 50 | i = 0 |
|
| 51 | j = 0 |
|
| 52 | for i in range(self.NP): |
|
| 53 | if self.Fitness[i] < self.Fitness[j]: |
|
| 54 | j = i |
|
| 55 | for i in range(self.D): |
|
| 56 | self.best[i] = self.Sol[j][i] |
|
| 57 | self.f_min = self.Fitness[j] |
|
| 58 | ||
| 59 | @classmethod |
|
| 60 | def simplebounds(cls, val, lower, upper): |
|
