A Simulation-Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times

Table 2

Results of alternative solutions to the A-n54-k7 instance with medium variances.

𝑟0 and 𝑟max	# Routes	Travel cost	Penalty cost	Total cost	Reliability
0.80	8	1445.73	57.45	2020.25	0.866
0.81	8	1297.66	42.62	1723.82	0.895
0.82	7	1252.56	40.78	1660.33	0.890
0.83	7	1266.24	44.90	1715.29	0.888
0.84	7	1248.71	33.89	1587.61	0.903
0.85	7	1247.59	38.08	1628.41	0.908
0.86	7	1244.77	20.54	1450.13	0.901
0.87	7	1251.99	20.35	1455.48	0.908
0.88	7	1262.13	33.05	1592.59	0.911
0.89	7	1197.46	36.35	1560.94	0.912
0.90	7	1187.62	35.31	1540.76	0.898
0.91	7	1197.09	39.53	1592.39	0.895
0.92	7	1198.62	39.40	1592.66	0.899
0.93	7	1196.18	38.65	1582.66	0.896
0.94	7	1198.17	42.13	1619.50	0.887
0.95	7	1207.03	38.95	1596.48	0.885
0.96	7	1200.60	40.72	1607.76	0.887
0.97	7	1195.30	43.04	1625.75	0.887
0.98	7	1203.17	45.07	1653.87	0.885
0.99	7	1202.01	47.90	1681.00	0.884
1	7	1202.31	50.46	1706.94	0.878

The bold two lines represent the two solutions with the minimum total cost and the maximum reliability, respectively.