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	30	4	1	2218	82.55	17686.5	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	20	39	4	92	27	98	24	34	9	64	11	55	13	182	29	198	10	96	19	93	15	168	23	126	30	158	25	116	8	22	18	64	12	198	28	26	16	128	21	82	2	42	5	30	22	0	1	22	6	53	3	32	0	0	-1
1479	0	0	3	64	14	159	17	87	26	120	7	51	6	106	1	26	22	140	20	39	0	0	-1
1479	0	0	27	98	20	39	4	92	5	15	2	42	16	64	28	13	12	198	18	64	25	116	30	158	23	126	15	168	19	279	10	96	29	198	13	182	11	165	14	53	0	0	-1
1479	0	0	3	64	1	32	6	106	7	34	26	120	17	58	13	91	29	99	10	48	15	84	23	63	30	79	25	58	8	33	12	99	18	32	28	26	16	128	21	123	5	30	22	140	4	46	20	78	27	49	9	96	24	34	0	0	-1
1479	-1