mirror of
https://github.com/Akkudoktor-EOS/EOS.git
synced 2026-10-21 21:31:57 +00:00
feat(genetic): make the fitness cache size configurable (#1376)
The per-run fitness cache of the GENETIC optimizer is unbounded. It grows with individuals x generations (~110k keys at 300 x 400, about 1.1 kB each, 1.6 kB with an EV) and adds 120-170 MB to the peak memory of a run, while only 6-15 % of the lookups hit. On 512 MB boards this is the largest part of the optimizer's memory. Add optimization.genetic.fitness_cache_max_entries: - None (default): unbounded, the previous behaviour. - 0: no cache; every genome is evaluated. - N > 0: at most N keys. The cache is then an OrderedDict and evicts the oldest key first (FIFO, O(1)); LRU would cost bookkeeping on every hit for a cache that rarely hits. A cache hit returns exactly what the deterministic evaluation would return, so the plan for a fixed seed is identical with any setting. Co-authored-by: Christin <christin@BigBrother.bikini.bottom.zone> Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com> Co-authored-by: Andreas <drbacke@gmx.de>
This commit is contained in:
co-authored by
Christin
Claude Opus 5.5
Andreas
parent
ecec39fcd8
commit
14d8587c9c
@@ -175,6 +175,21 @@ The behavior of the genetic algorithm can be customized using the following conf
|
||||
A fixed seed to ensure reproducibility. Runs with the same seed and configuration will
|
||||
produce the same results.
|
||||
|
||||
- **fitness_cache_max_entries** (`int` or `null`, default: `null`):
|
||||
Limits the fitness cache of one optimization run. The cache remembers the fitness of every
|
||||
evaluated plan so that a repeated plan is not simulated again. It is cleared after each run,
|
||||
but during a run it grows with individuals × generations (roughly 100 MB at 300 × 400) while
|
||||
typically only 5–15 % of the evaluations hit it.
|
||||
|
||||
- If `null`, the cache is unbounded (previous behaviour).
|
||||
- If `0`, the cache is disabled; every plan is simulated.
|
||||
- If a positive integer N, the cache holds at most N keys and drops the oldest first. Each
|
||||
evaluated plan takes one or two keys.
|
||||
|
||||
The value never changes the result: with a fixed seed, all settings give the same plan. Small
|
||||
devices (e.g. 512 MB RAM) should use `0` or a few thousand; this costs a few percent of run
|
||||
time.
|
||||
|
||||
- **penalties** (`dict`):
|
||||
Defines how penalties are applied to solutions that violate constraints (e.g., undercharged
|
||||
batteries). Penalty function parameter values influence the fitness score, discouraging
|
||||
|
||||
Reference in New Issue
Block a user