Using The Heuristic Genetic Algorithm in Multi-runway Aircraft Landing Scheduling

Feng Xiao-rong, Feng Xing-jie, Zhao Rui

Abstract


Flights landing scheduling problem is an NP-hard problem, the article presents a heuristic genetic algorithm for multi-runway flights landing scheduling problem. The algorithm is based on a single chromosome coding and dynamic way flights runway allocation, then selects the center gene by the information entropy of each gene, and uses variation of the local search method to solve the slow convergence and easy to fall into local optimum of genetic algorithm. Compared with traditional genetic algorithm, the method can quickly give the better flight approach and landing order to reduce flight delays by the experimental results.

 

 DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.4488


Keywords


Heuristic; Genetic algorithm; Information entropy; Local search

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics