Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
DOI10.1016/j.cor.2016.09.008zbMath1391.90508OpenAlexW2522962692MaRDI QIDQ1652137
Peter J. Fleming, El-Ghazali Talbi, Bruno N. Coelho, Thays A. Oliveira, Vitor N. Coelho, Igor M. Coelho, Helena Ramalhinho, Thibaut Lust, Frederico Gadelha Guimarães, Marcone Jamilson Freitas Souza
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/111555/1/Generic%20Pareto%20local%20search%20metaheuristic%20for%20optimization%20of%20targeted%20offers%20in%20a%20bi-objective%20direct%20marketing%20campaign.pdf
multi-objective optimizationmetaheuristicssharpe ratiocross-sellingPareto local searchdirect marketing campaign
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Marketing, advertising (90B60)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Two-phase Pareto local search for the biobjective traveling salesman problem
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A fuzzy mathematical programming approach for cross-sell optimization in retail banking
This page was built for publication: Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign