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