A Sampling-Based Stochastic Winner Determination Model for Truckload Service Procurement

Bo Zhang, Hongwei Ding, Hongbo Li, Wei Wang, Tao Yao

Research output: Contribution to journalArticlepeer-review

31 Scopus citations


Many large shippers procure truckload (TL) service from carriers via a combinatorial auction. In order to determine the winners of the auction, they need to solve a combinatorial optimization problem known as winner determination problem (WDP). In practice, shippers must resolve the WDP under shipment volume uncertainty due to limited information of future demands. In this paper, we propose a sampling-based two-stage stochastic programming approach to solve WDP under shipment volume uncertainty. We propose a refined formulation of deterministic WDPs in which shortage in shipments and the associated penalty cost are explicitly modeled. We demonstrate that the refined model is more general and more feasible under uncertainty than the benchmarks. Theoretical results pertaining to problem feasibility are derived and their insights to TL service procurement are provided. We propose a sampling-based solution approach called Monte Carlo Approximation (MCA) and use numerical tests to show that MCA is numerically tractable for solving moderately sized instances of TL service procurement. Finally, we verify via Monte Carlo simulation that the solution to our proposed stochastic WDP yields lower procurement cost than the solution to the deterministic WDP.

Original languageEnglish (US)
Pages (from-to)159-181
Number of pages23
JournalNetworks and Spatial Economics
Issue number2
StatePublished - Jun 2014

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'A Sampling-Based Stochastic Winner Determination Model for Truckload Service Procurement'. Together they form a unique fingerprint.

Cite this