Advertising Time Allocation Using Genetic Algorithms

In this paper, the problem of allocating the advertising time to advertisers with the objective of maximizing the revenue of a TV network is formulated based on combinatorial auction mechanism. Since the problem is NP-complete, a genetic algorithm is developed to find the near-optimal solutions of the problem. Computational results demonstrate that the proposed algorithm is capable of obtaininghigh-quality solutions for the problem.

کلیدواژه ها:

Combinatorial Optimization ، TV Advertising ، Advertising Allocation Problem ، Combinatorial Auctions ، Genetic Algorithms