Improved Harmony Search Algorithm for Truck Scheduling Problem in Multiple-Door Cross-Docking Systems

Table 5

Makespan and computational time obtained by three methods for the nine test problems.

Problem set	HS				IHS				GA
	Optimal	Worst	Average	Computational time	Optimal	Worst	Average	Computational time	Optimal	Worst	Average	Computational time
1	198	254	233.2	17.301	187	238	220.4	16.734	196	248	209.9	48.260
2	455	498	477.05	29.280	433	474	456.9	27.611	419	489	441.35	90.881
3	873	964	920.8	29.442	866	937	903.9	26.109	820	1012	869.85	159.679
4	429	467	445.6	23.842	429	471	445.5	24.480	429	465	444.7	97.429
5	687	798	741.65	40.347	647	750	721.35	39.253	687	777	689	141.686
6	922	1010	975.4	36.304	905	984	933.25	38.102	856	983	918.6	176.780
7	791	1011	926.3	31.501	784	979	928.25	32.548	791	922	853.2	109.181
8	1044	1193	1112.1	51.448	963	1093	1044.9	49.160	948	1095	1011	176.188
9	1166	1337	1231.3	50.592	1153	1243	1195.7	49.094	1110	1381	1186.4	268.185