Solving the winner determination problem for online B2B transportation matching platforms

Abstract We consider the problem of matching multiple shippers and transporters participating in an online B2B last-mile logistics platform in an emerging market. Each shipper places a bid that is made up of multiple jobs, where each job comprises key information like the weight, volume, pickup and delivery locations, and time windows. Each transporter specifies its vehicle capacity, available time periods, and a cost structure. We formulate the mathematical model and provide a Branch-and-Cut approach to solve small-scale problem instances exactly and larger scale instances heuristically using an Adaptive Large Neighbourhood Search approach. To increase the win percentage of both shippers and transporters, we propose an extension of the single round auction to a second-round for failed bids. Using our models and the results obtained, we present interesting managerial insights that are helpful to platform participants. For example, due to the cost structure, there is little impact on profitability with time varying speeds, but time windows play a significant role in the profitability of the system. And there are tangible benefits that all platform participants (shippers, transporters and operator) can gain by extending single-round auction to two rounds.

[1]  Bo Dai,et al.  Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests , 2014, Oper. Res..

[2]  Hoong Chuin Lau,et al.  A Combinatorial Auction for Transportation Matching Service: Formulation and Adaptive Large Neighborhood Search Heuristic , 2017, ICCL.

[3]  Evren Olcaytu,et al.  An efficient bidding heuristic for simultaneous truckload transportation auctions , 2020, Optim. Lett..

[4]  Meng Cheng,et al.  Truthful, Budget-Balanced Bundle Double Auctions for Carrier Collaboration , 2017, Transp. Sci..

[5]  Christian Bierwirth,et al.  Solutions to the request reassignment problem in collaborative carrier networks , 2010 .

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

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

[8]  Amitava Bagchi,et al.  Designing information feedback for bidders in multi-item multi-unit combinatorial auctions , 2020, Decis. Support Syst..

[9]  Andrew Lim,et al.  Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction , 2019, Transp. Sci..

[10]  Hoong Chuin Lau,et al.  Achieving Economic and Environmental Sustainabilities in Urban Consolidation Center With Bicriteria Auction , 2016, IEEE Transactions on Automation Science and Engineering.

[11]  Lucas P. Veelenturf,et al.  An auction for collaborative vehicle routing: Models and algorithms , 2020, EURO J. Transp. Logist..

[12]  George Q. Huang,et al.  Transportation service procurement in periodic sealed double auctions with stochastic demand and supply , 2013 .

[13]  T. C. Edwin Cheng,et al.  An optimal efficient multi-attribute auction for transportation procurement with carriers having multi-unit supplies , 2019, Omega.

[14]  Leandro C. Coelho,et al.  Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet , 2019, Transportation Research Part E: Logistics and Transportation Review.

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

[16]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[17]  Gilbert Laporte,et al.  Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.

[18]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..