Academic Journal
Maximizing the average fuel savings for aircraft fleet under a fixed periodic schedule.
| Τίτλος: | Maximizing the average fuel savings for aircraft fleet under a fixed periodic schedule. |
|---|---|
| Συγγραφείς: | Kats, Vladimir1 (AUTHOR), Levner, Eugene2 (AUTHOR) levner@hit.ac.il |
| Πηγή: | OR Spectrum. Jun2026, Vol. 48 Issue 2, p691-728. 38p. |
| Θεματικοί όροι: | *Mathematical optimization, *Air travel, *Energy consumption, Assignment problems (Programming), Newton-Raphson method |
| Περίληψη: | We consider the problem of assigning a fleet of aircraft of different types to a given periodic flight schedule aiming to maximize fuel economy for a predetermined fleet flight schedule. The challenge is to select the most profitable aircraft type for each flight and then determine the required number of aircraft and the number of deadhead flights to maximize fuel economy. We split this general problem into two successive optimization problems. The first one, the aircraft-type assignment problem, is to select the most profitable aircraft type for each flight; the second one is the aircraft routing problem. One way to solve the first problem, which we adopt in this paper, is to reduce it to a parametric minimum-cost network flow problem. To solve it, we propose a new Newton-type algorithm that finds good solutions for large-scale problems. Another focus of the paper is on efficient solution of the aircraft routing problem for a single aircraft type. The goal is to maximize fuel economy, taking into account both the required number of aircraft and the number of deadhead flights. We transform it into a special fractional assignment problem and solve using a new version of the Newton-type algorithm that is adapted for the aircraft fleet routing problem and runs in O(n4) time, where n is the number of flights. [ABSTRACT FROM AUTHOR] |
| Copyright of OR Spectrum is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
καταχωρήστε σχόλιο πρώτοι!