Honey bee behavior: A multi-agent approach for multiple campaigns assignment problem

Satchidananda Dehuri, Sung Bae Cho, Alok Kumar Jagadev

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

3 Citations (Scopus)

Abstract

This paper address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially 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. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT.

Original languageEnglish
Title of host publicationProceedings - 11th International Conference on Information Technology, ICIT 2008
Pages24-29
Number of pages6
DOIs
Publication statusPublished - 2008 Dec 1
Event11th International Conference on Information Technology, ICIT 2008 - Bhubaneswar, India
Duration: 2008 Dec 172008 Dec 20

Other

Other11th International Conference on Information Technology, ICIT 2008
CountryIndia
CityBhubaneswar
Period08/12/1708/12/20

Fingerprint

Marketing
Customer satisfaction
Computational complexity

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Dehuri, S., Cho, S. B., & Jagadev, A. K. (2008). Honey bee behavior: A multi-agent approach for multiple campaigns assignment problem. In Proceedings - 11th International Conference on Information Technology, ICIT 2008 (pp. 24-29). [4731292] https://doi.org/10.1109/ICIT.2008.14
Dehuri, Satchidananda ; Cho, Sung Bae ; Jagadev, Alok Kumar. / Honey bee behavior : A multi-agent approach for multiple campaigns assignment problem. Proceedings - 11th International Conference on Information Technology, ICIT 2008. 2008. pp. 24-29
@inproceedings{d3f1ebfa77634cdb93c1b48754888988,
title = "Honey bee behavior: A multi-agent approach for multiple campaigns assignment problem",
abstract = "This paper address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially 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. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT.",
author = "Satchidananda Dehuri and Cho, {Sung Bae} and Jagadev, {Alok Kumar}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ICIT.2008.14",
language = "English",
isbn = "9780769535135",
pages = "24--29",
booktitle = "Proceedings - 11th International Conference on Information Technology, ICIT 2008",

}

Dehuri, S, Cho, SB & Jagadev, AK 2008, Honey bee behavior: A multi-agent approach for multiple campaigns assignment problem. in Proceedings - 11th International Conference on Information Technology, ICIT 2008., 4731292, pp. 24-29, 11th International Conference on Information Technology, ICIT 2008, Bhubaneswar, India, 08/12/17. https://doi.org/10.1109/ICIT.2008.14

Honey bee behavior : A multi-agent approach for multiple campaigns assignment problem. / Dehuri, Satchidananda; Cho, Sung Bae; Jagadev, Alok Kumar.

Proceedings - 11th International Conference on Information Technology, ICIT 2008. 2008. p. 24-29 4731292.

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

TY - GEN

T1 - Honey bee behavior

T2 - A multi-agent approach for multiple campaigns assignment problem

AU - Dehuri, Satchidananda

AU - Cho, Sung Bae

AU - Jagadev, Alok Kumar

PY - 2008/12/1

Y1 - 2008/12/1

N2 - This paper address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially 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. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT.

AB - This paper address a multi-agent approach using the behavior of honey bee to find out an optimal customer-campaign relationship under certain restrictions for the problem of multiple campaigns assignment. This NP-hard problem is one of the key issues in marketing when producing the optimal campaign. In personalized marketing it is very important to optimize the customer satisfaction and targeting efficiency. Using the behavior of honey bee a multi-agent approach is proposed to overcome the multiple recommendations problem that occur when several personalized campaigns conducting simultaneously. We measure the effectiveness of the propose method with two other methods known as RANDOM and INDEPENDENT using an artificially 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. Computational result of the proposed method shows a clear edge vis-a-vis RANDOM and INDEPENDENT.

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

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

U2 - 10.1109/ICIT.2008.14

DO - 10.1109/ICIT.2008.14

M3 - Conference contribution

AN - SCOPUS:62449242778

SN - 9780769535135

SP - 24

EP - 29

BT - Proceedings - 11th International Conference on Information Technology, ICIT 2008

ER -

Dehuri S, Cho SB, Jagadev AK. Honey bee behavior: A multi-agent approach for multiple campaigns assignment problem. In Proceedings - 11th International Conference on Information Technology, ICIT 2008. 2008. p. 24-29. 4731292 https://doi.org/10.1109/ICIT.2008.14