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

Table 3

Comparison of the grabbing and proposed assignment models.

Model	Cost			Online order			Occasional driver
	Regular vehicle	Occasional driver	Total	Lateness ratio	Average fulfillment time	Orders matched (%)	ODs matched (%)	Total detour distance
Grabbing model	52.56	130.55	183.11	0.08	46.64	82	50	100.86
Assignment model	99.70	74.31	174.01	0.27	78.24	60	38	54.14