A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes
A robust winner determination problem for the procurement of transportation services with uncertain shipment volumes is proposed. A 2-stage robust formulation is proposed and solved using a constraint generation algorithm. The proposed approach shows good computational performances. Considerable monetary losses could be avoided when robust solutions are chosen rather than deterministic ones.
uncertain shipment volumes constraint generation combinatorial auctions truckload procurement 2-stage robust optimization