AbstractWe 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 awarded lanes. In addition, many other important comprehensive business side constraints are included in the model. We demonstrate the value of the stochastic solution over one obtained by a deterministic model based on using average shipment volumes. Computational results are given that indicate that moderately sized realistic instances can be solved by commercial branch and bound solvers in reasonable time.
A stochastic programming winner determination model for truckload procurement under shipment uncertainty
Transportation Research Part E: Logistics and Transportation Review ; 46 , 1 ; 49-60
2009-02-24
12 pages
Article (Journal)
Electronic Resource
English