A variation of the ATC work shift scheduling problem to deal with incidents at airport control centers

Jiménez Martín, Antonio ORCID: https://orcid.org/0000-0002-4947-8430, Tello Caballo, Faustino ORCID: https://orcid.org/0000-0002-0369-5798 and Mateos Caballero, Alfonso ORCID: https://orcid.org/0000-0003-4764-6047 (2020). A variation of the ATC work shift scheduling problem to deal with incidents at airport control centers. "Mathematics", v. 8 (n. 3); ISSN 2227-7390. https://doi.org/10.3390/math8030321.

Descripción

Título: A variation of the ATC work shift scheduling problem to deal with incidents at airport control centers
Autor/es:
Tipo de Documento: Artículo
Título de Revista/Publicación: Mathematics
Fecha: 2 Marzo 2020
ISSN: 2227-7390
Volumen: 8
Número: 3
Materias:
Palabras Clave Informales: Air traffic management, Algorithm; Metaheuristics, Performance analysis, Tactical phase, work-shift scheduling problem
Escuela: E.T.S. de Ingenieros Informáticos (UPM)
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[thumbnail of 6185884.pdf] PDF (Portable Document Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (9MB)

Resumen

This paper deals with a variation of the air traffic controller (ATC) work shift scheduling problem focusing on the tactical phase, in which the plan for the day of operations can be modified according to real-time traffic demand or other possible incidents (one or more ATCs become sick and/or there is an increase in unplanned air traffic), which may lead to a new sectorization and a lower number of available ATCs. To deal with these issues, we must reassign the available ATCs to the new sectorization established at the time the incident happens, but also taking into account the work done by the ATCs up to that point. We propose a new methodology consisting of two phases. The goal of the first phase is to build an initial possibly infeasible solution, taking into account the sectors that have been closed or opened in the new sectorization, together with the ATCs available after the incident. In the second phase, we use simulated annealing (SA) and variable neighborhood search (VNS) metaheuristics to derive a feasible solution in which the available ATCs are used and all the ATC labor conditions are met. A weighted additive objective function is used in this phase to account for the feasibility of the solution but also for the number of changes in the control center at the time the incident happens and the similarity of the derived solution with templates usually used by the network manager operations center, a center managing the air traffic flows of an entire network of control centers. The methodology is illustrated by means of seven real instances provided by the Air Traffic Management Research, Development and Innovation Reference Center (CRIDA) experts representing possible incidents that may arise. The solutions derived by SA outperform those reached by VNS in terms of both the number of violated constraints in all seven instances, and solution compactability in six out the seven instances, and both are very similar with regard to the number of control center changes at the time of the incident. Although computation times for VNS are clearly better than for SA, CRIDA experts were satisfied with SA computation times. The solutions reached by SA were preferred.

Proyectos asociados

Tipo
Código
Acrónimo
Responsable
Título
Gobierno de España
MTM2017-86875-C3-3-R
Sin especificar
Sin especificar
Sin especificar

Más información

ID de Registro: 85769
Identificador DC: https://oa.upm.es/85769/
Identificador OAI: oai:oa.upm.es:85769
URL Portal Científico: https://portalcientifico.upm.es/es/ipublic/item/6185884
Identificador DOI: 10.3390/math8030321
URL Oficial: https://www.mdpi.com/2227-7390/8/3/321
Depositado por: iMarina Portal Científico
Depositado el: 09 Ene 2025 13:17
Ultima Modificación: 19 Feb 2025 09:54