Simultaneous Modelling-to-Generate-Alternatives Procedure Employing the Firefly Algorithm
Bibliographic record
Abstract
“Real-world” decision-making applications generally contain multifaceted performance requirements riddled with incongruent performance specifications. This is because decision making typically involves complex problems that are riddled with incompatible performance objectives and contain competing design requirements which are very difficult—if not impossible—to capture and quantify at the time that the supporting decision models are actually constructed. There are invariably unmodelled elements, not apparent during model construction, which can greatly impact the acceptability of the model's solutions. Consequently, it is preferable to generate several distinct alternatives that provide multiple disparate perspectives to the problem. These alternatives should possess near-optimal objective measures with respect to all known objective(s), but be maximally different from each other in terms of their decision variables. This maximally different solution creation approach is referred to as modelling-to-generate-alternatives (MGA). This chapter provides an efficient optimization algorithm that simultaneously generates multiple, maximally different alternatives by employing the metaheuristic firefly algorithm. The efficacy of this mathematical programming approach is demonstrated on a commonly tested engineering optimization benchmark problem.
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.
How this classification was reachedexpand
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.001 | 0.007 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".