Research Article

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

Algorithm 3

Regular vehicle routing procedure.
(1)Input: Current list of unassigned online orders
(2)Set = remaining time threshold
(3)for i = 1 to n do
(4)  Set  = latest departure time from the store for online order i
(5)  ifthen
(6)   Mark order i as an urgent online order
(7)  end if
(8)end for
(9)Use greedy insertion algorithm to generate the route for urgent orders
(10)Delete all urgent orders from the current order list
(11)Output: Delivery route for urgent online orders