Buyer coalitions with bundles of items by using genetic algorithm

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. © 2009 Springer Berlin Heidelberg.