Hybrid Genetic Algorithms for Solving Winner Determination Problem in Combinatorial Double Auction in Grid

Nowadays, since grid has been turned to commercialization, using economic methods such as auction methods are appropriate for resource allocation because of their decentralized nature. Combinatorial double auction has emerged as a major model in the economy and is a good approach for resource allocation in which participants of grid, give their requests once to the combination of resources instead of giving them to different resources multiple times. One problem with the combinatorial double auction is the efficient allocation of resources to derive the maximum benefit. This problem is known as winner determination problem (WDP) and is an NP-hard problem. So far, many methods have been proposed to solve this problem and genetic algorithm is one of the best ones. In this paper, two types of hybrid genetic algorithms were presented to improve the efficiency of genetic algorithm for solving the winner determination problem. The results showed that the proposed algorithms had good efficiency and led to better answers.