Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2017

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign

(1) , (2) , (3) , (4) , (5) , (6) , (2) , (4) , (7, 8) , (9)
1
2
3
4
5
6
7
8
9

Abstract

Cross-selling campaigns seek to offer the right products to the set of customers with the goal of maximizing expected profit, while, at the same time, respecting the purchasing constraints set by investors. In this context, a bi-objective version of this NP-Hard problem is approached in this paper, aiming at maximizing both the promotion campaign total profit and the risk-adjusted return, which is estimated with the reward-to-variability ratio known as Sharpe ratio. Given the combinatorial nature of the problem and the large volume of data, heuristic methods are the most common used techniques. A Greedy Randomized Neighborhood Structure is also designed, including the characteristics of a neighborhood exploration strategy together with a Greedy Randomized Constructive technique, which is embedded in a multi-objective local search metaheuristic. The latter combines the power of neighborhood exploration by using a Pareto Local Search with Variable Neighborhood Search. Sets of non-dominated solutions obtained by the proposed method are described and analyzed for a number of problem instances.

Dates and versions

hal-01654721 , version 1 (04-12-2017)

Identifiers

Cite

Vitor N. Coelho, Thays A. Oliveira, Igor M. Coelho, Bruno N. Coelho, Peter J. Fleming, et al.. Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. Computers and Operations Research, 2017, 78, pp.578-587. ⟨10.1016/j.cor.2016.09.008⟩. ⟨hal-01654721⟩
117 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More