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	1	40	3	2	1642	109.4	4301.58	
r_0t	x_ijt	q_it	and_so_on
2189	-1
2189	0	0	21	102	11	192	35	152	17	122	29	114	33	98	18	34	19	190	26	22	9	174	16	61	2	37	23	34	4	96	40	58	36	70	22	44	10	42	0	0	14	0	15	69	39	66	24	55	13	28	30	70	28	22	1	21	32	116	27	52	25	84	8	156	6	94	37	15	3	33	38	130	5	37	34	52	31	176	12	126	7	122	20	118	0	0	-1
2189	0	0	14	54	0	0	-1