返回
A compact optimization model for the tail assignment problem
DOI:10.1016/j.ejor.2017.06.045.png)
摘要
En 中文
This paper investigates a new model for the so-called Tail Assignment Problem, which consists in assigning a well-identified airplane to each flight leg of a given flight schedule, in order to minimize total cost (cost of operating the flights and possible maintenance costs) while complying with a number of operational constraints. The mathematical programming formulation proposed is compact (i.e., involves a number of 0 1 decision variables and constraints polynomial in the problem size parameters) and is shown to be of significantly reduced dimension as compared with previously known compact models. Computational experiments on series of realistic problem instances (obtained by random sampling from real-world data set) are reported. It is shown that with the proposed model, current state-of-the art MIP solvers can efficiently solve to exact optimality large instances representing 30-day flight schedules with typically up to 40 airplanes and 1500 flight legs connecting as many as 21 airports. The model also includes the main existing types of maintenance constraints, and extensive computational experiments are reported on problem instances of size typical of practical applications. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
OR in airlines
Tail assignment
Aircraft routing
Maintenance routing
Integer linear program
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Isolation of rabbit liver branched chain alpha-ketoacid dehydrogenase and regulation by phosphorylation.兔肝支链 α-酮酸脱氢酶的隔离和磷酸化调节。
Effect of the preparation method on the pore size distribution of activated carbon from coconut shell
Carbon
IF0

