A Hybrid Evolutionary Approach for Combinatorial Problems in Dynamic Environments
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
There is a growing interest in the use of evolutionary algorithms in time-varying environments where the information is revealed progressively with time to the decision maker. However, most existing research basically targets continuous optimization, while little work is directed to discrete optimization even though many real-world problems are both discrete and time-varying. This paper seeks to enhance the ability of genetic algorithms to track the optima shifting due to environmental changes: first, parameters of the genetic operators react to changes in the environment and to changes in the population diversity in order to persevere after obsolete convergence and overcome premature convergence. Second, multi-populations are introduced to cooperatively maintain the search diversity. Third, the algorithm is hybridized with local search heuristics for better tuning. The final algorithm is tested on dynamic combinatorial benchmark problems from the literature. Collectively, results from the conducted experiments favor the strategies proposed in this paper
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it