airplane sequencing landing on the run way using the imperialist algoritm

airplane sequencing landing on the run way using the imperialist algoritm

iman gharibi1 hasan arfaeinia2

1) msc student of computer engineering boushehr lian educational in institute boushehr Iran
2) faculty member of boushehr lian eduvational institute boushehr iran

IOI Code : XAGA-DFFDK
Publication : 4th.International Conference on Researches in Science & Engineering & International Congress on Civil, Architecture and Urbanism in Asia(4icrsie.com)
Abstract :
    One of the most widely applied issues in the global airports, particularly the airports with high flight traffic on the band, is to determine the scheduling if airplane landing on band. These issues are of special and hard computational complexity. The aircraft sequencing problem is among the most important issues which is discussed in the field of air traffic control. This issue is related to allocating the airplanes for landing on the band such that the total loss of delayed and early landing of all airplanes is minimized. Now, concerning its hard computation, the heuristic algorithms are applied to solve such problems. In the present study, these algorithms are used to solve these problems in more than 100 airplanes of which the computational results indicate the algorithm’s capability to find the optimum responses in a short computational time for 150 airplanes. This is called the Imperialist Algorithm. Keywords: Airplane Landing, runway, Sequencing, Imperialist Algorithm

Keywords : airplane landing runway sequencing imperialist algorithm