Location-based techniques for the synergy approximation in combinatorial transportation auctions

The use of combinatorial auctions for the procurement of transportation services is investigated in this paper. We focus on the carrier viewpoint who is interested in submitting to the auction a selected bundle of loads that avoids some of the empty movement of the vehicles in his transportation network and that increases his profits. For this purpose we develop an optimization approach based on the use of the location techniques, usually used in the context of facility planning. Mathematically, this means maximizing the synergy among the bundle’s auctioned loads from one side and between the auctioned and the pre-existing loads from the other side. We show the validity of our approach by using first an illustrative example and then by applying it to solve a real-life problem related to a logistics company installed in the Arabic Gulf region.

[1]  Antonio J. Conejo,et al.  Short-Term Trading for Electricity Producers , 2011 .

[2]  P. Keskinocak,et al.  Bidding strategies and their impact on revenues in combinatorial auctions , 2005 .

[3]  Yossi Sheffi,et al.  Combinatorial Auctions in the Procurement of Transportation Services , 2004, Interfaces.

[4]  A. Regan,et al.  Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective , 2003 .

[5]  Gianpaolo Ghiani,et al.  The lane covering problem with time windows , 2008 .

[6]  Patrizia Beraldi,et al.  Optimal capacity allocation in multi-auction electricity markets under uncertainty , 2005, Comput. Oper. Res..

[7]  A. Regan,et al.  Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts , 2003 .

[8]  Martin W. P. Savelsbergh,et al.  Bid price optimization for truckload carriers in simultaneous transportation procurement auctions , 2015 .

[9]  Kathrin Klamroth,et al.  Single-facility location problems with barriers , 2010, Springer series in operations research.

[10]  Pierre Hansen,et al.  On the Weber facility location problem with limited distances and side constraints , 2011, Optim. Lett..

[11]  Teodor Gabriel Crainic,et al.  The stochastic bid generation problem in combinatorial transportation auctions , 2014, Eur. J. Oper. Res..

[12]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[13]  Nabila Remli,et al.  A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes , 2013 .

[14]  Christopher George Caplice,et al.  An optimization based bidding process : a new framework for shipper-carrier relationships , 1996 .

[15]  Rodrigo A. Garrido,et al.  Procurement of transportation services in spot markets under a double-auction scheme with elastic demand , 2007 .

[16]  Tsung-Sheng Chang,et al.  Decision support for truckload carriers in one-shot combinatorial auctions , 2009 .

[17]  Pinar Keskinocak,et al.  Combinatorial Auctions in Procurement , 2004 .

[18]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms, and Applications, Second Edition , 2013 .

[19]  F. Kelly,et al.  A Combinatorial Auction with Multiple Winners for Universal Service , 2000 .

[20]  R. Musmanno,et al.  A multistage formulation for generation companies in a multi-auction electricity market , 2010 .

[21]  Sven de Vries,et al.  A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions , 2005, Manag. Sci..

[22]  Flavio M. Menezes,et al.  On the optimality of Treasury Bill auctions , 1995 .

[23]  Rakesh Nagi,et al.  Commentary on facility location in the presence of congested regions with the rectilinear distance metric , 2004 .

[24]  Mu Xia,et al.  Combinatorial Bid Generation Problem for Transportation Service Procurement , 2005 .

[25]  S. Rassenti,et al.  A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .

[26]  Zhong Ma,et al.  A Carrier's Optimal Bid Generation Problem in Combinatorial Auctions for Transportation Procurement , 2007 .