Abstract

This paper addresses the winner determination problem (WDP) for TL transportation procurement auctions under uncertain shipment volumes and uncertain carriers’ capacity. It extends an existing two-stage robust formulation proposed for the WDP with uncertain shipment volumes. The paper identifies and theoretically validates a number of accelerating strategies to speed up the convergence of a basic constraint generation algorithm proposed in the literature. Experimental results prove the high computational performance of the proposed new algorithm and the relevance of considering uncertainty on the carriers’ capacity when solving the WDP.

Full Text
Paper version not known

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 call

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.