Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign.
Vitor Nazário CoelhoThays A. OliveiraIgor Machado CoelhoBruno N. CoelhoPeter J. FlemingFrederico G. GuimarãesHelena Ramalhinho Dias LourençoMarcone J. F. SouzaEl-Ghazali TalbiThibaut LustPublished in: Comput. Oper. Res. (2017)
Keyphrases
- bi objective
- metaheuristic
- ant colony optimization
- optimization problems
- pareto local search
- direct marketing
- combinatorial optimization
- combinatorial optimization problems
- knapsack problem
- evolutionary algorithm
- set covering problem
- tabu search
- multiple objectives
- portfolio optimization
- multi objective
- scatter search
- efficient solutions
- swarm intelligence
- simulated annealing
- nsga ii
- optimal solution
- marketing strategies
- traveling salesman problem
- shortest path problem
- genetic algorithm
- particle swarm optimization
- search space
- vehicle routing problem
- nature inspired
- path relinking
- routing problem
- data mining
- global optimization
- multi objective optimization
- benchmark instances
- hybrid algorithm
- benchmark problems
- test problems
- variable neighborhood search
- objective function
- optimization algorithm
- linear programming
- cost function
- network design
- computational complexity