Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

Table 1

Average performance: Algorithm 6 versus greedy insertion.

(a)

Group	Obj_GRE	Time_GRE (s)	Obj_HEU	Time_HEU (s)	Improvement (%)
1	677	0.04	640	0.035	5.7
2	816	0.019	739	0.15	10.5
3	1030	0.02	744	0.61	38.3
4	1363	0.02	926	7.2	47.2
5	1374	0.18	853	10.4	61.1
6	1564	0.25	885	31.3	76.6
7	1715	0.26	957	47	79.1
8	1915	0.28	889	55.4	115.5
9	2228	0.32	947	135	135.9
10	2309	0.48	976	215	136.5

(b)

Group	Obj_GRE	Time_GRE (s)	Obj_HEU	Time_HEU (s)	Improvement (%)
1	677	0.04	640	0.04	5.7
2	816	0.019	732	0.16	11.5
3	1030	0.02	749	0.62	37.5
4	1363	0.02	910	6.34	49.7
5	1374	0.18	862	8.85	59.4
6	1564	0.25	862	21	81.4
7	1715	0.26	924	42	85.4
8	1915	0.28	905	91	111.5
9	2228	0.32	977	122	127.9
10	2309	0.48	993	142	132.5