2026-09-19T18:28:28Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/506292022-01-13T07:54:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
James K. Kuchar.
Le Sellier, Francois, 1974-
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
2010-01-07T21:03:28Z
2010-01-07T21:03:28Z
1999
1999
http://hdl.handle.net/1721.1/50629
48193504
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1999.
Includes bibliographical references (leaves 117-118).
Worldwide, the continuously growing air traffic induces a need for new ATM concepts to be defined. One possibility is using a more decentralized system predicated mainly around free routings (Free Flight), for a more flexible management of airspace. The present study first highlights the discrepancies and inefficiencies of the current best flightplan optimizing software that use the Cost Index concept before departure. It then investigates techniques to perform enhanced flight-plan optimizations en-route, with algorithms that are less complex than using the Cost Index. The long-haul flight leg that is considered through the simulations is London (UK) - Boston (MA, USA), flown on a constant flight level. This study shows that running another optimization at the Top of Climb point reduces the average delay at destination from 6.9 minutes to 5.0 minutes. Then, the more futuristic method of considering discrete flight-plan optimizations, while en-route using updated weather forecasts, provides results that are more interesting. If the weather forecasts and the optimizations are done simultaneously every 3-hour or 1.5-hour, the average delay respectively becomes 2.6 minutes or 2.0 minutes. The second part of this work investigates ways of performing a Linear Program to fly a route close to a 4D-trajectory. This study provides ways of determining the exact weight values for the different state variables used in the cost function to minimize.
by Francois Le Sellier.
S.M.
118 leaves
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Aeronautics and Astronautics.
Discrete real-time flight plan optimization
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1c83925b-e79b-47d7-b33b-cdba88163b2c">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Discrete real-time flight plan optimization</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1999</PublicationDate>
<Authors>
<Author>
<DisplayName>Le Sellier, Francois, 1974-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Aeronautics and Astronautics.</Keyword>
<Abstract>Worldwide, the continuously growing air traffic induces a need for new ATM concepts to be defined. One possibility is using a more decentralized system predicated mainly around free routings (Free Flight), for a more flexible management of airspace. The present study first highlights the discrepancies and inefficiencies of the current best flightplan optimizing software that use the Cost Index concept before departure. It then investigates techniques to perform enhanced flight-plan optimizations en-route, with algorithms that are less complex than using the Cost Index. The long-haul flight leg that is considered through the simulations is London (UK) - Boston (MA, USA), flown on a constant flight level. This study shows that running another optimization at the Top of Climb point reduces the average delay at destination from 6.9 minutes to 5.0 minutes. Then, the more futuristic method of considering discrete flight-plan optimizations, while en-route using updated weather forecasts, provides results that are more interesting. If the weather forecasts and the optimizations are done simultaneously every 3-hour or 1.5-hour, the average delay respectively becomes 2.6 minutes or 2.0 minutes. The second part of this work investigates ways of performing a Linear Program to fly a route close to a 4D-trajectory. This study provides ways of determining the exact weight values for the different state variables used in the cost function to minimize.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>