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	1	5	342	82.28	11245.6	
r_0t	x_ijt	q_it	and_so_on
1141	-1
1141	0	0	14	46	20	68	5	24	1	112	23	90	0	0	16	91	24	93	10	64	11	94	0	0	8	118	9	182	21	36	0	0	3	17	4	66	15	74	12	126	19	44	0	0	2	176	7	53	0	0	-1
1141	0	0	6	139	9	91	18	12	22	44	0	0	2	88	3	34	13	63	4	33	14	23	0	0	17	231	7	106	0	0	25	75	16	182	0	0	-1
1141	0	0	5	24	20	68	1	112	23	90	0	0	24	235	10	64	0	0	8	59	9	91	18	36	22	132	0	0	-1
1141	0	0	25	34	16	182	10	32	11	94	0	0	6	97	8	118	9	91	21	36	0	0	2	176	3	34	7	106	0	0	4	66	13	21	15	74	12	137	19	44	0	0	23	45	20	34	17	154	14	46	0	0	-1
1141	-1