A genetic algorithm approach for the TV self-promotion assignment problem

• Autor(es): Pereira, P. A. ; Fontes, Fernando A. C. C. ; Fontes, Dalila B. M. M.
• Data: 2009
• Identificador Persistente: http://hdl.handle.net/1822/11805
• Origem: RepositóriUM - Universidade do Minho
• Assunto(s): Genetic Algorithms; Combinatorial optimization; Image processing; Numerical optimization; TV self-promotion; Assignment problem
• Tipo de Documento: Documento de conferência
• Idioma: Inglês

Descrição

We report on the development of a Genetic Algorithm (GA), which has been integrated into a Decision Support System to plan the best assignment of the weekly self-promotion space for a TV station. The problem addressed consists on deciding which shows to advertise and when such that the number of viewers, of an intended group or target, is maximized. The GA proposed incorporates a greedy heuristic to find good initial solutions. These solutions, as well as the solutions later obtained through the use of the GA, go then through a repair procedure. This is used with two objectives, which are addressed in turn. Firstly, it checks the solution feasibility and if unfeasible it is fixed by removing some shows. Secondly, it tries to improve the solution by adding some extra shows. Since the problem faced by the commercial TV station is too big and has too many features it cannot be solved exactly. Therefore, in order to test the quality of the solutions provided by the proposed GA we have randomly generated some smaller problem instances. For these problems we have obtained solutions on average within 1% of the optimal solution value.