A Branch and Bound Algorithm for the Exact Solution of the Problem of EMU Circulation Scheduling in Railway Network

Table 2

The results of the algorithms.

Instance	DCM1-T	Tight connection		Heuristic		B&B
		TCC	MT	TCC	MT	TCC	MT
1	58667	71627	55	64427	54	58667	54
2	59843	69923	55	64163	54	58403	53
3	59807	71327	54	64127	54	58367	57
4	59855	71375	56	64175	54	59855	56
5	60100	73060	54	64420	55	58660	55
6	60144	71664	55	64464	55	60144	54
7	62756	74272	59	68516	55	62756	54
8	57503	66143	56	64703	54	57503	56
9	57133	67213	53	64333	54	58573	57
10	58464	72864	55	65664	53	58464	54
11	58607	75887	57	64367	54	58607	54
12	59784	74184	58	66984	55	59784	56
13	61292	68492	56	67052	56	61292	53
14	56192	72032	55	63392	55	57632	53
15	57347	67427	55	64547	54	57347	53
16	57869	67949	56	65069	55	57869	54
17	57345	65985	54	64545	54	57345	55
18	58618	67250	55	65818	55	58618	55
19	60079	70159	57	64399	55	60079	54
20	61517	71597	56	67277	55	60077	53