A Comparative Study of Meta-Heuristics for the Aircraft Landing Scheduling Problem

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2016-06-15

Autores

Álvaro Câmara (Autor) FEUP; Thiago RPM Rúbio (Autor) FEUP; Daniel Castro Silva (Autor) FEUP; Eugénio Oliveira (Autor) FEUP

Ata de Conferência Internacional

Título: 11a Conferencia Ibérica de Sistemas y Tecnologías de Información

Páginas: 83-86

Indexação

ISI Web of Knowledge - 0 Citações

ISI Web of Science

Scopus - 0 Citações

Classificação Científica

CORDIS: Ciências Físicas > Ciência de computadores > Informática

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-00M-0ND

DOI: 10.1109/cisti.2016.7521601

Abstract (EN): Air traffic flow has faced a big increase in the last decade, becoming one of the main transportation solutions. Federal Aviation Administration (FAA) and aeronautical industries are both predicting a growth between 150% and 250% over the next two decades. With this increasing number of aircrafts in the air, airports need also to improve their scheduling strategies to better control the coordination of landing planes. Air Traffic Controllers (ATCO) seek to minimize the waiting time on the aircraft waiting queue. However the ATCO normally use a First Come First Served (FCFS) technique driven by its simplicity. However, it has the disadvantage of offering poor performance when opposed to other strategies. Aiming to characterize and evaluate this performance and compare it with other algorithms, we have tested the application of some scheduling meta-heuristics to this problem, namely Tabu Search (TS) and Simulated Annealing (SA). Experiments show that SA outperforms TS by up to 55% and FCFS by up to 19%. We recommend that using the SA could help managers enhance their decisions over the currently used policies (FCFS) by providing a better scheduling for landing control and saving companies' time and money.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 4