组合拍卖运输采购中的快速协同逼近

M. E. Keskin, C. Triki, Adel Elomri
{"title":"组合拍卖运输采购中的快速协同逼近","authors":"M. E. Keskin, C. Triki, Adel Elomri","doi":"10.1051/ro/2023022","DOIUrl":null,"url":null,"abstract":"In this study we develop a decision support tool to help carriers in defining their bids when participating in transportation combinatorial auctions. In this way, they can avoid many of their empty movements and ensure additional business through the spot market. We propose four algorithms that quantify the synergy as a key concept to measure the complementarity between the carrier’s existing network and the contracts to be included in the bundle to be submitted as a bid. The algorithms are validated on a real-life application and our results emphasized their superiority with respect to previous studies.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast synergy approximation in transportation procurement with combinatorial auctions\",\"authors\":\"M. E. Keskin, C. Triki, Adel Elomri\",\"doi\":\"10.1051/ro/2023022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study we develop a decision support tool to help carriers in defining their bids when participating in transportation combinatorial auctions. In this way, they can avoid many of their empty movements and ensure additional business through the spot market. We propose four algorithms that quantify the synergy as a key concept to measure the complementarity between the carrier’s existing network and the contracts to be included in the bundle to be submitted as a bid. The algorithms are validated on a real-life application and our results emphasized their superiority with respect to previous studies.\",\"PeriodicalId\":20872,\"journal\":{\"name\":\"RAIRO Oper. Res.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2023022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本研究中,我们开发了一个决策支持工具,以帮助承运人在参与运输组合拍卖时确定其出价。通过这种方式,它们可以避免许多空仓交易,并通过现货市场确保额外的业务。我们提出了四种算法,将协同效应作为一个关键概念来量化,以衡量运营商现有网络与作为投标提交的捆绑包中包含的合同之间的互补性。这些算法在实际应用中得到了验证,我们的结果强调了它们相对于以往研究的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast synergy approximation in transportation procurement with combinatorial auctions
In this study we develop a decision support tool to help carriers in defining their bids when participating in transportation combinatorial auctions. In this way, they can avoid many of their empty movements and ensure additional business through the spot market. We propose four algorithms that quantify the synergy as a key concept to measure the complementarity between the carrier’s existing network and the contracts to be included in the bundle to be submitted as a bid. The algorithms are validated on a real-life application and our results emphasized their superiority with respect to previous studies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信