基于遗传算法的电视广告调度

Kateryna Czerniachowska
{"title":"基于遗传算法的电视广告调度","authors":"Kateryna Czerniachowska","doi":"10.1504/EJIE.2019.097926","DOIUrl":null,"url":null,"abstract":"Television advertising is vital to the television industry and is one of the most popular ways for advertisers to increase sales. This paper discusses the problem of scheduling TV advertisements according to each advertisers' need and budget limitations, with the objective of maximising total viewership. The proposed solution is the genetic algorithm, and its efficiency has been evaluated using list and random-list algorithms during long (one month) and short (one week) advertising campaign periods. Computational results show that this algorithm can obtain satisfactory results for real-world test problems, based on data from a marketing research company. [Received: 30 November 2017; Revised: 14 April 2018; Revised: 15 September 2018; Revised: 20 September 2018; Accepted: 22 September 2018]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scheduling TV advertisements via genetic algorithm\",\"authors\":\"Kateryna Czerniachowska\",\"doi\":\"10.1504/EJIE.2019.097926\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Television advertising is vital to the television industry and is one of the most popular ways for advertisers to increase sales. This paper discusses the problem of scheduling TV advertisements according to each advertisers' need and budget limitations, with the objective of maximising total viewership. The proposed solution is the genetic algorithm, and its efficiency has been evaluated using list and random-list algorithms during long (one month) and short (one week) advertising campaign periods. Computational results show that this algorithm can obtain satisfactory results for real-world test problems, based on data from a marketing research company. [Received: 30 November 2017; Revised: 14 April 2018; Revised: 15 September 2018; Revised: 20 September 2018; Accepted: 22 September 2018]\",\"PeriodicalId\":314867,\"journal\":{\"name\":\"European J. of Industrial Engineering\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European J. of Industrial Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/EJIE.2019.097926\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European J. of Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/EJIE.2019.097926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

电视广告对电视行业至关重要,是广告商增加销售的最受欢迎的方式之一。本文讨论了以总收视率最大化为目标,根据每个广告主的需求和预算限制来安排电视广告的问题。提出的解决方案是遗传算法,并使用列表和随机列表算法在长(一个月)和短(一周)广告活动期间对其效率进行了评估。计算结果表明,该算法在实际测试问题中可以获得满意的结果,基于某市场研究公司的数据。[收稿日期:2017年11月30日;修订日期:2018年4月14日;修订日期:2018年9月15日;修订日期:2018年9月20日;录用日期:2018年9月22日]
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling TV advertisements via genetic algorithm
Television advertising is vital to the television industry and is one of the most popular ways for advertisers to increase sales. This paper discusses the problem of scheduling TV advertisements according to each advertisers' need and budget limitations, with the objective of maximising total viewership. The proposed solution is the genetic algorithm, and its efficiency has been evaluated using list and random-list algorithms during long (one month) and short (one week) advertising campaign periods. Computational results show that this algorithm can obtain satisfactory results for real-world test problems, based on data from a marketing research company. [Received: 30 November 2017; Revised: 14 April 2018; Revised: 15 September 2018; Revised: 20 September 2018; Accepted: 22 September 2018]
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信