Branch and Price Algorithm for Tail Assignment Problem with Hour-to-Cycle Ratio Constraints

There are 90 instances. Each file contains data for an instance.
The name of the files represents the parameter setting used.
N(x) indicates there are x aircraft in the instance.
horizon(x) indicates that the horizon day is x for the instance.
We have 3 replications for each parameter setting. rep(1), rep(2), rep(3) indicates the replication number.

本数据集共计90个实例，每个文件对应存储一个实例的相关数据。文件名即该实例所采用的参数配置。N(x) 表示该实例中包含x架航空器；horizon(x) 代表该实例的规划时限天数为x。每组参数配置均设置3次重复实验，rep(1)、rep(2)、rep(3)分别对应第1、2、3次重复实验。