Abstract

A carrier collaboration problem in less-than-truck load transportation is considered, where multiple carriers exchange their pickup and delivery requests in order to improve their operational efficiency. We extend the clock-proxy auction proposed by Ausubel et al. (2006) to a combinatorial clock-proxy exchange for the problem. This mechanism combines the price discovery of the clock exchange designed based on Lagrangian relaxation with the efficiency of the proxy exchange determined based on the information observed in the clock phase. Numerical experiments on randomly generated instances demonstrate the necessity of the proxy phase and the effectiveness of the clock-proxy exchange.

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.