Title :

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

Author(s) :

Coelho, Vitor [Auteur]
Departamento de Engenharia Elétrica [Minas Gerais] [DEE - UFMG]
Oliveira, Thays [Auteur]
Universitat Pompeu Fabra [Barcelona] [UPF]
Coelho, Igor [Auteur]
Universidade do Estado do Rio de Janeiro [Brasil] = Rio de Janeiro State University [Brazil] = Université d'État de Rio de Janeiro [Brésil] [UERJ]
Coelho, Bruno [Auteur]
Universidade Federal de Ouro Preto [UFOP]
Fleming, Peter [Auteur]
Department of Automatic Control and Systems Engineering [ Sheffield] [ACSE]
Guimarães, Frederico [Auteur]
Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil] [UFMG]
Ramalhinho, Helena [Auteur]
Universitat Pompeu Fabra [Barcelona] [UPF]
Souza, Marcone [Auteur]
Universidade Federal de Ouro Preto [UFOP]
Talbi, El-Ghazali [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Lust, Thibaut [Auteur]
DECISION

Journal title :

Computers and Operations Research

Pages :

578-587

Publisher :

Elsevier

Publication date :

2017-02

ISSN :

0305-0548

HAL domain(s) :

Informatique [cs]
Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

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, ...
Show more >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.Show less >

Language :

Anglais

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL