An Interval Integrated Optimization to Air‐Cargo Hub Network Design and Airline Fleet Planning
Bibliographic record
Abstract
The objective of this study is to minimize the overall transportation cost through the joint decision‐making for air‐cargo hub network design and fleet planning under the uncertain environment. This joint decision‐making considers various factors, including hub location, node connectivity, fleet size, and flight frequency. It takes into account several uncertain parameters such as air‐cargo demand and transportation cost in a realistic setting. We propose a mixed‐integer programming model tailored to the characteristics of such problem, which utilizes interval numbers to address these challenges. This model aims to provide a robust scheme for the joint hub network design and the fleet planning in the uncertain environment. An improved probability‐based interval ranking method is proposed to solve the model. This transformation converts the proposed model into an equivalent real‐number one, simplifying the solving process. Then a hybrid heuristic algorithm, combining the advantages of Memory‐Based Genetic Algorithm (MBGA) and Greedy Heuristic Procedure (GHP), is introduced to enhance the solving speed. Finally, the performance of our proposed model and algorithm is verified using real‐world data from the Australian postal dataset. The results show that the proposed model reduces hub construction costs by 1.37% and fleet operational costs by 7.60%, respectively, as opposed to the use of traditional approaches. The computational time of the proposed algorithm is reduced by 28.4% and 36.5%, respectively, when compared to the use of Genetic Algorithm (GA) and Variable Neighborhood Search (VNS) algorithm.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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".