...
首页> 外文期刊>Transportation Research Part B: Methodological >Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions
【24h】

Exact and hybrid heuristic methods to solve the combinatorial bid construction problem with stochastic prices in truckload transportation services procurement auctions

机译:在卡车运输服务采购拍卖中,解决了与随机价格解决组合竞标施工问题的精确和混合的启发式方法

获取原文
获取原文并翻译 | 示例
           

摘要

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 & rsquo; offers. Contracts & rsquo; 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.& nbsp; (c) 2021 Elsevier Ltd. All rights reserved.
机译:在用于采购运输服务的组合拍卖中,每个承运人必须确定竞标和相关的卖出价格的盈利合同集。这被称为出价施工问题(BCP)。我们的论文通过随机清算价格讨论了一个BCP,考虑到其他竞争对手和rsquo的不确定性;优惠。合同’集成的选择和定价决策以生成多个组合出价。我们的论文是第一个提出精确的非议症方法来解决这个NP难题的方法。我们的计算结果表明,可以在最多50个合同的情况下获得最佳解决方案。我们还提出了一种混合启发式,在运行时的一小部分中产生大部分最佳解决方案,并为其剩余实例提供竞争解决方案。最后,我们的结果表明我们模拟了一组拍卖背景的精确方法的良好表现。  (c)2021 elestvier有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号