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

Algorithm 2

Auction-based matching procedure.

(1)	Input: current bid list in ascending order for each online order i
(2)	for i = 1 to n do
(3)	Select ODj, the lowest bidder, and if not yet reached the capacity limit
(4)	if more than one OD offers the same bid then
(5)	order i is assigned to the ODj with the fewer number of bids
(6)	end if
(7)	end for
(8)	Output: matching results