Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand

Table 1

Comparison of HGA results on LLSRP instances.

Ins tan ces	BKS	Cost0.3	Gap; (%)	CPU; (s)	Cost0.5	Gap; (%)	CPU; (s)
3 – 5 – 3	68734.4	68734.4	0	32.4	68734.4	0	38.4
3 – 5 – 5	78976.8	78976.8	0	30	78976.8	0	44.9
3 – 5 – 7	78905	78905	0	39.6	79045.8	0.18	56.3
3 – 8 – 3	85674.7	87163.4	1.74	50.4	85674.7	0	59.9
3 – 8 – 5	86785.9	86943.3	0.18	68.3	86785.9	0	70.5
3 – 8 – 7	86889.6	86889.6	0	49.4	87004.8	0.13	81.9
5 – 8 – 3	85543.1	86065.8	0.61	70.1	85543.1	0	96.8
5 – 8 – 5	86675.7	87529.5	0.98	88.2	86675.7	0	105.4
5 – 8 – 7	85548.9	86170.8	0.73	83.3	85548.9	0	140.8
5 – 12 – 3	97249.7	97249.7	0	127.5	97496	0.25	198.5
5 – 12 – 5	99082.7	99082.7	0	180.7	100165.3	1.09	210.6
5 – 12 – 7	101536.6	101734.4	0.19	178.3	101536.6	0	201.7
5 – 16 – 3	110764.1	110764.1	0	207.7	110928.3	0.15	309.6
5 – 16 – 5	130785.3	131707.1	0.7	253.6	130785.3	0	283
5 – 16 – 7	131786.9	131929.8	0.11	361.9	131786.9	0	317.4
Average	94329.29	94656.43	0.35	121.43	94445.9	0.12	147.71