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	
1	2	30	4	3	739	156.61	9609.79	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	23	126	30	158	25	116	8	22	18	32	12	102	28	13	16	64	2	42	5	15	27	49	0	0	29	198	10	96	19	186	15	168	9	64	24	17	0	0	11	55	13	182	14	106	3	64	6	53	1	32	22	140	4	68	20	39	0	0	-1
1479	0	0	3	32	17	87	26	120	7	51	6	106	1	16	20	78	0	0	27	98	12	195	18	64	28	26	16	128	21	123	5	30	4	70	0	0	-1
1479	0	0	23	126	10	96	15	168	25	116	30	139	24	51	0	0	14	106	11	165	13	182	29	198	0	0	-1
1479	0	0	20	78	4	92	22	140	1	32	6	106	7	34	26	120	17	58	3	64	0	0	5	30	2	63	21	41	16	128	28	26	12	198	18	64	8	33	25	58	30	98	0	0	27	98	9	64	23	63	15	84	19	186	10	48	29	99	13	91	14	6	0	0	-1
1479	-1