A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions

In this paper, a differential evolution algorithm (DE) is studied for the optimal winner determination problem (WDP) in combinatorial auctions. Experiments on various benchmark problems are performed to show and compare the effectiveness of our approach. The comparisons between DE and hybrid simulated annealing (SAGII), genetic algorithms (GA) and memetic algorithms(MA) show that the DE provides competitive results and finds good quality solutions.