.png){kind=icon}
返回
The aircraft rotation problem
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1018945415148.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a set of flights to be flown for a specific aircraft type, with specified maintenance locations, durations, and needed frequency, the aircraft rotation problem is to determine the specific route flown by each aircraft. The objective is to maximize the benefit derived from making specific connections. In this paper, we present a mathematical formulation for the aircraft rotation problem (ARP) and discuss its similarity with the asymmetric traveling salesman problem. We solve the ARP by Lagrangian relaxation and subgradient optimization and present computational results on real data from a major airline.
Keyword:
FLEET ASSIGNMENT PROBLEM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
