We consider the carrier's optimal bid generation problem in combinatorial auctions for transportation procurement. Bidders (carriers) employ vehicle routing models to identify sets of lanes (origin-destination pairs) based on the actual routes that a fleet of trucks will follow in order to...

We propose a two-stage stochastic integer programming model for the winner determination problem (WDP) in combinatorial auctions to hedge the shipper's risk under shipment uncertainty. The shipper allows bids on combinations of lanes and solves the WDP to determine which carriers are to be...