This README file (version 1) was generated on 2025-05-24 by the dataset authors.


GENERAL INFORMATION
-------------------
1. Title of dataset: Instances used in the paper Efficient assignment of flight levels: A variable neighborhood search approach

2. Authorship

Name: Joaquín A. Pacheco
Institution: Research group on Metaheuristics GRINUBUMET), Departamento de Economía Aplicada, Universidad de Burgos
Email: jpacheco@ubu.es
ORCID: 0000-0002-7462-8680

Name: Silvia Casado Yusta
Institution: Research group on Metaheuristics GRINUBUMET), Departamento de Economía Aplicada, Universidad de Burgos
Email: scasado@ubu.es
ORCID: 0000-0002-9663-1557



DESCRIPTION
-----------
1. Abstract
The data set is a set of txt files with the fictitious instaces used in the paper "Efficient assignment of flight levels: A variable neighborhood search approach"

2. Keywords
air traffic management, flight level assignment, sustainable and economic management, safe air travel, heuristic optimization, variable neighborhood search

3. Date of data generation
    December, 2024

4. Date of dataset publication
    May, 2025

5. Funding
The authors are grateful for the following entities, projects, and grants: The Spanish Research Agency and European Union (Project PID2022-139543OB-C44) and Regional Government of Castilla y León and FEDER founds (BU021G24)




ACCESS INFORMATION
------------------
1. Dataset Creative Commons License CC BY 4.0

2. Dataset DOI: https://doi.org/10.71486/9kgz-wg94

3. Related publication
Paper titled "Efficient assignment of flight levels: A variable neighborhood search approach" submitted to publication


FILE INFORMATION
-----------------

The files in the dataset correspond to each of the fictitious instances used in the article “Efficient assignment of flight levels: A variable neighborhood search approach.” Therefore, there are 55 files corresponding to the 55 instances.

The files are named Flights_xxx-y.txt, where xxx takes 11 values (10, 20, 30, 50, 100, 200, 300, 400, 500, 700, and 1000) and y varies from 1 to 5.

Each file has the following format:

The first line shows the number of flights (m) and the number of heights (n).
The second line shows the ideal height for each flight. The heights are numbered from 0 to n-1.
The third line shows the pairs of compatible flights:
- Each pair of flights is expressed by a number xx.
- The indices (i, j) of the corresponding pair of flights are calculated as follows: i = xx div m, j = xx mod m
- The flight indices are numbered from 0 to m-1

For example, in the file Flights_10-1:
- m = 10, n = 3
- The ideal heights are 2, 2, 1, 1, ...
- The compatible flight pairs are (0,1), (0,2) (0,4), (0,6), (0,8), (0,9), (1,2), (1,3), ...




For questions regarding the dataset, please contact the corresponding author(s).