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	1	1711	52.45	15976.9	
r_0t	x_ijt	q_it	and_so_on
1141	0	0	9	91	0	0	-1
1141	0	0	7	106	2	176	3	34	4	66	13	21	15	73	12	126	19	22	17	154	14	46	23	90	1	56	20	68	5	24	25	50	16	182	24	82	10	64	11	94	6	118	8	59	0	0	-1
1141	0	0	22	88	21	36	18	24	9	182	8	118	0	0	-1
1141	0	0	7	53	2	88	3	17	13	63	15	75	4	66	19	66	17	154	14	23	20	68	1	168	23	90	25	50	16	91	24	246	10	32	11	94	0	0	-1
1141	0	0	7	106	2	176	3	34	4	33	12	189	17	77	14	46	23	45	1	56	20	34	5	36	16	182	10	64	6	177	8	118	9	182	18	24	21	36	22	88	0	0	-1
1141	-1