Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

Table 4

Effectiveness of the optimization procedure.

Scenario	Number of initial routes	Number of routes after optimization	% routes reduced	Computing time (s)
1	633	69	89.1	9.3
2	677	72	89.4	10.2
3	659	76	88.6	9.1
4	652	62	90.6	9.6
5	659	73	89.0	9.9
6	634	71	88.8	9.8
7	631	62	90.2	9.6
8	622	67	89.3	10.2
9	622	60	90.5	10.1
10	651	62	90.6	9.9