A novel particle swarm optimization for multiple campaigns assignment problem

Satchidananda Dehuri, Sung Bae Cho

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper presents a novel swarm intelligence approach to optimize simultaneously multiple campaigns assignment problem, which is a kind of searching problem aiming to find out a customer-campaign matrix to maximize the outcome of multiple campaigns under certain restrictions. It is treated as a very challenging problem in marketing. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Particle swarm optimization (PSO) method can be chosen as a suitable tool to overcome the multiple recommendation problems that occur when several personalized campaigns conducting simultaneously. Compared with original PSO we have modified the particle representation and velocity by a multi-dimensional matrix, which represents the customer-campaign assignment. A new operator known as REPAIRED is introduced to restrict the particle within the domain of solution space. The proposed operator helps the particle to fly into the better solution areas more quickly and discover the near optimal solution. We measure the effectiveness of the propose method with two other methods know as Random and Independent using randomly created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Simulation result shows a clear edge between PSO and other two methods.

Original languageEnglish
Title of host publication5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings
Pages317-324
Number of pages8
DOIs
Publication statusPublished - 2008 Dec 1
Event5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST '08 - Cergy-Pontoise, France
Duration: 2008 Oct 282008 Oct 31

Other

Other5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST '08
CountryFrance
CityCergy-Pontoise
Period08/10/2808/10/31

Fingerprint

Assignment Problem
Particle swarm optimization (PSO)
Particle Swarm Optimization
Customers
Marketing
Recommendations
Assignment
Optimise
Customer satisfaction
Customer Satisfaction
Swarm Intelligence
Operator
Optimization Methods
Percentage
Optimal Solution
Maximise
Simulation Study
Restriction
Simulation

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Dehuri, S., & Cho, S. B. (2008). A novel particle swarm optimization for multiple campaigns assignment problem. In 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings (pp. 317-324) https://doi.org/10.1145/1456223.1456290
Dehuri, Satchidananda ; Cho, Sung Bae. / A novel particle swarm optimization for multiple campaigns assignment problem. 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 2008. pp. 317-324
@inproceedings{65268474139048938a1b37d8dbcee0c2,
title = "A novel particle swarm optimization for multiple campaigns assignment problem",
abstract = "This paper presents a novel swarm intelligence approach to optimize simultaneously multiple campaigns assignment problem, which is a kind of searching problem aiming to find out a customer-campaign matrix to maximize the outcome of multiple campaigns under certain restrictions. It is treated as a very challenging problem in marketing. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Particle swarm optimization (PSO) method can be chosen as a suitable tool to overcome the multiple recommendation problems that occur when several personalized campaigns conducting simultaneously. Compared with original PSO we have modified the particle representation and velocity by a multi-dimensional matrix, which represents the customer-campaign assignment. A new operator known as REPAIRED is introduced to restrict the particle within the domain of solution space. The proposed operator helps the particle to fly into the better solution areas more quickly and discover the near optimal solution. We measure the effectiveness of the propose method with two other methods know as Random and Independent using randomly created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Simulation result shows a clear edge between PSO and other two methods.",
author = "Satchidananda Dehuri and Cho, {Sung Bae}",
year = "2008",
month = "12",
day = "1",
doi = "10.1145/1456223.1456290",
language = "English",
isbn = "9781605580463",
pages = "317--324",
booktitle = "5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings",

}

Dehuri, S & Cho, SB 2008, A novel particle swarm optimization for multiple campaigns assignment problem. in 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. pp. 317-324, 5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST '08, Cergy-Pontoise, France, 08/10/28. https://doi.org/10.1145/1456223.1456290

A novel particle swarm optimization for multiple campaigns assignment problem. / Dehuri, Satchidananda; Cho, Sung Bae.

5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 2008. p. 317-324.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A novel particle swarm optimization for multiple campaigns assignment problem

AU - Dehuri, Satchidananda

AU - Cho, Sung Bae

PY - 2008/12/1

Y1 - 2008/12/1

N2 - This paper presents a novel swarm intelligence approach to optimize simultaneously multiple campaigns assignment problem, which is a kind of searching problem aiming to find out a customer-campaign matrix to maximize the outcome of multiple campaigns under certain restrictions. It is treated as a very challenging problem in marketing. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Particle swarm optimization (PSO) method can be chosen as a suitable tool to overcome the multiple recommendation problems that occur when several personalized campaigns conducting simultaneously. Compared with original PSO we have modified the particle representation and velocity by a multi-dimensional matrix, which represents the customer-campaign assignment. A new operator known as REPAIRED is introduced to restrict the particle within the domain of solution space. The proposed operator helps the particle to fly into the better solution areas more quickly and discover the near optimal solution. We measure the effectiveness of the propose method with two other methods know as Random and Independent using randomly created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Simulation result shows a clear edge between PSO and other two methods.

AB - This paper presents a novel swarm intelligence approach to optimize simultaneously multiple campaigns assignment problem, which is a kind of searching problem aiming to find out a customer-campaign matrix to maximize the outcome of multiple campaigns under certain restrictions. It is treated as a very challenging problem in marketing. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Particle swarm optimization (PSO) method can be chosen as a suitable tool to overcome the multiple recommendation problems that occur when several personalized campaigns conducting simultaneously. Compared with original PSO we have modified the particle representation and velocity by a multi-dimensional matrix, which represents the customer-campaign assignment. A new operator known as REPAIRED is introduced to restrict the particle within the domain of solution space. The proposed operator helps the particle to fly into the better solution areas more quickly and discover the near optimal solution. We measure the effectiveness of the propose method with two other methods know as Random and Independent using randomly created customer-campaign preference matrix. Further a generalized Gaussian response suppression function is introduced and it differs among customer classes. An extensive simulation studies are carried out varying on the small to large scale of the customer-campaign assignment matrix and the percentage of recommendations. Simulation result shows a clear edge between PSO and other two methods.

UR - http://www.scopus.com/inward/record.url?scp=77951583554&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951583554&partnerID=8YFLogxK

U2 - 10.1145/1456223.1456290

DO - 10.1145/1456223.1456290

M3 - Conference contribution

AN - SCOPUS:77951583554

SN - 9781605580463

SP - 317

EP - 324

BT - 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings

ER -

Dehuri S, Cho SB. A novel particle swarm optimization for multiple campaigns assignment problem. In 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 2008. p. 317-324 https://doi.org/10.1145/1456223.1456290