A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, Thays Aparecida de-
Autor(es): dc.creatorCoelho, Vitor Nazário-
Autor(es): dc.creatorRamalhinho, Helena-
Autor(es): dc.creatorSouza, Marcone Jamilson Freitas-
Autor(es): dc.creatorCoelho, Bruno Nazário-
Autor(es): dc.creatorRezende, Daniel C.-
Autor(es): dc.creatorCoelho, Igor Machado-
Data de aceite: dc.date.accessioned2025-08-21T15:05:26Z-
Data de disponibilização: dc.date.available2025-08-21T15:05:26Z-
Data de envio: dc.date.issued2018-01-30-
Data de envio: dc.date.issued2018-01-30-
Data de envio: dc.date.issued2017-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/9369-
Fonte completa do material: dc.identifierhttp://www.sciencedirect.com/science/article/pii/S1571065317300392-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.endm.2017.03.003-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1002234-
Descrição: dc.descriptionThis paper focuses on Book Marketing Campaigns, where the benefit of offering each book is calculated based on a bipartite graph (biclique). A quasi Biclique problem is assessed for obtaining the probabilities of success of a given client buy a given book, considering it had received another book as free offer. The remaining optimization decision problem can be solved following the Targeted Offers Problem in Direct Marketing Campaigns. The main objective is to maximize the feedback of customers purchases, offering books to the set of customers with the highest probability of buying others ones from its biclique and, at the same time, minimizing campaign operational costs. Given the combinatorial nature of the problem and the large volume of data, which can involve real cases with up to one million customers, metaheuristics procedures have been used as an efficient way for solving it. Here, a hybrid trajectory search based algorithm, namely GGVNS, which combines the Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search, is used. The strategy for generating the quasi Biclique problem is described and a new instance generator for the TOPDMC is introduced. Computational results regarding the GGVNS algorithm shows it is able to find useful and profitable sets of clients.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectBooks marketing-
Palavras-chave: dc.subjectCampaigns-
Palavras-chave: dc.subjectTargeted offers problem-
Palavras-chave: dc.subjectOperational Research-
Título: dc.titleA VNS approach for book marketing campaigns generated with quasi-bicliques probabilities.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.