A New Formulation of the Set Covering Problem for Metaheuristic Approaches

Table 3

Railway crew scheduling problems.

Characteristics				Cost		Number of moves
Instance	Size	Density	Best known	DH	GH	DH	GH
RAIL507	507 × 63009	1.2%	174	205	212	150	169
RAIL516	516 × 47311	1.3%	182	202	202	181	186
RAIL582	582 × 55515	1.2%	211	243	251	191	212
RAIL2586	2586 × 920683	0.4%	948	1102	1185	770	917
RAIL2536	2536 × 1081841	0.4%	691	828	891	581	660
RAIL4284	4284 × 1092610	0.2%	1065	1303	1385	997	1091
RAIL4872	4872 × 968672	0.2%	1534	1802	1900	1339	1521