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	1	5	342	90.28	20172.5	
r_0t	x_ijt	q_it	and_so_on
1141	-1
1141	0	0	7	106	2	176	22	44	0	0	16	182	10	64	11	94	0	0	21	18	18	24	9	182	8	118	0	0	14	46	17	154	5	24	20	68	23	50	0	0	19	44	12	126	15	51	13	21	4	66	3	34	0	0	-1
1141	0	0	24	246	25	75	0	0	1	168	23	85	0	0	6	177	0	0	-1
1141	0	0	6	59	10	64	11	94	0	0	8	59	9	182	21	54	22	44	0	0	4	66	15	97	13	63	3	17	2	88	0	0	7	53	12	126	17	154	0	0	25	25	16	91	5	24	20	68	14	23	0	0	-1
1141	0	0	3	34	4	33	12	63	19	44	0	0	14	46	20	34	1	112	23	90	0	0	16	182	11	47	0	0	8	118	9	91	18	24	22	88	0	0	2	176	7	106	0	0	-1
1141	0	0	24	246	10	32	11	47	0	0	-1