Local Search-Based Metaheuristic Methods for the Solid Waste Collection Problem

Table 2

Objective values for the optimal solution obtained by the MIP model.

Ins.		Solutions obtained by solver
#Veh	#Cont.	Distance	Time	Veh. load	Routes	Obj	Cpt	% gap
3	5	125.58	73.58	16.10	1.00	77.83	0.10	0.0%
5	10	196.98	82.15	29.51	1.00	87.95	0.13	0.0%
5	15	199.61	85.31	43.06	1.00	92.11	0.25	0.0%
6	10	229.11	82.15	29.51	1.00	87.95	0.14	0.0%
9	15	328.13	85.31	43.06	1.00	92.11	0.24	0.0%
9	20	330.82	88.54	50.77	1.00	95.57	0.29	0.0%
10	25	386.49	116.79	66.51	1.00	124.25	0.55	0.0%
10	35	385.69	154.38	85.08	2.00	162.37	1.23	0.0%
15	50	566.07	178.05	117.55	2.00	186.53	2.43	0.0%
20	60	740.06	194.07	139.19	2.00	202.68	34.27	0.0%
30	60	1061.36	194.07	139.19	2.00	202.67	21.88	0.0%
30	70	1073.77	208.96	163.67	2.00	217.66	1891.78	0.0%
35	75	1235.82	210.64	173.56	2.00	219.50	5888.39	0.0%