Please use this identifier to cite or link to this item: http://hdl.handle.net/1822/16920

TitleA hybrid genetic algorithm for constrained combinatorial problems : an application to promotion planning problem
Author(s)Pereira, Paulo A. A.
Fontes, Fernando A. C. C.
Fontes, Dalila B. M. M.
KeywordsGenetic algorithms
Combinatorial optimization
TV self-promotion
Assignment problem
TV Self-Promotion Assignment Problem
Issue dateJan-2011
PublisherSpringer Verlag
JournalOperations Research Proceedings
Abstract(s)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.
TypeConference paper
URIhttp://hdl.handle.net/1822/16920
ISBN9783642200083
DOI10.1007/978-3-642-20009-0_48
ISSN0721-5924
Publisher versionwww.springerlink.com
Peer-Reviewedyes
AccessRestricted access (UMinho)
Appears in Collections:CMAT - Artigos em atas de conferências e capítulos de livros com arbitragem / Papers in proceedings of conferences and book chapters with peer review

Files in This Item:
File Description SizeFormat 
OR-2010-HybridGA.pdf
  Restricted access
Documento principal83,76 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID