The Soft Fixed Route Hybrid Electric Aircraft Charging Problem with Variable Speed
Bibliographic record
Abstract
The shift toward sustainable aviation has accelerated research into hybrid electric aircraft, particularly in the context of regional air mobility. To support this transition, we introduce the Soft Fixed Route Hybrid Electric Aircraft Charging Problem with Variable Speed (S-FRHACP-VS), a novel optimization problem for managing hybrid electric aircraft operations that considers variable speed. The objective is to minimize total costs by determining charging strategies, refueling decisions, hybridization ratios, and speed decisions while adhering to a soft schedule. This paper introduces an iterative variable-based fixation heuristic, named Iterative Two-Stage Mixed-Integer Programming Heuristic (ITS-MIP-H), that alternatively optimizes speed and hybridization ratios while considering the soft schedule constraints, nonlinear charging, and nonlinear energy consumption functions. In addition, a metaheuristic genetic algorithm is proposed as an alternative optimization approach. Experiments on ten realistic flight instances demonstrate that optimizing speed leads to an average cost reduction of 7.64% compared to the best non-speed-optimized model, with reductions of up to 18.64% compared to an all-fuel-based heuristic. Although genetic algorithm provides a viable alternative that performs better than the best non-speed-optimized model, the proposed iterative variable-based fixation heuristic approach consistently outperforms the metaheuristic, achieving the best solutions within seconds. These results provide new insights into the integration of hybrid electric aircraft within transportation networks, contributing to advancements in aircraft routing optimization, energy-efficient operations, and sustainable aviation policy development.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".