Inventory Routing Problem - Instances From Archetti et al. (2007)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
2	2	30	4	4	555	178.76	20933.4	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	9	64	12	198	18	64	28	13	16	128	21	58	5	30	0	0	23	126	15	168	25	116	30	145	0	0	10	96	29	198	13	182	11	55	0	0	27	98	20	39	4	92	22	70	1	32	6	53	3	64	0	0	-1
1479	0	0	24	34	23	63	30	92	25	58	8	33	18	32	12	99	28	26	2	63	27	49	0	0	9	32	15	84	19	279	10	48	29	99	0	0	14	159	17	87	26	120	7	51	6	106	0	0	20	78	4	46	0	0	-1
1479	0	0	1	32	22	210	5	30	21	106	16	81	2	21	27	49	0	0	3	64	14	53	13	182	11	165	0	0	-1
1479	0	0	8	22	25	116	30	158	23	126	9	64	24	34	0	0	29	198	10	96	19	93	15	168	0	0	3	32	13	91	17	58	26	120	7	34	6	106	1	16	20	78	0	0	27	49	12	198	18	64	28	26	16	111	5	15	4	92	0	0	-1
1479	-1