By Topic

A genetic algorithm approach to large scale combinatorial optimization problems in the advertising industry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

The effectiveness of applying genetic algorithms to combinatorial optimization has been widely demonstrated using many types of benchmark problems, such as the traveling salesman problems and job-shop scheduling problems. We want to optimize strategies for advertising in newspapers sold in Japan. Our problem is to select appropriate newspapers and find the correct frequency of advertising for a product in order to maximize the level of advertising to which the target audience is exposed, within the constraint of a limited total budget. Advertising problems are typically so large and complex that conventional optimization techniques, such as hill-climbing, cannot find sufficiently cost-effective solutions. We show that a genetic algorithm (GA) approach works well for this type of problem. In addition, we demonstrate, through computer simulations, that an extended GA, called the operon-GA, finds better solutions much faster than a simple GA.

Published in:

Emerging Technologies and Factory Automation, 2001. Proceedings. 2001 8th IEEE International Conference on  (Volume:2 )

Date of Conference:

15-18 Oct. 2001