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