Multiobjective Green Time-Dependent Location-Routing Problem and Algorithms

Table 4

Data of the depots.

Ben	Para		Depot1	Depot2	Depot3	Depot4	Depot5	Depot6	Depot7	Depot8	Depot9	Depot10
C1	cap		990	800	900	850	840	970	1000	910	930	780
	coor	x	40	64	35	44	29	18	63	85	11	37
		y	50	13	79	57	40	82	93	8	63	17
	costs		40000	45000	42000	41000	48000	50000	38000	49000	47000	46000
C2	cap		950	800	1010	970	920	990	1030	930	870	890
	coor	x	40	8	91	35	20	51	29	60	98	96
		y	50	95	46	43	69	100	28	43	97	42
	costs		90000	100000	120000	95000	105000	97000	115000	112000	99000	117000
R1	cap	960	750	910	820	720	790	1000	800	790	890
	coor	x	35	10	52	46	81	11	94	78	88	72
		y	35	54	56	60	24	59	40	77	66	49
	costs		20000	19000	22000	21000	18000	23000	24000	17000	25000	24000
R2	cap		1020	810	720	790	890	1070	740	700	1100	790
	coor	x	35	92	82	25	64	100	10	3	8	64
		y	35	77	17	82	17	87	72	51	99	60
	costs		85000	94000	94000	89000	100000	92000	97000	87000	99000	96000
RC1	cap		1050	900	1090	850	790	940	970	1180	900	1020
	coor	x	40	15	40	24	50	62	79	10	80	87
		y	50	52	3	93	76	60	100	95	11	75
	costs		18000	19000	17000	21000	26000	24000	23000	19000	24000	25000
RC2	cap		1300	1200	900	800	1080	780	1090	1240	900	1100
	coor	x	40	86	23	55	28	68	72	34	26	61
		y	50	37	94	100	92	52	19	61	88	44
	costs		86000	91000	87000	99000	96000	100000	85000	94000	93000	97000