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 条
  • [31] Global Optimization of Optimal Power Flow Using a Branch & Bound Algorithm
    Gopalakrishnan, Ajit
    Raghunathan, Arvind U.
    Nikovski, Daniel
    Biegler, Lorenz T.
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 609 - 616
  • [32] A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming
    Ramakrishnan, KG
    Resende, MGC
    Pardalos, PM
    STATE OF THE ART IN GLOBAL OPTIMIZATION: COMPUTATIONAL METHODS AND APPLICATIONS, 1996, 7 : 57 - 73
  • [33] Rule and branch-and-bound algorithm based sequencing of machining features for process planning of complex parts
    Wang, Wei
    Li, Yingguang
    Huang, Lingling
    JOURNAL OF INTELLIGENT MANUFACTURING, 2018, 29 (06) : 1329 - 1336
  • [34] Rule and branch-and-bound algorithm based sequencing of machining features for process planning of complex parts
    Wei Wang
    Yingguang Li
    Lingling Huang
    Journal of Intelligent Manufacturing, 2018, 29 : 1329 - 1336
  • [35] Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach
    Ng, K. K. H.
    Lee, C. K. M.
    Chan, Felix T. S.
    Qin, Yichen
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 106 : 115 - 136
  • [36] Globally optimal phasor measurement unit placement using branch and bound algorithm
    Kamh, Mohamed Z.
    Younis, Mohamed R.
    Ibrahim, Amr M.
    AIN SHAMS ENGINEERING JOURNAL, 2021, 12 (03) : 2789 - 2798
  • [37] INITIAL ATTEMPT TO OPTIMIZE THE OPERATION OF A HYDROMETRIC NETWORK USING BRANCH AND BOUND ALGORITHM
    PELLETIER, PM
    SIMONOVIC, SP
    CANADIAN JOURNAL OF CIVIL ENGINEERING, 1988, 15 (04) : 717 - 725
  • [38] Branch and bound algorithm for transmission system expansion planning using a transportation model
    Haffner, S
    Monticelli, A
    Garcia, A
    Mantovani, J
    Romero, R
    IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 2000, 147 (03) : 149 - 156
  • [39] Using the branch and bound algorithm to solve forest planning problems with adjacency constraints
    McDill, ME
    Braze, J
    FOREST SCIENCE, 2001, 47 (03) : 403 - 418
  • [40] Branch and Bound algorithm for transmission network expansion planning using DC model
    Rider, Marcos J.
    Garcia, Ariovaldo V.
    Romero, Ruben
    2007 IEEE LAUSANNE POWERTECH, VOLS 1-5, 2007, : 1350 - +
12345