Properties of bundle valuations in carrier collaboration.

IF 1.4 4区 管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Rudolf Vetschera, Dmitriy Knyazev, Daniel Rehsmann
{"title":"Properties of bundle valuations in carrier collaboration.","authors":"Rudolf Vetschera, Dmitriy Knyazev, Daniel Rehsmann","doi":"10.1007/s10100-023-00873-1","DOIUrl":null,"url":null,"abstract":"<p><p>Combinatorial auctions are an important part of many frameworks for carrier collaboration in logistics. In the last years, many innovative auction mechanisms have been developed in the economic literature that could potentially be applied in this context and that could significantly simplify the process of determining efficient allocations of requests. These mechanisms rely on certain assumptions about the valuations of bidders. In this paper, we perform computational experiments to analyze to which extent these requirements are fulfilled for valuations derived from a simple logistics problem, the Traveling Salesman Problem. We find that bidders' valuations typically violate even very elementary requirements, but that these violations affect only a limited number of request bundles. We further analyze whether these violations exhibit a consistent pattern across multiple carriers and check consistency if route lengths are calculated exactly or approximated.</p><p><strong>Supplementary information: </strong>The online version contains supplementary material available at 10.1007/s10100-023-00873-1.</p>","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"1 1","pages":"241-266"},"PeriodicalIF":1.4000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11032298/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Central European Journal of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1007/s10100-023-00873-1","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/7/26 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Combinatorial auctions are an important part of many frameworks for carrier collaboration in logistics. In the last years, many innovative auction mechanisms have been developed in the economic literature that could potentially be applied in this context and that could significantly simplify the process of determining efficient allocations of requests. These mechanisms rely on certain assumptions about the valuations of bidders. In this paper, we perform computational experiments to analyze to which extent these requirements are fulfilled for valuations derived from a simple logistics problem, the Traveling Salesman Problem. We find that bidders' valuations typically violate even very elementary requirements, but that these violations affect only a limited number of request bundles. We further analyze whether these violations exhibit a consistent pattern across multiple carriers and check consistency if route lengths are calculated exactly or approximated.

Supplementary information: The online version contains supplementary material available at 10.1007/s10100-023-00873-1.

运营商协作中捆绑估值的性质
组合拍卖是许多物流承运商协作框架的重要组成部分。过去几年中,经济学文献中提出了许多创新的拍卖机制,这些机制有可能应用于这一领域,并能大大简化确定有效分配请求的过程。这些机制依赖于对投标人估值的某些假设。在本文中,我们进行了计算实验,分析从简单的物流问题--旅行推销员问题--中得出的估值在多大程度上满足了这些要求。我们发现,投标人的估值通常甚至会违反非常基本的要求,但这些违规行为只影响有限数量的请求捆绑。我们进一步分析了这些违规行为在多个承运人之间是否表现出一致的模式,并检查了路线长度是精确计算还是近似计算的一致性:在线版本包含补充材料,可查阅 10.1007/s10100-023-00873-1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Central European Journal of Operations Research
Central European Journal of Operations Research 管理科学-运筹学与管理科学
CiteScore
4.70
自引率
11.80%
发文量
30
审稿时长
3 months
期刊介绍: The Central European Journal of Operations Research provides an international readership with high quality papers that cover the theory and practice of OR and the relationship of OR methods to modern quantitative economics and business administration. The focus is on topics such as: - finance and banking - measuring productivity and efficiency in the public sector - environmental and energy issues - computational tools for strategic decision support - production management and logistics - planning and scheduling The journal publishes theoretical papers as well as application-oriented contributions and practical case studies. Occasionally, special issues feature a particular area of OR or report on the results of scientific meetings.
×
引用
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学术官方微信