A Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithm

Table 6

Modified savings results.

Sij	Savings	Random number	Route	Total demand	Total distance	Vehicle capacity type	Random number >0,90	Violation
								Vehicle capacity	Travel distance
S12	445	0,58	0-1-2-0	30	795	30–3
S46	430	0,61		35	630	50–4
S56	410	0,22	0-4-6-5-0	45	675	50–4
S16	900	0,99	—	—	—	—	x
S15	410	0,98				—	x	x	x
S45	330	0,15	—	—	—	—
S26	310	0,77	—	—	—	—
S13	265	0,42			880	—		x
S14	350	0,92				—	x	x	x
S36	175	0,73	—	—	—	—
S25	170	0,76				—		x	x
S35	181	0,97				—	x	x
S23	70	0,22				—		x	x
S24	27	0,71				—		x	x
S34	125	0,48			755	—		x