Research Article
An Auction-Based Multiagent Simulation for the Matching Problem in Dynamic Vehicle Routing Problem with Occasional Drivers
Algorithm 1
Whole simulation procedure.
| (1) | Initialize and let | | (2) | while the clock time t is not greater than the end time do | | (3) | Generate new online orders and occasional drivers | | (4) | Update the list of online orders and occasional drivers | | (5) | Update current bid list for each online order | | (6) | if t = scheduled auction match time then | | (7) | Run auction-based matching procedure | | (8) | end if | | (9) | if t = scheduled regular vehicle departure time then | | (10) | Run regular vehicle routing procedure | | (11) | end if | | (12) | | | (13) | end while |
|
