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	30	4	4	555	150.1	10666.8	
r_0t	x_ijt	q_it	and_so_on
1479	-1
1479	0	0	27	98	2	42	16	128	21	82	5	30	4	92	20	78	0	0	28	26	12	198	18	64	8	22	25	116	30	129	0	0	23	126	15	84	10	56	29	198	13	91	0	0	3	64	17	58	26	120	7	34	6	106	1	32	22	140	0	0	-1
1479	0	0	11	165	13	182	14	159	0	0	30	108	25	58	15	168	23	63	9	82	24	34	0	0	19	237	10	88	29	99	0	0	-1
1479	0	0	5	30	2	42	16	64	28	22	18	64	12	198	27	98	0	0	3	64	6	106	1	32	22	140	4	92	20	78	0	0	-1
1479	0	0	20	39	4	46	27	49	12	99	18	32	28	17	16	128	21	82	5	15	1	16	3	32	0	0	24	34	9	46	15	168	30	158	25	116	8	33	0	0	29	198	10	96	19	135	23	126	0	0	14	53	11	55	13	182	17	58	26	120	7	34	6	53	0	0	-1
1479	-1