Optimizing Aircraft Arival and Departure Sequencing using Branch and Bound Algorithm (II)

被引:0
|
作者
Al Ali, Ibrahim [1 ]
机构
[1] Univ Politeh Bucharest, Bucharest, Romania
来源
QUALITY-ACCESS TO SUCCESS | 2013年 / 14卷 / 136期
关键词
optimizing; aircraft sequencing problem; mathematical modeling; branch and bound algorithm;
D O I
暂无
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
With the increasing use of the air transportation, the capacity of many major airports is being exceeded at congested periods. This causes delays for incoming or outgoing flights. The topic of the paper is the optimizing aircraft sequencing of both arrival and departure on a single runway using Branch and Bound Algorithm. The article is structured in two parts, the second part containing the implementation of the Branch and Bound Algorithm and conclusions.
引用
收藏
页码:94 / 95
页数:2
相关论文
共 50 条