Operations Research, Systems Engineering and Industrial Engineering Commons^™

Combinatorial Auction For Transportation Matching Service: Formulation And Adaptive Large Neighborhood Search Heuristic, Baoxiang Li, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper considers the problem of matching multiple shippers and multi-transporters for pickups and drop-offs, where the goal is to select a subset of group jobs (shipper bids) that maximizes profit. This is the underlying winner determination problem in an online auction-based vehicle sharing platform that matches transportation demand and supply, particularly in a B2B last-mile setting. Each shipper bid contains multiple jobs, and each job has a weight, volume, pickup location, delivery location and time window. On the other hand, each transporter bid specifies the vehicle capacity, available time periods, and a cost structure. This double-sided auction will be …