In this paper, we formalize the simultaneous slot allocation problem. It is an extension of the problem currently tackled for allocating airport slots: it deals with all airports simultaneously and it enforces the respect of airspace sector capacities. By solving this novel problem, the system...

We propose a mechanism for solving the airport slot allocation problem in Europe. We consider the interdependence of the slots at different airports, and we maximize the efficiency of the system. Through an experimental analysis we quantitatively assess the cost imposed by grandfather rights,...

In this paper, we formalize the simultaneous slot allocation problem. It is an extension of the problem currently tackled for allocating airport slots: it deals with all airports simultaneously and it enforces the respect of airspace sector capacities. By solving this novel problem, the system...

In Europe, when an imbalance between demand and capacity is detected for air traffic network resources, Air Traffic Flow Management slots are allocated to flights on the basis of a First Planned First Served principle. We propose a market mechanism to allocate such slots in the case of a single...

In this paper a definition of the exploration performed by stochastic algorithms is proposed. It is based on the observation through cluster analysis of the solutions generated during a run. The probabilities associated by an algorithm to solution components are considered. Moreover, a...

We analyze a case study and we model it as a variant of the Traveling Salesman Problem. It is characterized by multiple time windows, variable service duration, priority constraints, and appointments with customers. The definition of the feasible region differs from the classical one: a maximum...