A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
Outros Autores: | , |
Tipo de documento: | Livro |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | https://repositorio-aberto.up.pt/handle/10216/70367 |
Resumo: | We propose a Hybrid Genetic Algorithm (HGA) for a combinatorial optimization problem, motivated by, and a simplification of, a TV Self-promotion Assignment Problem. Given the weekly self-promotion space (a set of TV breaks with known duration) and a set of products to promote, the problem consists of assigning the products to the breaks in the "best" possible way. The objective is to maximize contacts in the target audience for each product, whist satisfying all constraints. The HGA developed incorporates a greedy heuristic to initialize part of the population and uses a repair routine to guarantee feasibility of each member of the population. The HGA works on a simplified version of the problem that, nevertheless, maintains its essential features. The proposed simplified problem is a binary programming problem that has similarities with other known combinatorial optimization problems, such as the assignment problem or the multiple knapsack problem, but has some distinctive features that characterize it as a new problem. Although we are mainly interested in solving problems of large dimension (of about 200 breaks and 50 spots), the quality of the solution has been tested on smaller dimension problems for which we are able to find an exact global minimum using a branch-and-bound algorithm. For these smaller dimension problems we have obtained solutions, on average, within 1% of the optimal solution value. |
id |
RCAP_8227007b5c5112a76415ae9f81131a5e |
---|---|
oai_identifier_str |
oai:repositorio-aberto.up.pt:10216/70367 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning ProblemsEngenharia electrotécnica, Economia e gestãoElectrical engineering, Economics and BusinessWe propose a Hybrid Genetic Algorithm (HGA) for a combinatorial optimization problem, motivated by, and a simplification of, a TV Self-promotion Assignment Problem. Given the weekly self-promotion space (a set of TV breaks with known duration) and a set of products to promote, the problem consists of assigning the products to the breaks in the "best" possible way. The objective is to maximize contacts in the target audience for each product, whist satisfying all constraints. The HGA developed incorporates a greedy heuristic to initialize part of the population and uses a repair routine to guarantee feasibility of each member of the population. The HGA works on a simplified version of the problem that, nevertheless, maintains its essential features. The proposed simplified problem is a binary programming problem that has similarities with other known combinatorial optimization problems, such as the assignment problem or the multiple knapsack problem, but has some distinctive features that characterize it as a new problem. Although we are mainly interested in solving problems of large dimension (of about 200 breaks and 50 spots), the quality of the solution has been tested on smaller dimension problems for which we are able to find an exact global minimum using a branch-and-bound algorithm. For these smaller dimension problems we have obtained solutions, on average, within 1% of the optimal solution value.20112011-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bookapplication/pdfhttps://repositorio-aberto.up.pt/handle/10216/70367eng10.1007/978-3-642-20009-0_48Paulo A. PereiraFernando A.C.C. FontesDalila B.M.M. Fontesinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-29T15:47:34Zoai:repositorio-aberto.up.pt:10216/70367Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T00:32:18.850915Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
title |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
spellingShingle |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems Paulo A. Pereira Engenharia electrotécnica, Economia e gestão Electrical engineering, Economics and Business |
title_short |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
title_full |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
title_fullStr |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
title_full_unstemmed |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
title_sort |
A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems |
author |
Paulo A. Pereira |
author_facet |
Paulo A. Pereira Fernando A.C.C. Fontes Dalila B.M.M. Fontes |
author_role |
author |
author2 |
Fernando A.C.C. Fontes Dalila B.M.M. Fontes |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Paulo A. Pereira Fernando A.C.C. Fontes Dalila B.M.M. Fontes |
dc.subject.por.fl_str_mv |
Engenharia electrotécnica, Economia e gestão Electrical engineering, Economics and Business |
topic |
Engenharia electrotécnica, Economia e gestão Electrical engineering, Economics and Business |
description |
We propose a Hybrid Genetic Algorithm (HGA) for a combinatorial optimization problem, motivated by, and a simplification of, a TV Self-promotion Assignment Problem. Given the weekly self-promotion space (a set of TV breaks with known duration) and a set of products to promote, the problem consists of assigning the products to the breaks in the "best" possible way. The objective is to maximize contacts in the target audience for each product, whist satisfying all constraints. The HGA developed incorporates a greedy heuristic to initialize part of the population and uses a repair routine to guarantee feasibility of each member of the population. The HGA works on a simplified version of the problem that, nevertheless, maintains its essential features. The proposed simplified problem is a binary programming problem that has similarities with other known combinatorial optimization problems, such as the assignment problem or the multiple knapsack problem, but has some distinctive features that characterize it as a new problem. Although we are mainly interested in solving problems of large dimension (of about 200 breaks and 50 spots), the quality of the solution has been tested on smaller dimension problems for which we are able to find an exact global minimum using a branch-and-bound algorithm. For these smaller dimension problems we have obtained solutions, on average, within 1% of the optimal solution value. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011 2011-01-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/book |
format |
book |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://repositorio-aberto.up.pt/handle/10216/70367 |
url |
https://repositorio-aberto.up.pt/handle/10216/70367 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1007/978-3-642-20009-0_48 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136232011202560 |