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	3	739	206.77	19820.3	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	27	98	2	42	28	26	12	198	18	64	8	22	25	116	30	158	0	0	23	126	15	168	19	93	10	63	29	198	13	91	0	0	3	64	6	53	1	32	22	70	5	30	21	82	16	128	4	92	20	78	0	0	-1
1479	0	0	24	17	9	96	23	63	10	81	29	99	13	182	11	110	0	0	3	32	6	106	7	51	26	120	17	87	14	159	0	0	-1
1479	0	0	1	32	22	210	5	15	2	42	16	64	28	14	18	64	12	198	27	98	0	0	24	17	30	158	25	116	15	168	19	279	0	0	4	92	20	39	0	0	-1
1479	0	0	24	34	9	64	23	126	15	84	10	96	29	198	3	64	0	0	14	106	11	110	13	182	17	58	26	120	7	34	6	106	1	16	0	0	20	78	4	46	5	30	21	82	16	128	28	25	12	99	18	32	8	33	25	58	30	79	27	49	0	0	-1
1479	-1