在收入管理中,将资源放在单线上的动态模型

Yu Ogasawara
{"title":"在收入管理中,将资源放在单线上的动态模型","authors":"Yu Ogasawara","doi":"10.15807/JORSJ.60.91","DOIUrl":null,"url":null,"abstract":"Recently, a seating position can be often selected when a plane or bullet train ticket is reserved. Specially, for theater and stadium, it is important to decide how to assign reservations to seats. This paper proposes a dynamic model where seats’ resources are located at a single line with considering seats position that have already been assigned. An analysis has been conducted and the results show that, 1) optimal policy for an arriving request is to allocate it to one side of the edges of the adjacent vacancies, 2) if all of the resources are vacant at beginning time for booking, then the model corresponds to a single-leg model with multiple seat bookings and single fare class in Lee and Hersh (1993), 3) it is not necessarily optimal that a request is allocated to the less adjacent seats’ vacancy. Finally, this paper proposes an algorithm to solve the optimal policy using above results and conducts numerical examples.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.60.91","citationCount":"2","resultStr":"{\"title\":\"A DYNAMIC MODEL WITH RESOURCES PLACED ON SINGLE LINE IN REVENUE MANAGEMENT\",\"authors\":\"Yu Ogasawara\",\"doi\":\"10.15807/JORSJ.60.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, a seating position can be often selected when a plane or bullet train ticket is reserved. Specially, for theater and stadium, it is important to decide how to assign reservations to seats. This paper proposes a dynamic model where seats’ resources are located at a single line with considering seats position that have already been assigned. An analysis has been conducted and the results show that, 1) optimal policy for an arriving request is to allocate it to one side of the edges of the adjacent vacancies, 2) if all of the resources are vacant at beginning time for booking, then the model corresponds to a single-leg model with multiple seat bookings and single fare class in Lee and Hersh (1993), 3) it is not necessarily optimal that a request is allocated to the less adjacent seats’ vacancy. Finally, this paper proposes an algorithm to solve the optimal policy using above results and conducts numerical examples.\",\"PeriodicalId\":51107,\"journal\":{\"name\":\"Journal of the Operations Research Society of Japan\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.15807/JORSJ.60.91\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Operations Research Society of Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15807/JORSJ.60.91\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/JORSJ.60.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 2

摘要

最近,当预订飞机票或子弹头列车票时,经常可以选择座位。特别是,对于剧院和体育场来说,决定如何分配座位预订是很重要的。本文提出了一个动态模型,其中座位资源位于一条线上,并考虑了已经分配的座位位置。已经进行了分析,结果表明,1)到达请求的最优策略是将其分配到相邻空位的边缘的一侧,2)如果在预订开始时所有资源都是空位,则该模型对应于Lee和Hersh(1993)中的具有多个座位预订和单票价等级的单腿模型,3)将请求分配给相邻席位较少的空缺并不一定是最优的。最后,本文利用上述结果提出了一种求解最优策略的算法,并进行了数值算例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A DYNAMIC MODEL WITH RESOURCES PLACED ON SINGLE LINE IN REVENUE MANAGEMENT
Recently, a seating position can be often selected when a plane or bullet train ticket is reserved. Specially, for theater and stadium, it is important to decide how to assign reservations to seats. This paper proposes a dynamic model where seats’ resources are located at a single line with considering seats position that have already been assigned. An analysis has been conducted and the results show that, 1) optimal policy for an arriving request is to allocate it to one side of the edges of the adjacent vacancies, 2) if all of the resources are vacant at beginning time for booking, then the model corresponds to a single-leg model with multiple seat bookings and single fare class in Lee and Hersh (1993), 3) it is not necessarily optimal that a request is allocated to the less adjacent seats’ vacancy. Finally, this paper proposes an algorithm to solve the optimal policy using above results and conducts numerical examples.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of the Operations Research Society of Japan
Journal of the Operations Research Society of Japan 管理科学-运筹学与管理科学
CiteScore
0.70
自引率
0.00%
发文量
12
审稿时长
12 months
期刊介绍: The journal publishes original work and quality reviews in the field of operations research and management science to OR practitioners and researchers in two substantive categories: operations research methods; applications and practices of operations research in industry, public sector, and all areas of science and engineering.
期刊最新文献
IMPLEMENTING ARROW–DEBREU EQUILIBRIA IN APPROXIMATELY COMPLETE SECURITY MARKETS A RIEMANNIAN-GEOMETRICAL APPROACH TO STRICTLY CONVEX QUADRATIC PROGRAMMING WITH CONVEXITY-PRESERVING METRIC PARAMETERIZATION A SUBGEOMETRIC CONVERGENCE FORMULA FOR TOTAL-VARIATION ERROR OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS MIXED-INTEGER DC PROGRAMMING BASED ALGORITHMS FOR THE CIRCULAR PACKING PROBLEM A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM
×
引用
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