Buyer coalitions with bundles of items by using genetic algorithm

  • Authors:
  • Laor Boongasame;Anon Sukstrienwong

  • Affiliations:
  • Department of Computer Engineering, Bangkok University, Bangkok, Thailand;Department of Science and Technology, Bangkok University, Bangkok, Thailand

  • Venue:
  • ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

There are several existing buyer coalition schemes. These schemes do not consider forming a buyer coalition with bundles of items. There is only one scheme that forms a buyer coalition with bundles of items. Nevertheless, the scheme suffers from computational complexity. In this paper, we have applied genetic algorithms (GA) to form buyer coalitions with bundles of items, called the GroupPackageString scheme. The fitness function is defined by total discount of the buyer coalitions over the GA to measures the GroupPackageString scheme. The coalition results show that the total discount of any coalition in this scheme is higher than those in the GroupBuyPackage scheme.