A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems
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 o...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | https://repositorio-aberto.up.pt/handle/10216/70367 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/70367 |