Abstract
Combinatorial auctions are widely used for the procurement of transportation services. In these auctions, shippers act as auctioneers who need to outsource a number of transportation services to external carriers. Carriers compete by submitting bids on packages of shippers’ requests. After receiving all carriers’ bids, the shipper solves the well-known winner determination problem (WDP) in order to determine winning bids. This paper considers the WDP in a context where shipment volumes are not known with certainty. Based on the bi-level characteristic of the problem, a 2-stage robust formulation is proposed and solved using a constraint generation algorithm. Experimental results show a good performance of the proposed approach. We also evaluate, through an experimental analysis, the benefits of considering a robust rather than a deterministic WDP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Part C: Emerging Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
