2026-09-19T18:49:12Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/177262022-01-13T07:54:48Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Stephan E. Kolitz.
Koepke, Corbin G. (Corbin Gene), 1977-
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2005-06-02T18:24:34Z
2005-06-02T18:24:34Z
2004
2004
http://hdl.handle.net/1721.1/17726
56472796
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2004.
Includes bibliographical references (p. 143-145).
The United States Air Force's Air Mobility Command is responsible for creating a schedule and executing that schedule for a large-scale air mobility network that encompasses different mission areas. One of the mission areas is channel route. Channel route execution often experiences disruptions that motivate a need for changes in the current channel route schedule. Traditionally, re-planning the channel route schedule has been a manual process that usually stops after the first feasible set of changes is found, due to the challenges of large amounts of data and urgency for a re-plan. Other challenges include subjective trade-offs and a desire for minimal changes to the channel route schedule. We re-plan the channel route schedule using a set of integer programs and heuristics that overcomes these challenges. The integer programs' variables incorporate many of Air Mobility Command's operating constraints, so they do not have to be explicitly included in the formulations. The re-plan uses opportunities in the other mission areas and reroutes channel route aircraft. Finally, our methods can quickly find a solution, allow for "what-if' analysis and interaction with the user, and can be adapted to an evolution in Air Mobility Command's operations while the underlying models remain constant.
by Corbin G. Koepke.
S.M.
146 p.
6381858 bytes
6381671 bytes
application/pdf
application/pdf
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
Operations Research Center.
Multi-mission optimized re-planning in air mobility command's channel route execution
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="07791dcc-e3a9-4c48-879b-d89d6261b4c7">
<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>Multi-mission optimized re-planning in air mobility command's channel route execution</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Koepke, Corbin G. (Corbin Gene), 1977-</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>Operations Research Center.</Keyword>
<Abstract>The United States Air Force's Air Mobility Command is responsible for creating a schedule and executing that schedule for a large-scale air mobility network that encompasses different mission areas. One of the mission areas is channel route. Channel route execution often experiences disruptions that motivate a need for changes in the current channel route schedule. Traditionally, re-planning the channel route schedule has been a manual process that usually stops after the first feasible set of changes is found, due to the challenges of large amounts of data and urgency for a re-plan. Other challenges include subjective trade-offs and a desire for minimal changes to the channel route schedule. We re-plan the channel route schedule using a set of integer programs and heuristics that overcomes these challenges. The integer programs' variables incorporate many of Air Mobility Command's operating constraints, so they do not have to be explicitly included in the formulations. The re-plan uses opportunities in the other mission areas and reroutes channel route aircraft. Finally, our methods can quickly find a solution, allow for "what-if' analysis and interaction with the user, and can be adapted to an evolution in Air Mobility Command's operations while the underlying models remain constant.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>