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

Table 5

Different OD carrying capacities.

Carrying capacity	Cost			Online order			Occasional driver
	Regular vehicle	Occasional driver	Total	Lateness ratio	Average fulfillment time	Orders matched (%)	ODs matched (%)	Total detour distance
1	189.80	56.91	246.71	0.49	106.57	43	43	28.73
2	150.96	87.79	238.75	0.29	80.23	65	42	52.38
3	127.45	102.33	229.78	0.21	69.47	74	41	66.26

Default setting.