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.
Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation
2016
Aufsatz (Zeitschrift)
Englisch
Taylor & Francis Verlag | 2014
|A less-than-truckload carrier collaboration planning problem under dynamic capacities
Online Contents | 2011
|