何时公布有界理性顾客的排队信息:基于离散事件的模拟模型

Tao Dai, Mingyu Yu, Yong Wu
{"title":"何时公布有界理性顾客的排队信息:基于离散事件的模拟模型","authors":"Tao Dai, Mingyu Yu, Yong Wu","doi":"10.1177/00375497241236968","DOIUrl":null,"url":null,"abstract":"In queueing systems where queues are invisible, it is critical for companies to make decisions about the timing of announcing the anticipated delay to customers. In this paper, a simulation model is built to simulate an invisible queueing system, and several queueing scenarios are considered, including different system congestion and different company goals, to explore the impact of different announcement timings. In the modeling of customer behavior, we argue that it is difficult for companies to announce perfectly accurate delay and rarely have customers fully trust the announcement, so the quantal-response model is included to model customers’ probabilistic choice behavior due to the bounded rationality. Meanwhile, we consider customer heterogeneity, assign customers different initial patience and, as an extension, also assume that patience will be updated. We perform simulation experiments and analyze the experimental data to dissect the underlying reasons, and then give sound management suggestions. The experiments show that the optimal announcement timing is different for different scenarios, which shows that in practical decisions, companies should adopt different announcement strategies for different scenarios. What’s more, in some scenarios, delayed announcement at specific time is better than on-arrival announcement, which suggests that when we judge the value of announcement, we should add the definite word of specific timing to the announcement. The breakthrough point of this paper is to consider customers’ bounded rationality and the dynamic patience; meanwhile, it fills the gap of announcement timing research and explores the value of additional announcements after the initial announcement.","PeriodicalId":501452,"journal":{"name":"SIMULATION","volume":"204 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"When to announce the queueing information for bounded rationality customers: a discrete-event–based simulation model\",\"authors\":\"Tao Dai, Mingyu Yu, Yong Wu\",\"doi\":\"10.1177/00375497241236968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In queueing systems where queues are invisible, it is critical for companies to make decisions about the timing of announcing the anticipated delay to customers. In this paper, a simulation model is built to simulate an invisible queueing system, and several queueing scenarios are considered, including different system congestion and different company goals, to explore the impact of different announcement timings. In the modeling of customer behavior, we argue that it is difficult for companies to announce perfectly accurate delay and rarely have customers fully trust the announcement, so the quantal-response model is included to model customers’ probabilistic choice behavior due to the bounded rationality. Meanwhile, we consider customer heterogeneity, assign customers different initial patience and, as an extension, also assume that patience will be updated. We perform simulation experiments and analyze the experimental data to dissect the underlying reasons, and then give sound management suggestions. The experiments show that the optimal announcement timing is different for different scenarios, which shows that in practical decisions, companies should adopt different announcement strategies for different scenarios. What’s more, in some scenarios, delayed announcement at specific time is better than on-arrival announcement, which suggests that when we judge the value of announcement, we should add the definite word of specific timing to the announcement. The breakthrough point of this paper is to consider customers’ bounded rationality and the dynamic patience; meanwhile, it fills the gap of announcement timing research and explores the value of additional announcements after the initial announcement.\",\"PeriodicalId\":501452,\"journal\":{\"name\":\"SIMULATION\",\"volume\":\"204 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIMULATION\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1177/00375497241236968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIMULATION","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1177/00375497241236968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在队列不可见的排队系统中,对公司来说,决定向客户宣布预期延迟的时间至关重要。本文建立了一个模拟无形排队系统的仿真模型,并考虑了几种排队场景,包括不同的系统拥堵情况和不同的公司目标,以探讨不同的公告时机的影响。在客户行为建模方面,我们认为公司很难完全准确地公布延迟时间,客户也很少会完全信任公司的公告,因此我们加入了量子响应模型来模拟客户由于有界理性而产生的概率选择行为。同时,我们考虑了客户的异质性,为客户分配了不同的初始耐心,作为扩展,我们还假设耐心会更新。我们进行了模拟实验,并对实验数据进行分析,剖析其背后的原因,进而给出合理的管理建议。实验结果表明,不同情景下的最佳公告时机是不同的,这说明在实际决策中,企业应针对不同情景采取不同的公告策略。更重要的是,在某些情景下,特定时间的延迟公告优于即时公告,这表明我们在判断公告的价值时,应在公告中加入特定时间的定语。本文的突破点在于考虑了客户的有界理性和动态耐心,同时填补了公告时机研究的空白,并探讨了首次公告后附加公告的价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
When to announce the queueing information for bounded rationality customers: a discrete-event–based simulation model
In queueing systems where queues are invisible, it is critical for companies to make decisions about the timing of announcing the anticipated delay to customers. In this paper, a simulation model is built to simulate an invisible queueing system, and several queueing scenarios are considered, including different system congestion and different company goals, to explore the impact of different announcement timings. In the modeling of customer behavior, we argue that it is difficult for companies to announce perfectly accurate delay and rarely have customers fully trust the announcement, so the quantal-response model is included to model customers’ probabilistic choice behavior due to the bounded rationality. Meanwhile, we consider customer heterogeneity, assign customers different initial patience and, as an extension, also assume that patience will be updated. We perform simulation experiments and analyze the experimental data to dissect the underlying reasons, and then give sound management suggestions. The experiments show that the optimal announcement timing is different for different scenarios, which shows that in practical decisions, companies should adopt different announcement strategies for different scenarios. What’s more, in some scenarios, delayed announcement at specific time is better than on-arrival announcement, which suggests that when we judge the value of announcement, we should add the definite word of specific timing to the announcement. The breakthrough point of this paper is to consider customers’ bounded rationality and the dynamic patience; meanwhile, it fills the gap of announcement timing research and explores the value of additional announcements after the initial announcement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Simulating cyberattacks with extended Petri nets Special Issue: Engineering of Dependable Digital Twins Calibration method for microscopic traffic simulation considering lane difference Serial and parallel algorithms for short time horizon multi-attribute queries on stochastic multi-agent systems Agent-based simulation of citizens’ satisfaction in smart cities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1