The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2008 vol.20)
pp: 383-396
ABSTRACT
Multicampaign assignment problem is a campaign model to overcome the multiple recommendation problem which occurs when conducting several personalized campaigns simultaneously. In this paper, we propose a Lagrangian method for the problem. The original problem space is transformed to another simpler one by introducing Lagrange multipliers which relax the constraints of the multicampaign assignment problem. When the Lagrangian vector is supplied, we can compute the optimal solution under this new environment in O(NK^2) time, where N and K are the numbers of customers and campaigns, respectively. This is a linear-time method when the number of campaigns is a constant. However, it is not easy to find a Lagrangian vector in exact accord with given problem constraints. We thus combine the Lagrangian method with a genetic algorithm to find good feasible solutions. We verify the effectiveness of our evolutionary Lagrangian approach in both theoretical and experimental views of points. The suggested Lagrangian approach is practically attractive for large-scale real-world problems.
INDEX TERMS
Electronic Commerce, Marketing, Constrained optimization, Algorithm design and analysis, Algorithms for data and knowledge management, Evolutionary computing and genetic algorithms
CITATION
Yong-Hyuk Kim, Yourim Yoon, Byung-Ro Moon, "A Lagrangian Approach for Multiple Personalized Campaigns", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 3, pp. 383-396, March 2008, doi:10.1109/TKDE.2007.190701
REFERENCES
[1] “Email Marketing Maximized,” Insight Report 2000, Peppers and Rogers Group, 2000.
[2] C.C. Aggarwal, J.L. Wolf, K.L. Wu, and P.S. Yu, “Horting Hatches an Egg: A New Graph-Theoretic Approach to Collaborative Filtering,” Proc. Fifth ACM SIGKDD Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 201-212, 1999.
[3] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[4] M.J.A. Berry and G. Linoff, Data Mining Techniques: For Marketing, Sales, and Customer Support. John Wiley & Sons, 1997.
[5] M.J.A. Berry and G. Linoff, Mastering Data Mining: The Art and Science of Customer Relationship Management. John Wiley & Sons, 2000.
[6] M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, “Time Bounds for Selection,” J. Computer and System Sciences, vol. 7, no. 4, pp. 448-461, 1973.
[7] T.N. Bui and B.R. Moon, “Genetic Algorithm and Graph Partitioning,” IEEE Trans. Computers, vol. 45, no. 7, pp. 841-855, July 1996.
[8] D. Cavicchio, “Adaptive Search Using Simulated Evolution,” PhD dissertation, Univ. of Michigan, Ann Arbor, 1970.
[9] E. Cela, The Quadratic Assignment Problem: Theory and Applications. Kluwer Academic Publishers, 1998.
[10] Y.-J. Chang and B.W. Wah, “Lagrangian Techniques for Solving a Class of Zero-One Integer Linear Programs,” Proc. 19th Ann. Int'l Computer Software and Applications Conf. (COMPSAC '95), pp. 156-161, 1995.
[11] P.C. Chu and J.E. Beasley, “A Genetic Algorithm for the Generalized Assignment Problem,” Computers and Operations Research, vol. 24, pp. 17-23, 1997.
[12] J. Dyché, The CRM Handbook: A Business Guide to Customer Relationship Management. Addison-Wesley, 2001.
[13] H. Everett, “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources,” Operations Research, vol. 11, pp. 399-417, 1963.
[14] M.L. Fisher, “The Lagrangian Relaxation Method for Solving Integer Programming Problems,” Management Science, vol. 27, no. 1, pp. 1-18, 1981.
[15] B. Gavish, “On Obtaining the “Best” Multipliers for a Lagrangean Relaxation for Integer Programming,” Computers and Operations Research, vol. 5, pp. 55-71, 1978.
[16] A.M. Geoffrion, “Lagrangean Relaxation for Integer Programming,” Math. Programming Study, vol. 2, pp. 82-114, 1974.
[17] D. Greening, “Building Consumer Trust with Accurate Product Recommendations,” Technical Report LMWSWP-210-6966, LikeMinds white paper, 1997.
[18] S. Handdadi and H. Ouzia, “An Effective Lagrangian Heuristic for the Generalized Assignment Problem,” Information Systems and Operational Research, vol. 39, no. 4, 2001.
[19] J.L. Herlocker, J.A. Konstan, A. Borchers, and J. Riedl, “An Algorithmic Framework for Performing Collaborative Filtering,” Proc. ACM SIGIR '99, pp. 230-237, 1999.
[20] Y.H. Kim and B.R. Moon, “Lock-Gain Based Graph Partitioning,” J. Heuristics, vol. 10, no. 1, pp. 37-57, Jan. 2004.
[21] Y.H. Kim and B.R. Moon, “Multicampaign Assignment Problem,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 3, pp. 405-414, Mar. 2006.
[22] J.A. Konstan, B.N. Miller, D. Maltz, J.L. Herlocker, L.R. Gordan, and J. Riedl, “GroupLens: Applying Collaborative Filtering to Usenet News,” Comm. ACM, vol. 40, pp. 77-87, 1997.
[23] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
[24] Y.K. Kwon and B.R. Moon, “Personalized Email Marketing with a Genetic Programming Circuit Model,” Proc. Genetic and Evolutionary Computation Conf. (GECCO '01), pp. 1352-1358, 2001.
[25] D.G. Luenberger, Optimization by Vector Space Methods. John Wiley & Sons, 1969.
[26] M.J. Magazine and O. Oguz, “A Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem,” European J. Operational Research, vol. 16, pp. 319-326, 1984.
[27] R.K. Martin, Large Scale Linear and Integer Optimization: A Unified Approach. Kluwer Academic Publishers, 1998.
[28] L. McCauley and S. Franklin, “A Large-Scale Multi-Agent System for Navy Personnel Distribution,” Connection Science, vol. 14, no. 4, pp. 371-385, 2002.
[29] P. Merz and B. Freisleben, “Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem,” IEEE Trans. Evolutionary Computation, vol. 4, no. 4, pp. 337-352, 2000.
[30] M.G. Narciso and L.A.N. Lorena, “Lagrangean/Surrogate Relaxation for Generalized Assignment Problems,” European J. Operational Research, vol. 114, pp. 165-177, 1999.
[31] G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
[32] G. Raidl, “Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem,” Proc. Congress on Evolutionary Computation (CEC '99), vol. 1, pp. 596-603, 1999.
[33] Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed. Halsted Press, 1993.
[34] P. Resnick, N. Iacovou, M. Sushak, P. Bergstrom, and J. Riedl, “GroupLens: An Open Architecture for Collaborative Filtering of Netnews,” Proc. Computer Supported Collaborative Work Conf. (CSCW '94), pp. 175-186, 1994.
[35] D. Schuurmans, F. Southey, and R.C. Holte, “The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming,” Proc. 17th Int'l Joint Conf. Artificial Intelligence (IJCAI '01), pp.334-341, 2001.
[36] J.F. Shapiro, “A Survey of Lagrangian Techniques for Discrete Optimization,” Annals of Discrete Math., vol. 5, pp. 113-138, 1979.
[37] U. Shardanand and P. Maes, “Social Information Filtering: Algorithms for Automating “Word of Mouth”,” Proc. ACM Conf. Human Factors in Computing Systems (CHI '95), vol. 1, pp. 210-217, 1995.
[38] G. Syswerda, “Uniform Crossover in Genetic Algorithms,” Proc. Third Int'l Conf. Genetic Algorithms (ICGA '89), pp. 2-9, 1989.
[39] B.W. Wah and Z. Wu, “The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization,” Proc. Fifth Int'l Conf. Principles and Practice of Constraint Programming (CP '99), pp.28-42, 1999.
[40] Y. Yoon, Y.H. Kim, and B.R. Moon, “An Evolutionary Lagrangian Method for the 0/1 Multiple Knapsack Problem,” Proc. Genetic and Evolutionary Computation Conf. (GECCO '05), pp. 629-635, 2005.
[41] Y. Yoon, Y.H. Kim, and B.R. Moon, “On the Computational Intractability of Multicampaign Assignment,” technical report, preprint, http://soar.snu.ac.kr/~yhdflymcap-npc.pdf , 2007.
61 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool