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	
2	2	25	5	3	718	122.69	22603.2	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	17	150	0	0	13	134	6	158	16	118	14	111.64	7	47	24	28	9	58	3	49	0	0	15	112	22	180	25	176	10	62	21	108	20	40	5	23	0	0	-1
1437	0	0	6	79	23	297	9	116	3	98	0	0	14	116.36	12	294	1	154.32	5	23	11	38	2	84	0	0	19	222	24	14	7	94	18	69	8	150	4	74	16	59	0	0	-1
1437	0	0	15	112	22	180	25	176	10	62	21	108	20	40	5	23	0	0	13	134	0	0	-1
1437	0	0	17	150	13	67	1	101.68	20	80	5	46	11	38	2	84	0	0	3	98	24	28	7	94	18	46	8	150	4	74	12	98	15	56	21	54	0	0	6	158	16	118	14	152	23	99	9	116	19	74	0	0	-1
1437	-1