A robust optimization approach for the winner determination problem with uncertainty on shipment volumes and carriers’ capacity

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.

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

[2]  Alexander Shapiro,et al.  Stochastic programming approach to optimization under uncertainty , 2007, Math. Program..

[3]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[4]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[5]  Tao Yao,et al.  A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions , 2015 .

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

[7]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[8]  Noam Nisan,et al.  Bidding Languages for Combinatorial Auctions , 2005 .

[9]  Chris Caplice,et al.  Combinatorial Auctions for Truckload Transportation , 2005 .

[10]  Long Zhao,et al.  Solving two-stage robust optimization problems using a column-and-constraint generation method , 2013, Oper. Res. Lett..

[11]  Matteo Fischetti,et al.  Cutting plane versus compact formulations for uncertain (integer) linear programs , 2012, Math. Program. Comput..

[12]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[13]  Cécile Murat,et al.  Robust location transportation problems under uncertain demands , 2014, Discret. Appl. Math..

[14]  Matteo Fischetti,et al.  A note on the selection of Benders’ cuts , 2010, Math. Program..

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

[16]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[17]  Chi-Guhn Lee,et al.  A stochastic programming winner determination model for truckload procurement under shipment uncertainty , 2010 .

[18]  Hongwei Ding,et al.  A Sampling-Based Stochastic Winner Determination Model for Truckload Service Procurement , 2014 .

[19]  Iain Dunning,et al.  Reformulation versus cutting-planes for robust optimization , 2015, Comput. Manag. Sci..