Branch and Price Algorithm for Tail Assignment Problem with Hour-to-Cycle Ratio Constraints
Published: 7 February 2025| Version 1 | DOI: 10.17632/9zf29kwjyb.1
Contributors:
Çiya Aydoğan, Description
There are 57 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.
Files
Institutions
Orta Dogu Teknik Universitesi
Categories
Mathematical Optimization, Airline