Models and Methods for Two-Echelon Location Routing Problem with Time Constraints in City Logistics

Table 2

Results of the algorithms.

Computational instances	Number of distribution centers	Number of transfer stations	Number of customers	Name of instances	Final; costs	Run; time; (s)	Initial; solution; cost	Optimization; (%)
1	3	8	20	P3-S8-C10	3051.93	0.09	4473.99	31.785
2	3	8	50	P3-S8-C50	6078.23	0.12	7866.92	22.737
3	3	8	100	P3-S8-C100	9274.95	0.16	12489.2	25.737
4	3	8	150	P3-S8-C150	12799.8	0.19	17820.7	28.174
5	3	8	200	P3-S8-C200	14959.7	0.22	19332.7	22.580
6	3	8	250	P3-S8-C250	19391.5	0.23	26043.9	25.543
7	3	8	300	P3-S8-C300	23544.5	0.23	31092	26.198
8	3	8	350	P3-S8-C350	25819.1	0.27	32973.6	21.698
9	3	8	400	P3-S8-C400	31814.9	0.26	41883.6	24.04
10	3	8	450	P3-S8-C450	34776.4	0.29	46474.6	25.171
11	3	8	500	P3-S8-C500	35206.1	0.31	44403.3	20.713
12	3	8	550	P3-S8-C550	43403.2	0.33	56309.2	22.92
13	3	8	600	P3-S8-C600	44031.1	0.35	56052	21.446
14	3	8	650	P3-S8-C650	51651.6	0.34	67129.7	23.057
15	3	8	700	P3-S8-C700	56875.8	0.35	72771.3	21.843
16	3	8	750	P3-S8-C750	61195.3	0.36	77920.5	21.464
17	3	8	800	P3-S8-C800	62861	0.39	79422.5	20.852
18	3	8	850	P3-S8-C850	69820.9	0.41	89022.5	21.569
19	3	8	900	P3-S8-C900	68511.9	0.43	85313.8	19.694
20	3	8	950	P3-S8-C950	78655.7	0.44	97806.6	19.581
21	3	8	1000	P3-S8-C1000	83872.3	0.46	104377	19.645