Continuous Time Formulation and Lagrangian Relaxation Algorithm for the Gate Assignment Problem

Table 5

Comparison between CPLEX and Lagrangian relaxation for large instances.

Problem			Avg. rel. dev. (%)		Avg. CPU time (s)
|N|	|M|	T	MIP gap	LR_Gap	CPLEX	LR
30	6	720	62.84^(4)	6.08	600.00	139.89
40	8	720	80.87^(2)	7.63	600.00	188.73
50	10	720	86.33^(8)	9.28	600.00	231.34
60	12	720	—	12.84	600.00	237.30
70	14	720	—	14.37	600.00	363.32
80	16	720	—	16.89	600.00	416.30

^(•)The number of instances with no feasible solution in 600 s, and relative deviation is set to 100%. —, all the instances have no feasible solution in 600 s.