• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Intelligent Transportation Systems >Combinatorial Auction for Truckload Transportation Service Procurement with Auctioneer-Generated Supplementary Bundles of Requests
【24h】

Combinatorial Auction for Truckload Transportation Service Procurement with Auctioneer-Generated Supplementary Bundles of Requests

机译：Clowload运输服务采购的组合拍卖与拍卖的辅助请求捆绑

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Shippers usually procure transportation services from carriers via combinatorial auctions to reduce costs and improve service levels. Compared with single-round sealed bid auctions, multi-round auctions can reduce the revelation of confidential cost information of the carriers. In this paper, a two-phase multi-round combinatorial auction mechanism is proposed for truckload transportation service procurement, in which each transportation request is represented by a lane. The first phase is a combinatorial clock auction, which is terminated when the prices of the lanes are raised high enough such that each lane is bid by at least one carrier. In the second phase, the auctioneer provides some supplementary bundles of requests open for bid and adjusts the prices of the bundles, and each carrier decides whether to bid for some of the bundles in addition to its bids submitted in the first phase. Computational results show that the proposed mechanism can achieve an optimal or a near-optimal allocation of the requests to the carriers in terms of social efficiency.
机译：托运人通常通过组合拍卖来从运营商采购运输服务，以降低成本并提高服务水平。与单圆密封的投标拍卖相比，多轮拍卖可以减少载体的机密成本信息的启示。本文提出了一种两相多轮组合拍卖机构，用于卡车运输服务采购，其中每个运输请求由车道表示。第一阶段是组合时钟拍卖，当轿厢的价格升高时终止，使得每个车道由至少一个载波出价。在第二阶段，拍卖师提供一些补充捆绑的请求，以便开放，并调整捆绑的价格，并且每个承运人除了在第一阶段提交的出价外，还要竞标一些捆绑包。计算结果表明，在社会效率方面，该机制可以实现最佳或近最优的对运营商的请求分配。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号