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

Algorithm 4

Occasional driver dynamics.

(1)	An occasional driver j, , enter at
(2)	while the clock time t is not greater than the leave time for do
(3)	if t = start time to offer the bid then
(4)	if’s compensation rate is not greater than the maximum rate
(5)	Provide bids to current online orders
(6)	else
(7)	exit the system
(8)	end if
(9)	if t = scheduled auction match time then
(10)	Run auction-based matching procedure
(11)	end if
(12)
(13)	end while