An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers

Table 2

Base case under different rolling horizons.

Rolling horizon	Cost			Online order			Occasional driver		Average cost per order per OD	CPU run time (mm:ss)
	Regular vehicle	Occasional driver	Total	Lateness ratio	Average fulfillment time	Orders matched (%)	ODs matched (%)	Total detour distance
5	142.87	103.75	246.62	0.24	68.44	70	44	73.73	1.469	8:14
10	146.57	97.55	244.12	0.27	75.42	67	43	66.29	1.442	9:36
20	146.17	93.79	239.96	0.28	77.04	66	42	60.55	1.400	11:26
30	148.46	89.06	237.52	0.29	79.23	65	41	55.30	1.347	12:43
40	151.74	87.50	239.24	0.30	81.17	65	42	53.14	1.329	14:01
50	170.09	68.56	238.65	0.39	95.09	52	33	39.21	1.300	14:28
60	176.34	65.69	242.04	0.45	103.40	50	30	35.71	1.300	17:03
70	200.70	45.05	245.75	0.55	117.56	34	21	27.00	1.301	17:30

Base case.