Air cargo simultaneous weight and volume capacity planning with revenue management approach

IF 0.3 Q4 MANAGEMENT
Mohammad Vardi, A. Ghorbanian
{"title":"Air cargo simultaneous weight and volume capacity planning with revenue management approach","authors":"Mohammad Vardi, A. Ghorbanian","doi":"10.1504/IJAMS.2018.10015874","DOIUrl":null,"url":null,"abstract":"Revenue management (RM) is a subfield of operations research with the aim to maximise the revenues acquired by selling perishable products/services. Due to the substantial growth in air cargo industry over the past few years, sophisticated techniques are needed to maximise revenue. In this paper, airline cargo capacity allocation problem in two cases, including cancellation possibility and impossibility have been investigated. Two capacity dimensions of the problem, volume and weight, is complicated the decision making about request acceptance policy. For the formulation of two problems, dynamic programming technique has been used. Since dynamic programming suffers from much memory consumption for large size problems, three heuristics including deterministic integer linear programming (DILP), bid price (BP) and dynamic programming decomposition (DPD) has been proposed for problems solving. Results of simulation showed that BP and DILP have the better performance comparing to other approaches. In addition, comparison of two problem's optimum values indicated that considering cancellation increase total revenue more than 10%.","PeriodicalId":38716,"journal":{"name":"International Journal of Applied Management Science","volume":"10 1","pages":"319-337"},"PeriodicalIF":0.3000,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Management Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAMS.2018.10015874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

Revenue management (RM) is a subfield of operations research with the aim to maximise the revenues acquired by selling perishable products/services. Due to the substantial growth in air cargo industry over the past few years, sophisticated techniques are needed to maximise revenue. In this paper, airline cargo capacity allocation problem in two cases, including cancellation possibility and impossibility have been investigated. Two capacity dimensions of the problem, volume and weight, is complicated the decision making about request acceptance policy. For the formulation of two problems, dynamic programming technique has been used. Since dynamic programming suffers from much memory consumption for large size problems, three heuristics including deterministic integer linear programming (DILP), bid price (BP) and dynamic programming decomposition (DPD) has been proposed for problems solving. Results of simulation showed that BP and DILP have the better performance comparing to other approaches. In addition, comparison of two problem's optimum values indicated that considering cancellation increase total revenue more than 10%.
航空货运同时重量和容量规划与收益管理方法
收入管理(RM)是运营研究的一个子领域,旨在最大限度地提高通过销售易腐产品/服务获得的收入。由于过去几年航空货运业的大幅增长,需要先进的技术来最大限度地提高收入。本文研究了两种情况下的航空货运能力分配问题,包括取消可能性和不可能性。问题的两个容量维度,体积和重量,使请求接受策略的决策变得复杂。对于这两个问题的公式化,使用了动态规划技术。由于动态规划在大尺寸问题中会消耗大量内存,因此提出了三种启发式方法来解决问题,包括确定性整数线性规划(DILP)、投标价格(BP)和动态规划分解(DPD)。仿真结果表明,与其他方法相比,BP和DILP具有更好的性能。此外,两个问题的最优值的比较表明,考虑取消可使总收入增加10%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Applied Management Science
International Journal of Applied Management Science Business, Management and Accounting-Strategy and Management
CiteScore
1.20
自引率
0.00%
发文量
21
×
引用
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学术官方微信