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	25	5	3	718	108.72	10955.1	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	3	98	24	28	7	94	18	46	8	75	4	37	12	180	6	158	0	0	16	118	14	152	23	177	9	116	19	148	0	0	5	23	20	80	1	128	21	108	15	112	13	67	0	0	-1
1437	0	0	2	42	11	19	5	46	10	93	25	264	22	180	15	56	0	0	13	134	17	150	0	0	-1
1437	0	0	1	128	21	108	22	180	25	88	10	31	11	57	2	126	0	0	3	49	24	28	7	47	18	46	8	225	4	111	12	212	0	0	19	148	9	58	23	219	14	76	16	59	6	158	0	0	-1
1437	0	0	5	46	20	80	21	54	15	112	13	134	17	150	0	0	6	79	16	118	14	152	7	94	24	14	9	116	3	98	0	0	-1
1437	-1