A New Look at the Swing Contract: From Linear Programming to Particle Swarm Optimization
Bibliographic record
Abstract
As the energy market has grown in importance in recent decades, researchers have paid increasing attention to swing option contracts. Early studies evaluated the swing contract as if it were a financial derivative contract, by ignoring its storage constraints. Aided by recent advances in artificial intelligence (AI) and machine learning (ML) technologies, recent studies were able to incorporate storage limitations. We make two discoveries in this paper. First, we contribute to the literature by proposing an AI methodology—particle swarm optimization (PSO)—for the evaluation of the swing contract. Compared to the other ML methodologies in the literature, PSO has an advantage by expanding to include more features. Secondly, we study the relative impact of the price process (exogenously given) that underlies the swing contract and the storage constraints that affect a quantity decision process (endogenously decided), and discover that the latter has a much greater impact than the former, indicating the limitation of the earlier literature that focused only on price dynamics.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.006 |
| Insufficient payload (model declined to judge) | 0.004 | 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; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".