A genetic algorithm approach to large scale combinatorial optimization problems in the advertising industry.
Kazuhiro OhkuraTakashi IgarashiKanji UedaShin'ichiro OkauchiHisashi MatsunagaPublished in: ETFA (2) (2001)
Keyphrases
- combinatorial optimization problems
- genetic algorithm
- metaheuristic
- ant colony optimization
- job shop scheduling problem
- combinatorial optimization
- optimization problems
- discrete optimization
- knapsack problem
- job shop scheduling
- tabu search
- evolutionary algorithm
- simulated annealing
- continuous optimization problems
- fitness function
- traveling salesman problem
- min cost
- optimization method
- shortest path problem
- case study
- real world
- vehicle routing problem
- evolutionary computation
- online advertising
- particle swarm optimization
- genetic programming
- search space
- optimal solution
- multi objective
- special case
- search methods
- online marketing
- learning algorithm
- minmax regret