A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems

Paulo A. Pereira (), Fernando A. C. C. Fontes () and Dalila B. M. M. Fontes ()
Additional contact information
Paulo A. Pereira: Universidade do Minho
Fernando A. C. C. Fontes: Universidade do Porto
Dalila B. M. M. Fontes: Universidade do Porto

A chapter in Operations Research Proceedings 2010, 2011, pp 301-306 from Springer

Abstract: Abstract 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.

Keywords: Genetic Algorithms; Combinatorial Optimization; TV Self-Promotion Assignment Problem (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_48

Ordering information: This item can be ordered from
http://www.springer.com/9783642200090

DOI: 10.1007/978-3-642-20009-0_48

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().