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