×

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. (English) Zbl 1391.90508

Summary: 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.

MSC:

90C27 Combinatorial optimization
90C59 Approximation methods and heuristics in mathematical programming
90C29 Multi-objective and goal programming
90B60 Marketing, advertising

Software:

Tabu search
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Sharpe, W. F., The sharpe ratio, J Portf Manag, 21, 1, 49-58, (1994)
[2] Chow, V.; Lai, C. W., Conditional sharpe ratios, Financ Res Lett, 12, 0, 117-133, (2015)
[3] Murali, S.; Pugazhendhi, S.; Muralidharan, C., Modelling and investigating the relationship of after sales service quality with customer satisfaction, retention and loyalty—a case study of home appliances business, J Retail Consum Serv, 30, 67-83, (2016)
[4] Ghazavi, E.; Lotfi, M., Formulation of customers’ shopping path in shelf space planninga simulation-optimization approach, Expert Syst Appl, 55, 243-254, (2016)
[5] Cohen, M.-D., Exploiting response modelsoptimizing cross-Sell and up-Sell opportunities in banking, Inf Syst, 29, 4, 327-341, (2004)
[6] Mahajan, V.; Muller, E.; Bass, F. M., New product di usion models in marketing: A review and directions for research, (Nebojša, Nakićenović; Arnulf, Grübler, Diffusion of technologies and social behavior, (1991), Springer Berlin Heidelberg Berlin, Heidelberg), 125-177, isbn=978-3-662-02700-4
[7] Lönnstedt, L., The use of operational research in twelve companies quoted on the Stockholm stock exchange, Oper Res Q (1970-1977), 24, 4, 535-545, (1973), URL 〈http://www.jstor.org/stable/3008331〉
[8] Daniel Jr JN, Busyn TF, Batterman BT. Marketing research system and method for obtaining retail data on a real time basis. uS Patent 4,972,504 ; 1990.
[9] Bhaskar, T.; Sundararajan, R.; Krishnan, P. G., A fuzzy mathematical programming approach for cross-Sell optimization in retail banking, J Oper Res Soc, 60, 5, 717-727, (2009) · Zbl 1171.90568
[10] Nobibon, F. T.; Leus, R.; Spieksma, F. C., Optimization models for targeted offers in direct marketingexact and heuristic algorithms, Eur J Oper Res, 210, 3, 670-683, (2011) · Zbl 1213.90149
[11] Barnhart, C.; Johnson, E. L.; Nemhauser, G. L.; Savelsbergh, M. W.P.; Vance, P. H., Branch-and-pricecolumn generation for solving huge integer programs, Oper Res, 46, 3, 316-329, (1998) · Zbl 0979.90092
[12] Glover, F.; Laguna, M., Tabu search, (1997), Kluwer Academic Publishers Boston · Zbl 0930.90083
[13] Delanote, S.; Leus, R.; Nobibon, F. T., Optimization of the annual planning of targeted offers in direct marketing, J Oper Res Soc, 64, 12, 1770-1779, (2013)
[14] Oliveira, T. A.; Coelho, V. N.; Souza, M. J.F.; Boava, D. L.T.; Boava, F.; Coelho, I. M., A hybrid variable neighborhood search algorithm for targeted offers in direct marketing, Electron Notes Discret Math, 47, 0, 205-212, (2015), the 3rd international conference on variable neighborhood search (VNS’14) · Zbl 1362.90251
[15] Hansen, P.; Mladenovic, N.; Pérez, J. A.M., Variable neighborhood search, Eur J Oper Res, 191, 593-595, (2008)
[16] Kirkpatrick, S., Optimization by simulated annealingquantitative studies, J Stat Phys, 34, 5-6, 975-986, (1984)
[17] Mladenovic, N.; Hansen, P., A variable neighborhood search, Comput Oper Res, 24, 1097-1100, (1997) · Zbl 0889.90119
[18] Coelho, V.; Grasas, A.; Ramalhinho, H.; Coelho, I.; Souza, M.; Cruz, R., An ils-based algorithm to solve a large-scale real heterogeneous fleet {VRP} with multi-trips and docking constraints, Eur J Oper Res, 250, 2, 367-376, (2016) · Zbl 1346.90090
[19] Feo, T. A.; Resende, M. G.C., Greedy randomized adaptive search procedures, J Global Optim, 6, 109-133, (1995) · Zbl 0822.90110
[20] Lust T, Teghem J, Tuyttens D. Very large-scale neighborhood search for solving multiobjective combinatorial optimization problems. In: Takahashi R, Deb K, Wanner E, Greco S, editors, Evolutionary multi-criterion optimization, Lecture notes in computer science, vol. 6576. Springer Berlin/Heidelberg; 2011. p. 254-68.
[21] Liefooghe, A.; Humeau, J.; Mesmoudi, S.; Jourdan, L.; Talbi, E.-G., On dominance-based multiobjective local searchdesign, implementation and experimental analysis on scheduling and traveling salesman problems, J Heuristics, 18, 2, 317-352, (2012) · Zbl 1358.90046
[22] Kellerer, H.; Pferschy, U.; Pisinger, D., Knapsack problems, (2004), Springer · Zbl 1103.90003
[23] Praag NV. Optimization of promotion campaigns using tabu search, Master’s thesis, Faculty of Business and Economics, KULeuven (2010).
[24] Paquete L, Chiarandini M, Stützle T. Metaheuristics for multiobjective optimisation. Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. Springer Berlin Heidelberg, Berlin, Heidelberg; 2004. p. 177-99. http://dx.doi.org/10.1007/978-3-642-17144-4_7.
[25] Angel E, Bampis E, Gourvès L. Metaheuristics for multiobjective optimisation. A dynasearch neighborhood for the bicriteria traveling salesman problem; 2004. p. 153-76. http://dx.doi.org/10.1007/978-3-642-17144-4_6.
[26] Talbi E-G, Rahoual M, Mabed MH, Dhaenens C. Evolutionary Multi-Criterion Optimization: First International Conference, EMO 2001 Zurich, Switzerland, March 7-9, 2001 Proceedings, Springer Berlin Heidelberg, Berlin, Heidelberg, 2001, Ch. A Hybrid Evolutionary Approach for Multicriteria Optimization Problems: Application to the Flow Shop, p. 416-28. http://dx.doi.org/10.1007/3-540-44719-9_29.
[27] Duarte, A.; Pantrigo, J. J.; Pardo, E. G.; Mladenovic, N., Multi-objective variable neighborhood searchan application to combinatorial optimization problems, J Global Optim, 63, 3, 515-536, (2015) · Zbl 1334.90142
[28] Lust, T.; Teghem, J., Two-phase Pareto local search for the biobjective traveling salesman problem, J Heuristics, 16, 475-510, (2010) · Zbl 1189.90145
[29] Coelho IM, Munhoz PLA, Haddad MN, Coelho VN, Silva MM, Souza MJF. A computational framework for combinatorial optimization problems. In: VII ALIO/EURO workshop on applied combinatorial optimization, Porto, 2011. p. 51-4.
[30] Souza, M. J.F.; Coelho, I. M.; Ribas, S.; Santos, H. G.; Merschmann, L. H.C., A hybrid heuristic algorithm for the open-pit-mining operational planning problem, Eur J Oper Res, 207, 2, 1041-1051, (2010) · Zbl 1206.90243
[31] Coelho, V. N.; Coelho, I. M.; Coelho, B. N.; Reis, A. J.; Enayatifar, R.; Souza, M. J., A self-adaptive evolutionary fuzzy model for load forecasting problems on smart grid environment, Appl Energy, 169, 567-584, (2016)
[32] Zitzler E, Thiele L. Multiobjective optimization using evolutionary algorithms - a comparative case study. In: Eiben A, Back T, Schoenauer M, Schwefel H-P, editors, Parallel problem solving from nature - PPSN V, Lecture notes in computer science, vol. 1498, Springer Berlin/Heidelberg, 1998. p. 292-301. http://dx.doi.org/10.1007/BFb0056872.
[33] Beume, N.; Fonseca, C.; Lopez-Ibanez, M.; Paquete, L.; Vahrenhold, J., On the complexity of computing the hypervolume indicator, IEEE Trans Evol Comput, 13, 5, 1075-1082, (2009)
[34] Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T., A fast and elitist multiobjective genetic algorithmnsga-II, IEEE Trans Evol Comput, 6, 2, 182-197, (2002)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.