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	3	3	668	137.27	21779.5	
r_0t	x_ijt	q_it	and_so_on
1336	-1
1336	0	0	17	31	19	96	23	54	22	44	13	47.68	15	184	4	160	11	33	0	0	16	75	14	98	5	36	3	66	7	100	2	130	12	81	10	77	0	0	21	36	25	114	20	82	6	69	1	60	8	134	18	36	0	0	-1
1336	0	0	9	222	24	144	0	0	-1
1336	0	0	10	231	12	81	7	50	2	65	11	33	16	78.36	0	0	21	72	25	114	19	96	20	82	6	69	1	60	8	67	17	93	0	0	4	160	15	184	13	128.32	22	44	23	54	14	49	3	33	0	0	-1
1336	0	0	11	66	14	98	5	36	3	66	7	100	2	130	12	162	0	0	1	120	20	164	6	207	8	134	18	36	0	0	9	148	16	221.64	0	0	-1
1336	0	0	24	144	21	36	25	57	19	96	23	27	22	22	13	88	15	92	4	80	0	0	9	74	0	0	-1