Application of a Greedy Algorithm to Military Aircraft Fleet Retirements
نویسندگان
چکیده
منابع مشابه
Routing Military Aircraft with a Constrained Shortest-path Algorithm
We formulate and solve aircraft-routing problems that arise when planning missions for military aircraft that are subject to ground-based threats such as surface-to-air missiles. We use a constrained-shortest path (CSP) model that discretizes the relevant airspace into a grid of vertices representing potential waypoints, and connects vertices with directed edges to represent potential flight se...
متن کاملIDS: Improving Aircraft Fleet Maintenance
This paper describes the Integrated Diagnostic System (IDS), an applied AI project concerned with the development of hybrid information systems to diagnose problems and help manage repair processes of commercial aircraft fleets. A study at one major airline indicated that significant benefits could accrue (approximately 2% of overall maintenance budget) through the use of innovative information...
متن کاملA Network Approach to Identifying Military Fleet Replacement Strategies
The Motor Transport Program Office for the U.S. Marine Corps (PM MT) manages the Light Tactical Wheeled Vehicle (TWV) fleet and must make decisions each year about vehicle procurements, overhauls, and retirements. These decisions are based on projected costs to maintain current vehicles, estimates of the remaining useful life of the vehicles, availability of new vehicles and individual vehicle ...
متن کاملAn Adaptive Greedy Algorithm with Application to Sparse Narma Identification
Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper a powerful greedy scheme developed in [1, 2] is converted into an adaptive algorithm which is applied to estimation of nonlinear channels. Performance is assessed via computer ...
متن کاملAdaptive Greedy Algorithm With Application to Nonlinear Communications
Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper a powerful greedy scheme developed in [1], [2], is converted into an adaptive algorithm which is applied to estimation of a class of nonlinear communication systems. Performanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Aerospace Technology and Management
سال: 2017
ISSN: 2175-9146
DOI: 10.5028/jatm.v9i3.818