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	2	1	2737	68.19	4180.62	
r_0t	x_ijt	q_it	and_so_on
1825	-1
1825	0	0	32	24	5	28	21	74	3	170	26	48	4	190	7	148	15	19	12	30	13	146	20	24	37	26	39	17	23	0	17	14	14	138	30	20	10	47	24	10	28	20	22	126	40	12	9	62	34	160	36	160	19	134	8	85	25	58	18	52	27	25	6	66	29	82	33	68	38	152	1	154	31	32	2	116	0	0	-1
1825	0	0	35	54	11	37	17	28	16	99	23	26	0	0	-1