A New Formulation of the Set Covering Problem for Metaheuristic Approaches

Table 2

Airline and bus driver crew scheduling problems.

Characteristics				Cost		Number of moves
Instance	Size	Density	Best known	DH	GH	DH	GH
AA03	106 × 8661	4.05%	33155	34637	35642	48	61
AA04	106 × 8002	4.05%	34573	36153	36749	45	62
AA05	105 × 7435	4.05%	31623	32249	32995	45	65
AA06	105 × 6951	4.11%	37464	38043	39422	43	70
AA11	271 × 4413	2.53%	35478	36965	39054	76	90
AA12	272 × 4208	2.52%	30815	33663	34044	77	85
AA13	265 × 4025	2.60%	33211	36337	37345	77	91
AA14	266 × 3868	2.50%	33219	36048	36530	77	95
AA15	267 × 3701	2.58%	34409	36269	37996	73	94
AA16	265 × 3558	2.63%	32752	36185	37160	79	85
AA17	264 × 3425	2.61%	31612	34326	36484	69	91
AA18	271 × 3314	2.55%	36782	39594	40603	84	101
AA19	263 × 3202	2.63%	32317	34749	36093	71	92
AA20	269 × 3095	2.58%	34912	37047	37744	82	86
BUS1	454 × 2241	1.89%	27947	28871	29673	88	100
BUS2	681 × 9524	0.51%	67760	69685	70606	282	280