A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems

Table 1

SCP instances from Beasley’s OR-Library.

Instance set	n	m	Cost range	Density	Optimal solution
4	200	1000	[1100]	2	Known
5	200	2000	[1100]	2	Known
6	200	1000	[1100]	5	Known
A	300	3000	[1100]	2	Known
B	200	1000	[1100]	5	Known
C	400	4000	[1100]	2	Known
D	400	4000	[1100]	5	Known
E	500	5000	[1100]	10	Known
F	500	5000	[1100]	20	Unknown
G	1000	10000	[1100]	2	Unknown
H	1000	10000	[1100]	5	Unknown