scholarly journals The ATC Work Shift Scheduling Problem Based on Multistart Simulated Annealing and Regular Expressions

2018 ◽  
Author(s):  
A. Mateos ◽  
F. Tello ◽  
A. Jimenez-Martin ◽  
J.A. Fernandez de Pozo
Keyword(s):  
Simulated Annealing ◽  
Regular Expressions ◽  
Scheduling Problem ◽  
Shift Scheduling ◽  
Work Shift

scholarly journals The Air Traffic Controller Work-Shift Scheduling Problem in Spain from a Multiobjective Perspective: A Metaheuristic and Regular Expression-Based Approach

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Faustino Tello ◽  
Alfonso Mateos ◽  
Antonio Jiménez-Martín ◽  
Adán Suárez
Keyword(s):  
Simulated Annealing ◽  
Rank Order ◽  
Optimal Solution ◽  
Air Traffic ◽  
Second Phase ◽  
Scheduling Problem ◽  
Shift Scheduling ◽  
Work Shift ◽  
Labor Conditions ◽  
Feasible Solutions

We address an air traffic control operator (ATCo) work-shift scheduling problem. We consider a multiple objective perspective where the number of ATCos is fixed in advance and a set of ATCo labor conditions have to be satisfied. The objectives deal with the ATCo work and rest periods and positions, the structure of the solution, the number of control center changes, or the distribution of the ATCo workloads. We propose a three-phase problem-solving methodology. In the first phase, a heuristic is used to derive infeasible initial solutions on the basis of templates. Then, a multiple independent run of the simulated annealing metaheuristic is conducted aimed at reaching feasible solutions in the second phase. Finally, a multiple independent simulated annealing run is again conducted from the initial feasible solutions to optimize the objective functions. To do this, we transform the multiple to single optimization problem by using the rank-order centroid function. In the search processes in phases 2 and 3, we use regular expressions to check the ATCo labor conditions in the visited solutions. This provides high testing speed. The proposed approach is illustrated using a real example, and the optimal solution which is reached outperforms an existing template-based reference solution.

scholarly journals A Comparative Analysis of Simulated Annealing and Variable Neighborhood Search in the ATCo Work-Shift Scheduling Problem

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 636 ◽  
Author(s):  
Faustino Tello ◽  
Antonio Jiménez-Martín ◽  
Alfonso Mateos ◽  
Pablo Lozano
Keyword(s):  
Simulated Annealing ◽  
Solution Structure ◽  
Variable Neighborhood Search ◽  
Fitness Function ◽  
Phase 1 ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Shift Scheduling ◽  
Work Shift ◽  
Starting Point

This paper deals with the air traffic controller (ATCo) work shift scheduling problem. This is a multi-objective optimization problem, as it involves identifying the best possible distribution of ATCo work and rest periods and positions, ATCo workload and control center changes in order to cover an airspace sector configuration, while, at the same time, complying with ATCo working conditions. We propose a three-phase problem-solving methodology based on the variable neighborhood search (VNS) to tackle this problem. The solution structure should resemble the previous template-based solution. Initial infeasible solutions are built using a template-based heuristic in Phase 1. Then, VNS is conducted in Phase 2 in order to arrive at a feasible solution. This constitutes the starting point of a new search process carried out in Phase 3 to derive an optimal solution based on a weighted sum fitness function. We analyzed the performance in the proposed methodology of VNS against simulated annealing, as well as the use of regular expressions compared with the implementation in the code to verify the feasibility of the analyzed solutions, taking into account four representative and complex instances of the problem corresponding to different airspace sectorings.

scholarly journals A Variation of the ATC Work Shift Scheduling Problem to Deal with Incidents at Airport Control Centers

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 321 ◽  
Author(s):  
Antonio Jiménez-Martín ◽  
Faustino Tello ◽  
Alfonso Mateos
Keyword(s):  
Traffic Management ◽  
Air Traffic ◽  
Neighborhood Search ◽  
Second Phase ◽  
Scheduling Problem ◽  
Shift Scheduling ◽  
Control Center ◽  
Traffic Demand ◽  
Work Shift ◽  
Real Time Traffic

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.

scholarly journals A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics

2021 ◽  
Author(s):  
Chin-Chia Wu ◽  
Ameni Azzouz ◽  
Jia-Yang Chen ◽  
Jianyou Xu ◽  
Wei-Lun Shen ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Completion Time ◽  
Simulated Annealing Algorithm ◽  
Optimal Schedule ◽  
Computational Studies ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Large Size ◽  
Annealing Algorithm ◽  
One Machine

AbstractThis paper studies a single-machine multitasking scheduling problem together with two-agent consideration. The objective is to look for an optimal schedule to minimize the total tardiness of one agent subject to the total completion time of another agent has an upper bound. For this problem, a branch-and-bound method equipped with several dominant properties and a lower bound is exploited to search optimal solutions for small size jobs. Three metaheuristics, cloud simulated annealing algorithm, genetic algorithm, and simulated annealing algorithm, each with three improvement ways, are proposed to find the near-optimal solutions for large size jobs. The computational studies, experiments, are provided to evaluate the capabilities for the proposed algorithms. Finally, statistical analysis methods are applied to compare the performances of these algorithms.

Sign in / Sign up

Export Citation Format

Share Document