• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Computational logistics >Combinatorial Auctions in Freight Logistics
【24h】

Combinatorial Auctions in Freight Logistics

机译：货运物流中的组合拍卖

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Freight business is a huge market with strong competition. In many companies, planning and routing software has been introduced, and optimization potentials have been widely exploited. To further im prove efficiency, especially the small and medium sized carriers have to cooperate beyond enterprise boundaries. A promising approach to ex change transportation requests between freight carriers is provided by combinatorial auctions and exchanges. They allow bundles of items to be traded, thereby allowing participants to express complex synergies. In this paper we discuss various goals for a combinatorial request exchange in freight logistics and provide the reasoning for our design decisions. All goals aim to improve usefulness in a practical environment of less-than-truckload (LTL) carriers. We provide experimental results for both generated and real-life data that show significant savings and are often close to a heuristic solution for the global optimization problem. We study how bundling and restricting the number of submitted bids affect the solution quality.
机译：货运业务是一个竞争激烈的巨大市场。在许多公司中，已经引入了计划和路由软件，并且已广泛开发了优化潜力。为了进一步提高效率，尤其是中小型运营商必须超越企业边界进行合作。组合拍卖和交易交换提供了一种在货运承运人之间交换运输要求的有前途的方法。它们允许一捆物品进行交易，从而使参与者能够表达复杂的协同作用。在本文中，我们讨论了货运物流中组合请求交换的各种目标，并为我们的设计决策提供了理由。所有目标均旨在提高在小于卡车（LTL）载具的实际环境中的实用性。我们为生成的数据和实际数据提供实验结果，这些结果显示出显着的节省，并且通常接近于针对全局优化问题的启发式解决方案。我们研究捆绑和限制提交的投标数量如何影响解决方案质量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号