A New Hybrid Algorithm to Solve Winner Determination Problem in Multiunit Double Internet Auction

Abstract EN

Solving winner determination problem in multiunit double auction has become an important E-business task.

The main issue in double auction is to improve the reward in order to match the ideal prices and quantity and make the best profit for sellers and buyers according to their bids and predefined quantities.

There are many algorithms introduced for solving winner in multiunit double auction.

Conventional algorithms can find the optimal solution but they take a long time, particularly when they are applied to large dataset.

Nowadays, some evolutionary algorithms, such as particle swarm optimization and genetic algorithm, were proposed and have been applied.

In order to improve the speed of evolutionary algorithms convergence, we will propose a new kind of hybrid evolutionary algorithm that combines genetic algorithm (GA) with particle swarm optimization (PSO) to solve winner determination problem in multiunit double auction; we will refer to this algorithm as AUC-GAPSO.