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 条
  • [1] Improved genetic algorithm for aircraft departure sequencing problem
    Wang Lai-jun
    Hu Da-wei
    Gong Rui-zi
    THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 35 - +
  • [2] MULTICRITERIA PRE-DEPARTURE SEQUENCING OF AIRCRAFT USING THE GREEDY SCHEDULING ALGORITHM
    Kwasiborska, Anna
    CLC 2013: CARPATHIAN LOGISTICS CONGRESS - CONGRESS PROCEEDINGS, 2014, : 512 - 517
  • [3] Binary goal programming model for optimizing tire selection using branch and bound algorithm
    Salunkhe S.
    Guessasma S.
    Naranje V.
    Aly S.
    International Journal for Simulation and Multidisciplinary Design Optimization, 2021, 12
  • [4] Optimizing energy consumption of robotic cells by a Branch & Bound algorithm
    Bukata, Libor
    Sucha, Premysl
    Hanzalek, Zdenek
    COMPUTERS & OPERATIONS RESEARCH, 2019, 102 : 52 - 66
  • [5] A Branch and Bound Algorithm in Optimizing Job Shop Scheduling Problems
    Nababan, Erna Budhiarti
    Abdullah, Salwani
    Hamdan, Abdul Razak
    Zakaria, Mohamad Shanudin
    INTERNATIONAL SYMPOSIUM OF INFORMATION TECHNOLOGY 2008, VOLS 1-4, PROCEEDINGS: COGNITIVE INFORMATICS: BRIDGING NATURAL AND ARTIFICIAL KNOWLEDGE, 2008, : 248 - 252
  • [6] SEQUENCING OF TASKS WITH SETUP TIMES USING BRANCH AND BOUND
    de Jesus, Edilson
    Rodrigues, Maria Teresa
    REVISTA GEINTEC-GESTAO INOVACAO E TECNOLOGIAS, 2014, 4 (03): : 1062 - 1075
  • [7] A branch and bound algorithm for the minimum storage-time sequencing problem
    Detti, P
    Pacciarelli, D
    NAVAL RESEARCH LOGISTICS, 2001, 48 (04) : 313 - 331
  • [8] Scheduling a Wet Station Using a Branch and Bound Algorithm
    Kim, Hyun-Jung
    Lee, Jun-Ho
    Lee, Tae-Eog
    PROCEEDINGS 2012 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2012, : 2097 - 2102
  • [9] GRAPHICAL SYMBOL RETRIEVAL USING A BRANCH AND BOUND ALGORITHM
    Nayef, Nibal
    Breuel, Thomas M.
    2010 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, 2010, : 2153 - 2156
  • [10] OPTIMIZING STIMULUS PATTERNS FOR DENSE ARRAY TDCS WITH FEWER SOURCES THAN ELECTRODES USING A BRANCH AND BOUND ALGORITHM
    Guler, Seyhmus
    Dannhauer, Moritz
    Erem, Burak
    Macleod, Rob
    Tucker, Don
    Turovets, Sergei
    Phan Luu
    Meleis, Waleed
    Brooks, Dana H.
    2016 IEEE 13TH INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI), 2016, : 229 - 232
12345