基于近似动态规划算法的生命周期阶段、BCG矩阵类、竞争者反应和预算约束的多产品媒体广告策划

IF 0.6 Q4 ENGINEERING, INDUSTRIAL
Majid Khalilzadeh, Hossein Neghabi
{"title":"基于近似动态规划算法的生命周期阶段、BCG矩阵类、竞争者反应和预算约束的多产品媒体广告策划","authors":"Majid Khalilzadeh, Hossein Neghabi","doi":"10.24200/J65.2020.54496.2054","DOIUrl":null,"url":null,"abstract":"In the new competitive world, companies several types of tools and strategies are used to differentiate their products with competitors' product, one of which is promotional. Companies spend a large amount of their promotional budget on advertising. For increase the effectiveness of advertising budgeting, media planning must be properly developed and determine the manner allocation advertising over a company's programming horizon. In this paper, investigates advertising media planning and budgeting for several products. Important aspects including life cycle stage, BCG matrix class, price, competitors’ reaction and budget constraint is considered in our model given uncertainty and with the aim of maximizing profits at the end of the time horizon. We formulate this problem as a stochastic dynamic program and utilized approximate dynamic programming (ADP) algorithm to overcome the huge dimensionality and considerable uncertainties existed in our problem. approximate Dynamic Planning (ADP) is a powerful technique for solving discrete time problems under multistage stochastic control processes. \n A numerical example was carried out on two products over the course of one year (12 monthly periods) with five different advertising packages. The results showed that 5 million iterations would be suitable to converging. Remaining budget analysis shows the percentage of selective offensive packages in higher budgets for product 2 and the more often selection of such packages in midterms for product 1. The process of the life cycle shows that product 1 does not most likely complete its life stages, but product 2 completes its life cycle stages. Moreover, the BCG matrix confirms the results and product 2 is in the final stages of dogs, while product 1 is more likely in Cash Cows. Also, the total budget was examined in different quantities, which showed that as the amount of the budget increased, the target amount increased slowly. The presented model offers the opportunity to managers by which they are able to compare different media for making advertising decisions for various products in an uncertain environment with different budgets.","PeriodicalId":45245,"journal":{"name":"Industrial Engineering and Management Systems","volume":"94 1","pages":"0-0"},"PeriodicalIF":0.6000,"publicationDate":"2022-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi Product Media Advertising Planning Considering Life Cycle Stage, BCG Matrix Class, Competitors’ Reaction and Budget Constraint using Approximate Dynamic Programming Algorithm\",\"authors\":\"Majid Khalilzadeh, Hossein Neghabi\",\"doi\":\"10.24200/J65.2020.54496.2054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the new competitive world, companies several types of tools and strategies are used to differentiate their products with competitors' product, one of which is promotional. Companies spend a large amount of their promotional budget on advertising. For increase the effectiveness of advertising budgeting, media planning must be properly developed and determine the manner allocation advertising over a company's programming horizon. In this paper, investigates advertising media planning and budgeting for several products. Important aspects including life cycle stage, BCG matrix class, price, competitors’ reaction and budget constraint is considered in our model given uncertainty and with the aim of maximizing profits at the end of the time horizon. We formulate this problem as a stochastic dynamic program and utilized approximate dynamic programming (ADP) algorithm to overcome the huge dimensionality and considerable uncertainties existed in our problem. approximate Dynamic Planning (ADP) is a powerful technique for solving discrete time problems under multistage stochastic control processes. \\n A numerical example was carried out on two products over the course of one year (12 monthly periods) with five different advertising packages. The results showed that 5 million iterations would be suitable to converging. Remaining budget analysis shows the percentage of selective offensive packages in higher budgets for product 2 and the more often selection of such packages in midterms for product 1. The process of the life cycle shows that product 1 does not most likely complete its life stages, but product 2 completes its life cycle stages. Moreover, the BCG matrix confirms the results and product 2 is in the final stages of dogs, while product 1 is more likely in Cash Cows. Also, the total budget was examined in different quantities, which showed that as the amount of the budget increased, the target amount increased slowly. The presented model offers the opportunity to managers by which they are able to compare different media for making advertising decisions for various products in an uncertain environment with different budgets.\",\"PeriodicalId\":45245,\"journal\":{\"name\":\"Industrial Engineering and Management Systems\",\"volume\":\"94 1\",\"pages\":\"0-0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Industrial Engineering and Management Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24200/J65.2020.54496.2054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Industrial Engineering and Management Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24200/J65.2020.54496.2054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

摘要

在新的竞争世界中,公司使用几种类型的工具和策略来区分自己的产品与竞争对手的产品,其中之一是促销。公司在广告上花费了大量的促销预算。为了提高广告预算的有效性,必须适当地制定媒体计划,并确定在公司的节目范围内分配广告的方式。本文对几种产品的广告媒体策划与预算进行了研究。在我们的模型中考虑了生命周期阶段、BCG矩阵类、价格、竞争对手的反应和预算约束等重要方面,考虑了不确定性,并以在时间范围结束时最大化利润为目标。我们将该问题表述为随机动态规划,并利用近似动态规划(ADP)算法克服了该问题存在的巨大维数和相当大的不确定性。近似动态规划(ADP)是求解多阶段随机控制过程下离散时间问题的一种有效方法。在一年(12个月)的时间里,用五种不同的广告包装对两种产品进行了数值模拟。结果表明,500万次迭代比较适合收敛。剩余的预算分析显示了产品2的较高预算中选择性进攻包的百分比,以及产品1的中期更经常选择这种包。生命周期的过程表明,产品1很可能没有完成它的生命阶段,但产品2完成了它的生命周期阶段。而且,BCG矩阵证实了结果,产品2处于狗的最后阶段,而产品1更有可能在现金牛。同时,对总预算进行了不同数量的考察,结果表明,随着预算金额的增加,目标金额增长缓慢。所提出的模型为管理者提供了一个机会,通过这个机会,他们能够比较不同的媒体,以便在不同预算的不确定环境中为各种产品做出广告决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi Product Media Advertising Planning Considering Life Cycle Stage, BCG Matrix Class, Competitors’ Reaction and Budget Constraint using Approximate Dynamic Programming Algorithm
In the new competitive world, companies several types of tools and strategies are used to differentiate their products with competitors' product, one of which is promotional. Companies spend a large amount of their promotional budget on advertising. For increase the effectiveness of advertising budgeting, media planning must be properly developed and determine the manner allocation advertising over a company's programming horizon. In this paper, investigates advertising media planning and budgeting for several products. Important aspects including life cycle stage, BCG matrix class, price, competitors’ reaction and budget constraint is considered in our model given uncertainty and with the aim of maximizing profits at the end of the time horizon. We formulate this problem as a stochastic dynamic program and utilized approximate dynamic programming (ADP) algorithm to overcome the huge dimensionality and considerable uncertainties existed in our problem. approximate Dynamic Planning (ADP) is a powerful technique for solving discrete time problems under multistage stochastic control processes. A numerical example was carried out on two products over the course of one year (12 monthly periods) with five different advertising packages. The results showed that 5 million iterations would be suitable to converging. Remaining budget analysis shows the percentage of selective offensive packages in higher budgets for product 2 and the more often selection of such packages in midterms for product 1. The process of the life cycle shows that product 1 does not most likely complete its life stages, but product 2 completes its life cycle stages. Moreover, the BCG matrix confirms the results and product 2 is in the final stages of dogs, while product 1 is more likely in Cash Cows. Also, the total budget was examined in different quantities, which showed that as the amount of the budget increased, the target amount increased slowly. The presented model offers the opportunity to managers by which they are able to compare different media for making advertising decisions for various products in an uncertain environment with different budgets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.20
自引率
28.60%
发文量
45
期刊介绍: Industrial Engineering and Management Systems (IEMS) covers all areas of industrial engineering and management sciences including but not limited to, applied statistics & data mining, business & information systems, computational intelligence & optimization, environment & energy, ergonomics & human factors, logistics & transportation, manufacturing systems, planning & scheduling, quality & reliability, supply chain management & inventory systems.
×
引用
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学术官方微信