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	1	1	2763	62.5	9481.79	
r_0t	x_ijt	q_it	and_so_on
1842	0	0	15	51	17	59	5	56	27	64	9	83	18	60	0	0	-1
1842	0	0	25	178	24	112	6	176	30	54	13	104	3	76	21	34	26	134	2	24	7	112	4	82	28	66	1	68	20	168	8	110	11	176	29	198	0	0	-1
1842	0	0	14	176	15	102	4	41	22	94	5	112	10	174	9	166	27	128	16	182	28	33	12	297	23	204	19	53	18	120	0	0	-1
1842	0	0	29	198	11	176	19	159	23	68	12	99	20	168	28	33	17	177	2	12	21	17	3	76	13	104	30	54	6	176	25	178	0	0	-1
1842	0	0	18	120	11	88	8	110	1	102	16	182	27	128	9	166	10	174	5	112	2	24	26	134	3	38	21	34	7	112	22	94	4	82	15	102	14	176	30	27	24	112	25	89	29	99	0	0	-1
1842	-1