In combinatorial auctions for the procurement of transportation services, each carrier has to determine the set of profitable contracts to bid on and the associated ask prices. This is known as the Bid Construction Problem (BCP). Our paper addresses a BCP with stochastic clearing prices taking into account uncertainty on other competing carriers’ offers. Contracts’ selection and pricing decisions are integrated to generate multiple combinatorial bids. Our paper is the first to propose an exact non-enumerative method to solve this NP-Hard problem. Our computational results demonstrate that optimal solutions can be obtained on instances with up to 50 contracts. We also propose a hybrid heuristic that yields most of the these optimal solutions in a fraction of the run time, and provides competitive solutions for the remaining instances. Finally, our results show the good performance of our exact method for a set of auction contexts we simulate.

在运输服务采购的组合拍卖中，每个承运人必须确定一组可竞标的有利可图的合同以及相关的要价。这就是所谓的投标施工问题（BCP）。考虑到其他竞争承运人报价的不确定性，我们的论文针对的是随机清算价格的BCP。合同的选择和定价决策被集成以生成多个组合投标。我们的论文是首次提出一种精确的非枚举方法来解决该NP-Hard问题。我们的计算结果表明，可以在多达50个合同的实例上获得最佳解决方案。我们还提出了一种混合启发式算法，该算法可在运行时间的一小部分时间内产生大多数这些最佳解决方案，并为其余实例提供具有竞争力的解决方案。最后，